./Ultimate.py --spec /mnt/goblint-svcomp/goblint-bench/bench/concrat/properties/no-data-race.prp --file /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-index-bitmask-race-2.i --full-output --architecture 32bit


--------------------------------------------------------------------------------


Checking for data races
Using default analysis
Version 2329fc70
Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data -tc /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/AutomizerReach.xml -i /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-index-bitmask-race-2.i -s /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6a10a439ae07eb226c124e5d910c515118f2123c0d38a765bd0b45bbc230640d
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-2329fc7
[2023-10-27 12:20:24,451 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2023-10-27 12:20:24,452 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2023-10-27 12:20:24,509 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2023-10-27 12:20:24,509 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2023-10-27 12:20:24,512 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2023-10-27 12:20:24,513 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2023-10-27 12:20:24,515 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2023-10-27 12:20:24,516 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2023-10-27 12:20:24,520 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2023-10-27 12:20:24,521 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2023-10-27 12:20:24,522 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2023-10-27 12:20:24,522 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2023-10-27 12:20:24,530 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2023-10-27 12:20:24,532 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2023-10-27 12:20:24,533 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2023-10-27 12:20:24,534 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2023-10-27 12:20:24,534 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2023-10-27 12:20:24,535 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2023-10-27 12:20:24,539 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2023-10-27 12:20:24,540 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2023-10-27 12:20:24,553 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2023-10-27 12:20:24,553 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2023-10-27 12:20:24,554 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2023-10-27 12:20:24,560 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2023-10-27 12:20:24,560 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2023-10-27 12:20:24,561 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2023-10-27 12:20:24,562 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2023-10-27 12:20:24,562 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2023-10-27 12:20:24,563 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2023-10-27 12:20:24,563 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2023-10-27 12:20:24,564 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2023-10-27 12:20:24,566 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2023-10-27 12:20:24,566 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2023-10-27 12:20:24,567 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2023-10-27 12:20:24,567 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2023-10-27 12:20:24,567 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2023-10-27 12:20:24,568 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2023-10-27 12:20:24,568 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2023-10-27 12:20:24,569 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2023-10-27 12:20:24,569 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2023-10-27 12:20:24,581 INFO  L101        SettingsManager]: Beginning loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2023-10-27 12:20:24,618 INFO  L113        SettingsManager]: Loading preferences was successful
[2023-10-27 12:20:24,618 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2023-10-27 12:20:24,619 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-10-27 12:20:24,619 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-10-27 12:20:24,620 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-10-27 12:20:24,620 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-10-27 12:20:24,620 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-10-27 12:20:24,621 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2023-10-27 12:20:24,621 INFO  L138        SettingsManager]:  * Use SBE=true
[2023-10-27 12:20:24,621 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-10-27 12:20:24,621 INFO  L138        SettingsManager]:  * sizeof long=4
[2023-10-27 12:20:24,622 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2023-10-27 12:20:24,622 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2023-10-27 12:20:24,622 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2023-10-27 12:20:24,622 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2023-10-27 12:20:24,622 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2023-10-27 12:20:24,622 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-10-27 12:20:24,623 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2023-10-27 12:20:24,623 INFO  L138        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2023-10-27 12:20:24,623 INFO  L138        SettingsManager]:  * sizeof long double=12
[2023-10-27 12:20:24,623 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2023-10-27 12:20:24,623 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2023-10-27 12:20:24,623 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2023-10-27 12:20:24,624 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-10-27 12:20:24,624 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2023-10-27 12:20:24,624 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2023-10-27 12:20:24,624 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-10-27 12:20:24,624 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-10-27 12:20:24,625 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2023-10-27 12:20:24,625 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2023-10-27 12:20:24,625 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2023-10-27 12:20:24,625 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-10-27 12:20:24,626 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2023-10-27 12:20:24,626 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-10-27 12:20:24,626 INFO  L138        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2023-10-27 12:20:24,626 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2023-10-27 12:20:24,627 INFO  L138        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2023-10-27 12:20:24,627 INFO  L138        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) )


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6a10a439ae07eb226c124e5d910c515118f2123c0d38a765bd0b45bbc230640d
[2023-10-27 12:20:25,004 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2023-10-27 12:20:25,027 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-10-27 12:20:25,029 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-10-27 12:20:25,030 INFO  L271        PluginConnector]: Initializing CDTParser...
[2023-10-27 12:20:25,030 INFO  L275        PluginConnector]: CDTParser initialized
[2023-10-27 12:20:25,031 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-index-bitmask-race-2.i
[2023-10-27 12:20:26,737 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2023-10-27 12:20:27,136 INFO  L351              CDTParser]: Found 1 translation units.
[2023-10-27 12:20:27,136 INFO  L172              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-index-bitmask-race-2.i
[2023-10-27 12:20:27,152 INFO  L394              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/285223b85/840971a644e442b4b904a8d093297e9f/FLAG2b6e642d2
[2023-10-27 12:20:27,172 INFO  L402              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/285223b85/840971a644e442b4b904a8d093297e9f
[2023-10-27 12:20:27,174 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-10-27 12:20:27,176 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2023-10-27 12:20:27,185 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-10-27 12:20:27,185 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-10-27 12:20:27,188 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2023-10-27 12:20:27,188 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 12:20:27" (1/1) ...
[2023-10-27 12:20:27,193 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d916945 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:20:27, skipping insertion in model container
[2023-10-27 12:20:27,193 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 12:20:27" (1/1) ...
[2023-10-27 12:20:27,202 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2023-10-27 12:20:27,259 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2023-10-27 12:20:27,512 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2023-10-27 12:20:27,803 WARN  L623        FunctionHandler]: Unknown extern function ffs
[2023-10-27 12:20:27,823 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-10-27 12:20:27,845 INFO  L203         MainTranslator]: Completed pre-run
[2023-10-27 12:20:27,889 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2023-10-27 12:20:27,908 WARN  L623        FunctionHandler]: Unknown extern function ffs
[2023-10-27 12:20:27,942 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-10-27 12:20:28,051 INFO  L208         MainTranslator]: Completed translation
[2023-10-27 12:20:28,052 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:20:28 WrapperNode
[2023-10-27 12:20:28,052 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-10-27 12:20:28,053 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-10-27 12:20:28,053 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-10-27 12:20:28,053 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2023-10-27 12:20:28,058 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:20:28" (1/1) ...
[2023-10-27 12:20:28,098 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:20:28" (1/1) ...
[2023-10-27 12:20:28,145 INFO  L138                Inliner]: procedures = 281, calls = 29, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 113
[2023-10-27 12:20:28,146 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-10-27 12:20:28,147 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-10-27 12:20:28,148 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2023-10-27 12:20:28,148 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2023-10-27 12:20:28,156 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:20:28" (1/1) ...
[2023-10-27 12:20:28,157 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:20:28" (1/1) ...
[2023-10-27 12:20:28,173 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:20:28" (1/1) ...
[2023-10-27 12:20:28,173 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:20:28" (1/1) ...
[2023-10-27 12:20:28,180 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:20:28" (1/1) ...
[2023-10-27 12:20:28,204 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:20:28" (1/1) ...
[2023-10-27 12:20:28,207 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:20:28" (1/1) ...
[2023-10-27 12:20:28,209 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:20:28" (1/1) ...
[2023-10-27 12:20:28,218 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-10-27 12:20:28,224 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-10-27 12:20:28,224 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2023-10-27 12:20:28,225 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2023-10-27 12:20:28,225 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:20:28" (1/1) ...
[2023-10-27 12:20:28,230 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-10-27 12:20:28,275 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-27 12:20:28,305 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2023-10-27 12:20:28,357 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2023-10-27 12:20:28,366 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-10-27 12:20:28,367 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2023-10-27 12:20:28,367 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-10-27 12:20:28,367 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2023-10-27 12:20:28,367 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2023-10-27 12:20:28,367 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2023-10-27 12:20:28,367 INFO  L130     BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock
[2023-10-27 12:20:28,367 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2023-10-27 12:20:28,368 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2023-10-27 12:20:28,368 INFO  L130     BoogieDeclarations]: Found specification of procedure ffs
[2023-10-27 12:20:28,368 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2023-10-27 12:20:28,368 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2023-10-27 12:20:28,368 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2023-10-27 12:20:28,368 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-10-27 12:20:28,368 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-10-27 12:20:28,370 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2023-10-27 12:20:28,604 INFO  L235             CfgBuilder]: Building ICFG
[2023-10-27 12:20:28,605 INFO  L261             CfgBuilder]: Building CFG for each procedure with an implementation
[2023-10-27 12:20:29,101 INFO  L276             CfgBuilder]: Performing block encoding
[2023-10-27 12:20:29,108 INFO  L295             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-10-27 12:20:29,124 INFO  L300             CfgBuilder]: Removed 2 assume(true) statements.
[2023-10-27 12:20:29,127 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:20:29 BoogieIcfgContainer
[2023-10-27 12:20:29,127 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-10-27 12:20:29,128 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-10-27 12:20:29,128 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2023-10-27 12:20:29,130 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2023-10-27 12:20:29,131 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 12:20:27" (1/3) ...
[2023-10-27 12:20:29,131 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72bb55fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 12:20:29, skipping insertion in model container
[2023-10-27 12:20:29,131 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:20:28" (2/3) ...
[2023-10-27 12:20:29,132 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72bb55fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 12:20:29, skipping insertion in model container
[2023-10-27 12:20:29,132 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:20:29" (3/3) ...
[2023-10-27 12:20:29,133 INFO  L112   eAbstractionObserver]: Analyzing ICFG per-thread-index-bitmask-race-2.i
[2023-10-27 12:20:29,138 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2023-10-27 12:20:29,164 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-10-27 12:20:29,165 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations.
[2023-10-27 12:20:29,165 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-10-27 12:20:29,287 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2023-10-27 12:20:29,376 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 160 places, 162 transitions, 332 flow
[2023-10-27 12:20:29,541 INFO  L130       PetriNetUnfolder]: 7/231 cut-off events.
[2023-10-27 12:20:29,542 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-10-27 12:20:29,548 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 237 conditions, 231 events. 7/231 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 411 event pairs, 0 based on Foata normal form. 0/200 useless extension candidates. Maximal degree in co-relation 118. Up to 4 conditions per place. 
[2023-10-27 12:20:29,548 INFO  L82        GeneralOperation]: Start removeDead. Operand has 160 places, 162 transitions, 332 flow
[2023-10-27 12:20:29,556 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 160 places, 162 transitions, 332 flow
[2023-10-27 12:20:29,565 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-10-27 12:20:29,600 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 160 places, 162 transitions, 332 flow
[2023-10-27 12:20:29,607 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 160 places, 162 transitions, 332 flow
[2023-10-27 12:20:29,608 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 160 places, 162 transitions, 332 flow
[2023-10-27 12:20:29,684 INFO  L130       PetriNetUnfolder]: 7/231 cut-off events.
[2023-10-27 12:20:29,685 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-10-27 12:20:29,687 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 237 conditions, 231 events. 7/231 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 411 event pairs, 0 based on Foata normal form. 0/200 useless extension candidates. Maximal degree in co-relation 118. Up to 4 conditions per place. 
[2023-10-27 12:20:29,689 INFO  L119        LiptonReduction]: Number of co-enabled transitions 4560
[2023-10-27 12:20:34,391 INFO  L134        LiptonReduction]: Checked pairs total: 29767
[2023-10-27 12:20:34,394 INFO  L136        LiptonReduction]: Total number of compositions: 107
[2023-10-27 12:20:34,414 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-10-27 12:20:34,429 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7c8b142a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-10-27 12:20:34,429 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 18 error locations.
[2023-10-27 12:20:34,431 INFO  L130       PetriNetUnfolder]: 0/0 cut-off events.
[2023-10-27 12:20:34,431 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-27 12:20:34,431 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:20:34,432 INFO  L209   CegarLoopForPetriNet]: trace histogram [1]
[2023-10-27 12:20:34,433 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-10-27 12:20:34,455 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:20:34,456 INFO  L85        PathProgramCache]: Analyzing trace with hash 520, now seen corresponding path program 1 times
[2023-10-27 12:20:34,468 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:20:34,468 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17166743]
[2023-10-27 12:20:34,468 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:20:34,469 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:20:34,615 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:20:34,662 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:20:34,664 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:20:34,664 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17166743]
[2023-10-27 12:20:34,665 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17166743] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:20:34,665 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:20:34,665 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0
[2023-10-27 12:20:34,666 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468048449]
[2023-10-27 12:20:34,667 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:20:34,674 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-10-27 12:20:34,686 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:20:34,730 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-10-27 12:20:34,732 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-10-27 12:20:34,735 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 156 out of 269
[2023-10-27 12:20:34,740 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 71 transitions, 150 flow. Second operand  has 2 states, 2 states have (on average 156.5) internal successors, (313), 2 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:34,740 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:20:34,740 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 269
[2023-10-27 12:20:34,741 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:20:34,919 INFO  L130       PetriNetUnfolder]: 85/465 cut-off events.
[2023-10-27 12:20:34,919 INFO  L131       PetriNetUnfolder]: For 2/2 co-relation queries the response was YES.
[2023-10-27 12:20:34,922 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 677 conditions, 465 events. 85/465 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2602 event pairs, 84 based on Foata normal form. 0/394 useless extension candidates. Maximal degree in co-relation 603. Up to 206 conditions per place. 
[2023-10-27 12:20:34,925 INFO  L137   encePairwiseOnDemand]: 268/269 looper letters, 24 selfloop transitions, 0 changer transitions 0/70 dead transitions.
[2023-10-27 12:20:34,925 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 70 transitions, 196 flow
[2023-10-27 12:20:34,926 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-10-27 12:20:34,928 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-10-27 12:20:34,942 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 337 transitions.
[2023-10-27 12:20:34,961 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6263940520446096
[2023-10-27 12:20:34,962 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 337 transitions.
[2023-10-27 12:20:34,962 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 337 transitions.
[2023-10-27 12:20:34,964 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:20:34,966 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 337 transitions.
[2023-10-27 12:20:34,971 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 168.5) internal successors, (337), 2 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:34,976 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 269.0) internal successors, (807), 3 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:34,977 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 269.0) internal successors, (807), 3 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:34,978 INFO  L175             Difference]: Start difference. First operand has 73 places, 71 transitions, 150 flow. Second operand 2 states and 337 transitions.
[2023-10-27 12:20:34,979 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 70 transitions, 196 flow
[2023-10-27 12:20:34,988 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 70 transitions, 196 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-27 12:20:34,990 INFO  L231             Difference]: Finished difference. Result has 73 places, 70 transitions, 148 flow
[2023-10-27 12:20:34,992 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=148, PETRI_PLACES=73, PETRI_TRANSITIONS=70}
[2023-10-27 12:20:34,996 INFO  L288   CegarLoopForPetriNet]: 73 programPoint places, 0 predicate places.
[2023-10-27 12:20:35,009 INFO  L495      AbstractCegarLoop]: Abstraction has has 73 places, 70 transitions, 148 flow
[2023-10-27 12:20:35,010 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 156.5) internal successors, (313), 2 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:35,011 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:20:35,012 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1]
[2023-10-27 12:20:35,013 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-10-27 12:20:35,013 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-10-27 12:20:35,014 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:20:35,014 INFO  L85        PathProgramCache]: Analyzing trace with hash 15885830, now seen corresponding path program 1 times
[2023-10-27 12:20:35,014 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:20:35,015 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557976664]
[2023-10-27 12:20:35,015 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:20:35,015 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:20:35,096 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:20:35,236 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:20:35,237 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:20:35,237 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557976664]
[2023-10-27 12:20:35,237 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557976664] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:20:35,237 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:20:35,237 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-27 12:20:35,238 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239904012]
[2023-10-27 12:20:35,238 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:20:35,241 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-27 12:20:35,242 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:20:35,242 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-27 12:20:35,243 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-27 12:20:35,278 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 145 out of 269
[2023-10-27 12:20:35,279 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 70 transitions, 148 flow. Second operand  has 3 states, 3 states have (on average 146.33333333333334) internal successors, (439), 3 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:35,279 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:20:35,279 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 269
[2023-10-27 12:20:35,279 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:20:35,563 INFO  L130       PetriNetUnfolder]: 194/695 cut-off events.
[2023-10-27 12:20:35,563 INFO  L131       PetriNetUnfolder]: For 2/2 co-relation queries the response was YES.
[2023-10-27 12:20:35,564 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1149 conditions, 695 events. 194/695 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 4142 event pairs, 95 based on Foata normal form. 0/607 useless extension candidates. Maximal degree in co-relation 1145. Up to 258 conditions per place. 
[2023-10-27 12:20:35,567 INFO  L137   encePairwiseOnDemand]: 258/269 looper letters, 51 selfloop transitions, 8 changer transitions 0/96 dead transitions.
[2023-10-27 12:20:35,567 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 96 transitions, 318 flow
[2023-10-27 12:20:35,568 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-27 12:20:35,568 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-27 12:20:35,569 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 497 transitions.
[2023-10-27 12:20:35,570 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6158612143742255
[2023-10-27 12:20:35,570 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 497 transitions.
[2023-10-27 12:20:35,570 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 497 transitions.
[2023-10-27 12:20:35,570 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:20:35,571 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 497 transitions.
[2023-10-27 12:20:35,572 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 165.66666666666666) internal successors, (497), 3 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:35,575 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:35,576 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:35,576 INFO  L175             Difference]: Start difference. First operand has 73 places, 70 transitions, 148 flow. Second operand 3 states and 497 transitions.
[2023-10-27 12:20:35,576 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 96 transitions, 318 flow
[2023-10-27 12:20:35,577 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 96 transitions, 318 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-27 12:20:35,579 INFO  L231             Difference]: Finished difference. Result has 77 places, 78 transitions, 218 flow
[2023-10-27 12:20:35,579 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=218, PETRI_PLACES=77, PETRI_TRANSITIONS=78}
[2023-10-27 12:20:35,580 INFO  L288   CegarLoopForPetriNet]: 73 programPoint places, 4 predicate places.
[2023-10-27 12:20:35,580 INFO  L495      AbstractCegarLoop]: Abstraction has has 77 places, 78 transitions, 218 flow
[2023-10-27 12:20:35,581 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 146.33333333333334) internal successors, (439), 3 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:35,581 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:20:35,581 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:20:35,581 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-10-27 12:20:35,582 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-10-27 12:20:35,582 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:20:35,582 INFO  L85        PathProgramCache]: Analyzing trace with hash 684977038, now seen corresponding path program 1 times
[2023-10-27 12:20:35,583 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:20:35,583 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355083656]
[2023-10-27 12:20:35,583 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:20:35,583 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:20:35,652 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:20:35,811 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:20:35,811 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:20:35,811 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355083656]
[2023-10-27 12:20:35,812 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355083656] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:20:35,812 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:20:35,812 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-10-27 12:20:35,812 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561034304]
[2023-10-27 12:20:35,812 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:20:35,812 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-10-27 12:20:35,813 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:20:35,813 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-10-27 12:20:35,813 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-10-27 12:20:35,908 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 150 out of 269
[2023-10-27 12:20:35,909 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 78 transitions, 218 flow. Second operand  has 4 states, 4 states have (on average 150.75) internal successors, (603), 4 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:35,909 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:20:35,910 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 269
[2023-10-27 12:20:35,910 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:20:36,090 INFO  L130       PetriNetUnfolder]: 115/642 cut-off events.
[2023-10-27 12:20:36,090 INFO  L131       PetriNetUnfolder]: For 53/64 co-relation queries the response was YES.
[2023-10-27 12:20:36,091 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1040 conditions, 642 events. 115/642 cut-off events. For 53/64 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 4191 event pairs, 79 based on Foata normal form. 1/570 useless extension candidates. Maximal degree in co-relation 1034. Up to 248 conditions per place. 
[2023-10-27 12:20:36,093 INFO  L137   encePairwiseOnDemand]: 265/269 looper letters, 40 selfloop transitions, 3 changer transitions 1/96 dead transitions.
[2023-10-27 12:20:36,093 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 96 transitions, 348 flow
[2023-10-27 12:20:36,093 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-10-27 12:20:36,094 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-10-27 12:20:36,095 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 643 transitions.
[2023-10-27 12:20:36,095 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5975836431226765
[2023-10-27 12:20:36,095 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 643 transitions.
[2023-10-27 12:20:36,095 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 643 transitions.
[2023-10-27 12:20:36,095 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:20:36,096 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 643 transitions.
[2023-10-27 12:20:36,097 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 160.75) internal successors, (643), 4 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:36,111 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 269.0) internal successors, (1345), 5 states have internal predecessors, (1345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:36,111 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 269.0) internal successors, (1345), 5 states have internal predecessors, (1345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:36,111 INFO  L175             Difference]: Start difference. First operand has 77 places, 78 transitions, 218 flow. Second operand 4 states and 643 transitions.
[2023-10-27 12:20:36,112 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 96 transitions, 348 flow
[2023-10-27 12:20:36,115 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 96 transitions, 330 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-27 12:20:36,117 INFO  L231             Difference]: Finished difference. Result has 80 places, 79 transitions, 218 flow
[2023-10-27 12:20:36,117 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=218, PETRI_PLACES=80, PETRI_TRANSITIONS=79}
[2023-10-27 12:20:36,118 INFO  L288   CegarLoopForPetriNet]: 73 programPoint places, 7 predicate places.
[2023-10-27 12:20:36,120 INFO  L495      AbstractCegarLoop]: Abstraction has has 80 places, 79 transitions, 218 flow
[2023-10-27 12:20:36,120 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 150.75) internal successors, (603), 4 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:36,121 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:20:36,121 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:20:36,121 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-10-27 12:20:36,121 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-10-27 12:20:36,121 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:20:36,121 INFO  L85        PathProgramCache]: Analyzing trace with hash 1382271816, now seen corresponding path program 1 times
[2023-10-27 12:20:36,122 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:20:36,122 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58873449]
[2023-10-27 12:20:36,122 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:20:36,122 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:20:36,166 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:20:36,568 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:20:36,568 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:20:36,568 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58873449]
[2023-10-27 12:20:36,569 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58873449] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:20:36,569 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:20:36,569 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-27 12:20:36,569 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14747543]
[2023-10-27 12:20:36,570 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:20:36,570 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-27 12:20:36,570 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:20:36,571 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-27 12:20:36,571 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-27 12:20:36,787 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 131 out of 269
[2023-10-27 12:20:36,788 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 79 transitions, 218 flow. Second operand  has 6 states, 6 states have (on average 132.33333333333334) internal successors, (794), 6 states have internal predecessors, (794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:36,788 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:20:36,788 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 269
[2023-10-27 12:20:36,788 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:20:37,129 INFO  L130       PetriNetUnfolder]: 363/1102 cut-off events.
[2023-10-27 12:20:37,130 INFO  L131       PetriNetUnfolder]: For 54/74 co-relation queries the response was YES.
[2023-10-27 12:20:37,131 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2118 conditions, 1102 events. 363/1102 cut-off events. For 54/74 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 6957 event pairs, 171 based on Foata normal form. 1/1042 useless extension candidates. Maximal degree in co-relation 2110. Up to 397 conditions per place. 
[2023-10-27 12:20:37,145 INFO  L137   encePairwiseOnDemand]: 246/269 looper letters, 79 selfloop transitions, 29 changer transitions 0/140 dead transitions.
[2023-10-27 12:20:37,145 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 140 transitions, 572 flow
[2023-10-27 12:20:37,147 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-27 12:20:37,147 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-27 12:20:37,148 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 893 transitions.
[2023-10-27 12:20:37,148 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5532837670384139
[2023-10-27 12:20:37,149 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 893 transitions.
[2023-10-27 12:20:37,149 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 893 transitions.
[2023-10-27 12:20:37,149 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:20:37,149 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 893 transitions.
[2023-10-27 12:20:37,151 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 148.83333333333334) internal successors, (893), 6 states have internal predecessors, (893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:37,153 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 269.0) internal successors, (1883), 7 states have internal predecessors, (1883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:37,154 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 269.0) internal successors, (1883), 7 states have internal predecessors, (1883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:37,154 INFO  L175             Difference]: Start difference. First operand has 80 places, 79 transitions, 218 flow. Second operand 6 states and 893 transitions.
[2023-10-27 12:20:37,154 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 140 transitions, 572 flow
[2023-10-27 12:20:37,163 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 140 transitions, 569 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-10-27 12:20:37,166 INFO  L231             Difference]: Finished difference. Result has 89 places, 108 transitions, 436 flow
[2023-10-27 12:20:37,166 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=436, PETRI_PLACES=89, PETRI_TRANSITIONS=108}
[2023-10-27 12:20:37,168 INFO  L288   CegarLoopForPetriNet]: 73 programPoint places, 16 predicate places.
[2023-10-27 12:20:37,168 INFO  L495      AbstractCegarLoop]: Abstraction has has 89 places, 108 transitions, 436 flow
[2023-10-27 12:20:37,168 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 132.33333333333334) internal successors, (794), 6 states have internal predecessors, (794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:37,168 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:20:37,169 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:20:37,169 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-10-27 12:20:37,169 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-10-27 12:20:37,169 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:20:37,169 INFO  L85        PathProgramCache]: Analyzing trace with hash 1416758618, now seen corresponding path program 1 times
[2023-10-27 12:20:37,169 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:20:37,170 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004250312]
[2023-10-27 12:20:37,170 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:20:37,170 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:20:37,204 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:20:37,225 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:20:37,225 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:20:37,225 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004250312]
[2023-10-27 12:20:37,226 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004250312] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:20:37,226 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:20:37,226 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-27 12:20:37,226 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031035703]
[2023-10-27 12:20:37,226 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:20:37,227 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-27 12:20:37,227 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:20:37,227 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-27 12:20:37,227 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-27 12:20:37,259 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 146 out of 269
[2023-10-27 12:20:37,260 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 108 transitions, 436 flow. Second operand  has 3 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:37,260 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:20:37,260 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 269
[2023-10-27 12:20:37,260 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:20:37,465 INFO  L130       PetriNetUnfolder]: 254/996 cut-off events.
[2023-10-27 12:20:37,465 INFO  L131       PetriNetUnfolder]: For 215/225 co-relation queries the response was YES.
[2023-10-27 12:20:37,467 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2170 conditions, 996 events. 254/996 cut-off events. For 215/225 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 6520 event pairs, 131 based on Foata normal form. 0/926 useless extension candidates. Maximal degree in co-relation 2158. Up to 418 conditions per place. 
[2023-10-27 12:20:37,469 INFO  L137   encePairwiseOnDemand]: 264/269 looper letters, 43 selfloop transitions, 6 changer transitions 0/118 dead transitions.
[2023-10-27 12:20:37,478 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 118 transitions, 564 flow
[2023-10-27 12:20:37,478 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-27 12:20:37,478 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-27 12:20:37,479 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 477 transitions.
[2023-10-27 12:20:37,479 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5910780669144982
[2023-10-27 12:20:37,480 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 477 transitions.
[2023-10-27 12:20:37,480 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 477 transitions.
[2023-10-27 12:20:37,480 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:20:37,480 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 477 transitions.
[2023-10-27 12:20:37,481 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:37,482 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:37,483 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:37,483 INFO  L175             Difference]: Start difference. First operand has 89 places, 108 transitions, 436 flow. Second operand 3 states and 477 transitions.
[2023-10-27 12:20:37,483 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 118 transitions, 564 flow
[2023-10-27 12:20:37,495 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 118 transitions, 564 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-27 12:20:37,498 INFO  L231             Difference]: Finished difference. Result has 92 places, 112 transitions, 478 flow
[2023-10-27 12:20:37,498 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=478, PETRI_PLACES=92, PETRI_TRANSITIONS=112}
[2023-10-27 12:20:37,501 INFO  L288   CegarLoopForPetriNet]: 73 programPoint places, 19 predicate places.
[2023-10-27 12:20:37,501 INFO  L495      AbstractCegarLoop]: Abstraction has has 92 places, 112 transitions, 478 flow
[2023-10-27 12:20:37,501 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:37,501 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:20:37,502 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:20:37,502 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2023-10-27 12:20:37,502 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-10-27 12:20:37,502 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:20:37,502 INFO  L85        PathProgramCache]: Analyzing trace with hash 1218505488, now seen corresponding path program 1 times
[2023-10-27 12:20:37,502 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:20:37,503 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060144059]
[2023-10-27 12:20:37,503 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:20:37,503 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:20:37,531 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:20:37,547 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:20:37,547 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:20:37,547 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060144059]
[2023-10-27 12:20:37,547 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060144059] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:20:37,548 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:20:37,548 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-27 12:20:37,548 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555131004]
[2023-10-27 12:20:37,548 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:20:37,561 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-27 12:20:37,561 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:20:37,563 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-27 12:20:37,567 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-27 12:20:37,575 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 149 out of 269
[2023-10-27 12:20:37,576 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 112 transitions, 478 flow. Second operand  has 3 states, 3 states have (on average 151.0) internal successors, (453), 3 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:37,576 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:20:37,577 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 269
[2023-10-27 12:20:37,577 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:20:37,778 INFO  L130       PetriNetUnfolder]: 242/919 cut-off events.
[2023-10-27 12:20:37,783 INFO  L131       PetriNetUnfolder]: For 243/273 co-relation queries the response was YES.
[2023-10-27 12:20:37,784 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2093 conditions, 919 events. 242/919 cut-off events. For 243/273 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 5823 event pairs, 56 based on Foata normal form. 27/904 useless extension candidates. Maximal degree in co-relation 2079. Up to 258 conditions per place. 
[2023-10-27 12:20:37,797 INFO  L137   encePairwiseOnDemand]: 265/269 looper letters, 49 selfloop transitions, 2 changer transitions 1/129 dead transitions.
[2023-10-27 12:20:37,798 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 129 transitions, 635 flow
[2023-10-27 12:20:37,798 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-27 12:20:37,798 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-27 12:20:37,799 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 492 transitions.
[2023-10-27 12:20:37,799 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6096654275092936
[2023-10-27 12:20:37,800 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 492 transitions.
[2023-10-27 12:20:37,800 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 492 transitions.
[2023-10-27 12:20:37,800 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:20:37,800 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 492 transitions.
[2023-10-27 12:20:37,801 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 164.0) internal successors, (492), 3 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:37,933 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:37,934 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:37,934 INFO  L175             Difference]: Start difference. First operand has 92 places, 112 transitions, 478 flow. Second operand 3 states and 492 transitions.
[2023-10-27 12:20:37,934 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 129 transitions, 635 flow
[2023-10-27 12:20:37,936 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 129 transitions, 628 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-10-27 12:20:37,938 INFO  L231             Difference]: Finished difference. Result has 92 places, 111 transitions, 476 flow
[2023-10-27 12:20:37,939 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=468, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=476, PETRI_PLACES=92, PETRI_TRANSITIONS=111}
[2023-10-27 12:20:37,940 INFO  L288   CegarLoopForPetriNet]: 73 programPoint places, 19 predicate places.
[2023-10-27 12:20:37,941 INFO  L495      AbstractCegarLoop]: Abstraction has has 92 places, 111 transitions, 476 flow
[2023-10-27 12:20:37,941 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 151.0) internal successors, (453), 3 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:37,941 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:20:37,941 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:20:37,941 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2023-10-27 12:20:37,942 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-10-27 12:20:37,942 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:20:37,942 INFO  L85        PathProgramCache]: Analyzing trace with hash -2141552765, now seen corresponding path program 1 times
[2023-10-27 12:20:37,943 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:20:37,943 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836617802]
[2023-10-27 12:20:37,943 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:20:37,943 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:20:37,956 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:20:38,000 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:20:38,001 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:20:38,002 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836617802]
[2023-10-27 12:20:38,002 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836617802] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:20:38,002 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:20:38,002 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-27 12:20:38,002 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458693157]
[2023-10-27 12:20:38,002 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:20:38,003 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-27 12:20:38,003 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:20:38,003 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-27 12:20:38,003 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-27 12:20:38,019 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 147 out of 269
[2023-10-27 12:20:38,020 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 111 transitions, 476 flow. Second operand  has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:38,020 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:20:38,020 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 269
[2023-10-27 12:20:38,020 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:20:38,224 INFO  L130       PetriNetUnfolder]: 287/1006 cut-off events.
[2023-10-27 12:20:38,237 INFO  L131       PetriNetUnfolder]: For 333/345 co-relation queries the response was YES.
[2023-10-27 12:20:38,239 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2414 conditions, 1006 events. 287/1006 cut-off events. For 333/345 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 6405 event pairs, 118 based on Foata normal form. 0/969 useless extension candidates. Maximal degree in co-relation 2400. Up to 430 conditions per place. 
[2023-10-27 12:20:38,241 INFO  L137   encePairwiseOnDemand]: 262/269 looper letters, 55 selfloop transitions, 11 changer transitions 0/133 dead transitions.
[2023-10-27 12:20:38,242 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 133 transitions, 689 flow
[2023-10-27 12:20:38,242 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-27 12:20:38,242 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-27 12:20:38,243 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 490 transitions.
[2023-10-27 12:20:38,243 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6071871127633209
[2023-10-27 12:20:38,243 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 490 transitions.
[2023-10-27 12:20:38,243 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 490 transitions.
[2023-10-27 12:20:38,244 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:20:38,244 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 490 transitions.
[2023-10-27 12:20:38,245 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:38,246 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:38,246 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:38,246 INFO  L175             Difference]: Start difference. First operand has 92 places, 111 transitions, 476 flow. Second operand 3 states and 490 transitions.
[2023-10-27 12:20:38,246 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 133 transitions, 689 flow
[2023-10-27 12:20:38,261 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 133 transitions, 682 flow, removed 2 selfloop flow, removed 2 redundant places.
[2023-10-27 12:20:38,263 INFO  L231             Difference]: Finished difference. Result has 93 places, 118 transitions, 560 flow
[2023-10-27 12:20:38,263 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=472, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=560, PETRI_PLACES=93, PETRI_TRANSITIONS=118}
[2023-10-27 12:20:38,264 INFO  L288   CegarLoopForPetriNet]: 73 programPoint places, 20 predicate places.
[2023-10-27 12:20:38,264 INFO  L495      AbstractCegarLoop]: Abstraction has has 93 places, 118 transitions, 560 flow
[2023-10-27 12:20:38,264 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:38,264 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:20:38,264 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:20:38,264 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2023-10-27 12:20:38,264 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-10-27 12:20:38,265 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:20:38,265 INFO  L85        PathProgramCache]: Analyzing trace with hash -1983322918, now seen corresponding path program 1 times
[2023-10-27 12:20:38,265 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:20:38,265 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625827725]
[2023-10-27 12:20:38,265 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:20:38,265 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:20:38,293 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:20:38,425 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-10-27 12:20:38,425 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:20:38,425 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625827725]
[2023-10-27 12:20:38,425 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625827725] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:20:38,425 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:20:38,426 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-10-27 12:20:38,426 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903186668]
[2023-10-27 12:20:38,426 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:20:38,426 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-27 12:20:38,427 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:20:38,428 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-27 12:20:38,428 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-27 12:20:38,448 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 151 out of 269
[2023-10-27 12:20:38,449 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 118 transitions, 560 flow. Second operand  has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:38,449 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:20:38,449 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 269
[2023-10-27 12:20:38,449 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:20:38,593 INFO  L130       PetriNetUnfolder]: 144/618 cut-off events.
[2023-10-27 12:20:38,593 INFO  L131       PetriNetUnfolder]: For 257/265 co-relation queries the response was YES.
[2023-10-27 12:20:38,594 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1509 conditions, 618 events. 144/618 cut-off events. For 257/265 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 3542 event pairs, 33 based on Foata normal form. 8/594 useless extension candidates. Maximal degree in co-relation 1494. Up to 142 conditions per place. 
[2023-10-27 12:20:38,598 INFO  L137   encePairwiseOnDemand]: 265/269 looper letters, 35 selfloop transitions, 4 changer transitions 0/105 dead transitions.
[2023-10-27 12:20:38,613 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 105 transitions, 528 flow
[2023-10-27 12:20:38,613 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-27 12:20:38,614 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-27 12:20:38,614 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 490 transitions.
[2023-10-27 12:20:38,615 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6071871127633209
[2023-10-27 12:20:38,615 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 490 transitions.
[2023-10-27 12:20:38,615 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 490 transitions.
[2023-10-27 12:20:38,615 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:20:38,615 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 490 transitions.
[2023-10-27 12:20:38,616 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:38,617 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:38,618 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:38,618 INFO  L175             Difference]: Start difference. First operand has 93 places, 118 transitions, 560 flow. Second operand 3 states and 490 transitions.
[2023-10-27 12:20:38,618 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 105 transitions, 528 flow
[2023-10-27 12:20:38,620 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 105 transitions, 488 flow, removed 10 selfloop flow, removed 8 redundant places.
[2023-10-27 12:20:38,624 INFO  L231             Difference]: Finished difference. Result has 82 places, 94 transitions, 380 flow
[2023-10-27 12:20:38,625 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=380, PETRI_PLACES=82, PETRI_TRANSITIONS=94}
[2023-10-27 12:20:38,626 INFO  L288   CegarLoopForPetriNet]: 73 programPoint places, 9 predicate places.
[2023-10-27 12:20:38,627 INFO  L495      AbstractCegarLoop]: Abstraction has has 82 places, 94 transitions, 380 flow
[2023-10-27 12:20:38,628 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:38,628 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:20:38,628 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:20:38,628 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2023-10-27 12:20:38,628 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-10-27 12:20:38,629 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:20:38,629 INFO  L85        PathProgramCache]: Analyzing trace with hash 912598932, now seen corresponding path program 1 times
[2023-10-27 12:20:38,629 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:20:38,629 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928554003]
[2023-10-27 12:20:38,629 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:20:38,629 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:20:38,675 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:20:39,206 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-10-27 12:20:39,206 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:20:39,207 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928554003]
[2023-10-27 12:20:39,207 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928554003] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:20:39,207 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:20:39,207 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-27 12:20:39,207 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137943643]
[2023-10-27 12:20:39,207 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:20:39,208 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-27 12:20:39,208 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:20:39,208 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-27 12:20:39,208 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-27 12:20:39,525 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 141 out of 269
[2023-10-27 12:20:39,526 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 94 transitions, 380 flow. Second operand  has 6 states, 6 states have (on average 143.83333333333334) internal successors, (863), 6 states have internal predecessors, (863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:39,526 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:20:39,526 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 269
[2023-10-27 12:20:39,526 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:20:39,761 INFO  L130       PetriNetUnfolder]: 271/838 cut-off events.
[2023-10-27 12:20:39,777 INFO  L131       PetriNetUnfolder]: For 366/372 co-relation queries the response was YES.
[2023-10-27 12:20:39,779 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2118 conditions, 838 events. 271/838 cut-off events. For 366/372 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 4843 event pairs, 102 based on Foata normal form. 0/808 useless extension candidates. Maximal degree in co-relation 2106. Up to 459 conditions per place. 
[2023-10-27 12:20:39,781 INFO  L137   encePairwiseOnDemand]: 258/269 looper letters, 62 selfloop transitions, 33 changer transitions 8/148 dead transitions.
[2023-10-27 12:20:39,781 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 148 transitions, 801 flow
[2023-10-27 12:20:39,781 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-27 12:20:39,782 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-27 12:20:39,783 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 922 transitions.
[2023-10-27 12:20:39,784 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5712515489467163
[2023-10-27 12:20:39,784 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 922 transitions.
[2023-10-27 12:20:39,784 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 922 transitions.
[2023-10-27 12:20:39,784 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:20:39,784 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 922 transitions.
[2023-10-27 12:20:39,786 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 153.66666666666666) internal successors, (922), 6 states have internal predecessors, (922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:39,788 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 269.0) internal successors, (1883), 7 states have internal predecessors, (1883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:39,789 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 269.0) internal successors, (1883), 7 states have internal predecessors, (1883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:39,789 INFO  L175             Difference]: Start difference. First operand has 82 places, 94 transitions, 380 flow. Second operand 6 states and 922 transitions.
[2023-10-27 12:20:39,789 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 148 transitions, 801 flow
[2023-10-27 12:20:39,791 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 148 transitions, 789 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-10-27 12:20:39,793 INFO  L231             Difference]: Finished difference. Result has 91 places, 124 transitions, 677 flow
[2023-10-27 12:20:39,793 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=677, PETRI_PLACES=91, PETRI_TRANSITIONS=124}
[2023-10-27 12:20:39,794 INFO  L288   CegarLoopForPetriNet]: 73 programPoint places, 18 predicate places.
[2023-10-27 12:20:39,794 INFO  L495      AbstractCegarLoop]: Abstraction has has 91 places, 124 transitions, 677 flow
[2023-10-27 12:20:39,794 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 143.83333333333334) internal successors, (863), 6 states have internal predecessors, (863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:39,794 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:20:39,798 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:20:39,798 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2023-10-27 12:20:39,798 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting threadErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-10-27 12:20:39,799 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:20:39,799 INFO  L85        PathProgramCache]: Analyzing trace with hash 621714841, now seen corresponding path program 1 times
[2023-10-27 12:20:39,799 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:20:39,801 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401195360]
[2023-10-27 12:20:39,801 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:20:39,802 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:20:39,837 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:20:40,332 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:20:40,333 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:20:40,333 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401195360]
[2023-10-27 12:20:40,333 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401195360] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:20:40,333 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:20:40,333 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-27 12:20:40,333 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726338761]
[2023-10-27 12:20:40,334 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:20:40,334 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-27 12:20:40,334 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:20:40,335 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-27 12:20:40,335 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-27 12:20:40,480 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 129 out of 269
[2023-10-27 12:20:40,481 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 124 transitions, 677 flow. Second operand  has 6 states, 6 states have (on average 132.66666666666666) internal successors, (796), 6 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:40,481 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:20:40,481 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 269
[2023-10-27 12:20:40,481 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:20:40,997 INFO  L130       PetriNetUnfolder]: 465/1172 cut-off events.
[2023-10-27 12:20:41,011 INFO  L131       PetriNetUnfolder]: For 849/859 co-relation queries the response was YES.
[2023-10-27 12:20:41,013 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3654 conditions, 1172 events. 465/1172 cut-off events. For 849/859 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 7126 event pairs, 143 based on Foata normal form. 0/1108 useless extension candidates. Maximal degree in co-relation 3637. Up to 808 conditions per place. 
[2023-10-27 12:20:41,017 INFO  L137   encePairwiseOnDemand]: 247/269 looper letters, 136 selfloop transitions, 76 changer transitions 24/258 dead transitions.
[2023-10-27 12:20:41,017 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 258 transitions, 1691 flow
[2023-10-27 12:20:41,017 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-27 12:20:41,017 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-27 12:20:41,019 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 941 transitions.
[2023-10-27 12:20:41,020 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5830235439900867
[2023-10-27 12:20:41,033 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 941 transitions.
[2023-10-27 12:20:41,033 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 941 transitions.
[2023-10-27 12:20:41,034 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:20:41,034 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 941 transitions.
[2023-10-27 12:20:41,035 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 156.83333333333334) internal successors, (941), 6 states have internal predecessors, (941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:41,037 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 269.0) internal successors, (1883), 7 states have internal predecessors, (1883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:41,038 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 269.0) internal successors, (1883), 7 states have internal predecessors, (1883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:41,038 INFO  L175             Difference]: Start difference. First operand has 91 places, 124 transitions, 677 flow. Second operand 6 states and 941 transitions.
[2023-10-27 12:20:41,038 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 258 transitions, 1691 flow
[2023-10-27 12:20:41,043 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 258 transitions, 1691 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-27 12:20:41,046 INFO  L231             Difference]: Finished difference. Result has 99 places, 190 transitions, 1268 flow
[2023-10-27 12:20:41,046 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=677, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1268, PETRI_PLACES=99, PETRI_TRANSITIONS=190}
[2023-10-27 12:20:41,047 INFO  L288   CegarLoopForPetriNet]: 73 programPoint places, 26 predicate places.
[2023-10-27 12:20:41,047 INFO  L495      AbstractCegarLoop]: Abstraction has has 99 places, 190 transitions, 1268 flow
[2023-10-27 12:20:41,047 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 132.66666666666666) internal successors, (796), 6 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:41,048 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:20:41,048 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1]
[2023-10-27 12:20:41,048 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2023-10-27 12:20:41,048 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-10-27 12:20:41,050 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:20:41,050 INFO  L85        PathProgramCache]: Analyzing trace with hash 318354962, now seen corresponding path program 1 times
[2023-10-27 12:20:41,051 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:20:41,051 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668293167]
[2023-10-27 12:20:41,051 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:20:41,051 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:20:41,107 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-27 12:20:41,107 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-10-27 12:20:41,150 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-27 12:20:41,199 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-10-27 12:20:41,199 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-10-27 12:20:41,200 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 18 remaining)
[2023-10-27 12:20:41,201 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (16 of 18 remaining)
[2023-10-27 12:20:41,201 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (15 of 18 remaining)
[2023-10-27 12:20:41,202 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (14 of 18 remaining)
[2023-10-27 12:20:41,202 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (13 of 18 remaining)
[2023-10-27 12:20:41,202 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (12 of 18 remaining)
[2023-10-27 12:20:41,202 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (11 of 18 remaining)
[2023-10-27 12:20:41,202 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (10 of 18 remaining)
[2023-10-27 12:20:41,202 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (9 of 18 remaining)
[2023-10-27 12:20:41,203 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (8 of 18 remaining)
[2023-10-27 12:20:41,203 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (7 of 18 remaining)
[2023-10-27 12:20:41,203 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (6 of 18 remaining)
[2023-10-27 12:20:41,203 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (5 of 18 remaining)
[2023-10-27 12:20:41,203 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (4 of 18 remaining)
[2023-10-27 12:20:41,203 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 18 remaining)
[2023-10-27 12:20:41,204 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 18 remaining)
[2023-10-27 12:20:41,204 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (1 of 18 remaining)
[2023-10-27 12:20:41,204 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (0 of 18 remaining)
[2023-10-27 12:20:41,204 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2023-10-27 12:20:41,204 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:20:41,206 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-10-27 12:20:41,206 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2023-10-27 12:20:41,250 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2023-10-27 12:20:41,255 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 193 places, 194 transitions, 406 flow
[2023-10-27 12:20:41,326 INFO  L130       PetriNetUnfolder]: 12/386 cut-off events.
[2023-10-27 12:20:41,326 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2023-10-27 12:20:41,327 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 400 conditions, 386 events. 12/386 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 842 event pairs, 0 based on Foata normal form. 0/333 useless extension candidates. Maximal degree in co-relation 233. Up to 8 conditions per place. 
[2023-10-27 12:20:41,327 INFO  L82        GeneralOperation]: Start removeDead. Operand has 193 places, 194 transitions, 406 flow
[2023-10-27 12:20:41,329 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 193 places, 194 transitions, 406 flow
[2023-10-27 12:20:41,329 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-10-27 12:20:41,329 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 193 places, 194 transitions, 406 flow
[2023-10-27 12:20:41,330 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 193 places, 194 transitions, 406 flow
[2023-10-27 12:20:41,330 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 193 places, 194 transitions, 406 flow
[2023-10-27 12:20:41,379 INFO  L130       PetriNetUnfolder]: 12/386 cut-off events.
[2023-10-27 12:20:41,379 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2023-10-27 12:20:41,380 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 400 conditions, 386 events. 12/386 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 842 event pairs, 0 based on Foata normal form. 0/333 useless extension candidates. Maximal degree in co-relation 233. Up to 8 conditions per place. 
[2023-10-27 12:20:41,385 INFO  L119        LiptonReduction]: Number of co-enabled transitions 11700
[2023-10-27 12:20:45,714 INFO  L134        LiptonReduction]: Checked pairs total: 76651
[2023-10-27 12:20:45,714 INFO  L136        LiptonReduction]: Total number of compositions: 117
[2023-10-27 12:20:45,715 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-10-27 12:20:45,715 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7c8b142a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-10-27 12:20:45,716 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 22 error locations.
[2023-10-27 12:20:45,716 INFO  L130       PetriNetUnfolder]: 0/1 cut-off events.
[2023-10-27 12:20:45,716 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-27 12:20:45,716 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:20:45,716 INFO  L209   CegarLoopForPetriNet]: trace histogram [1]
[2023-10-27 12:20:45,716 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2023-10-27 12:20:45,717 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:20:45,717 INFO  L85        PathProgramCache]: Analyzing trace with hash 862, now seen corresponding path program 1 times
[2023-10-27 12:20:45,717 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:20:45,717 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316344644]
[2023-10-27 12:20:45,717 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:20:45,725 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:20:45,739 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:20:45,740 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:20:45,740 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:20:45,740 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316344644]
[2023-10-27 12:20:45,740 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316344644] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:20:45,741 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:20:45,741 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0
[2023-10-27 12:20:45,741 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248515942]
[2023-10-27 12:20:45,741 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:20:45,741 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-10-27 12:20:45,741 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:20:45,742 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-10-27 12:20:45,742 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-10-27 12:20:45,742 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 186 out of 311
[2023-10-27 12:20:45,742 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 94 transitions, 206 flow. Second operand  has 2 states, 2 states have (on average 186.5) internal successors, (373), 2 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:45,743 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:20:45,743 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 311
[2023-10-27 12:20:45,743 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:20:46,468 INFO  L130       PetriNetUnfolder]: 1359/4243 cut-off events.
[2023-10-27 12:20:46,468 INFO  L131       PetriNetUnfolder]: For 51/51 co-relation queries the response was YES.
[2023-10-27 12:20:46,472 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6558 conditions, 4243 events. 1359/4243 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 36413 event pairs, 1350 based on Foata normal form. 0/3796 useless extension candidates. Maximal degree in co-relation 5785. Up to 2271 conditions per place. 
[2023-10-27 12:20:46,504 INFO  L137   encePairwiseOnDemand]: 310/311 looper letters, 32 selfloop transitions, 0 changer transitions 0/93 dead transitions.
[2023-10-27 12:20:46,504 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 93 transitions, 268 flow
[2023-10-27 12:20:46,504 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-10-27 12:20:46,504 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-10-27 12:20:46,505 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 405 transitions.
[2023-10-27 12:20:46,505 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6511254019292605
[2023-10-27 12:20:46,505 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 405 transitions.
[2023-10-27 12:20:46,505 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 405 transitions.
[2023-10-27 12:20:46,506 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:20:46,506 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 405 transitions.
[2023-10-27 12:20:46,506 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 202.5) internal successors, (405), 2 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:46,507 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 311.0) internal successors, (933), 3 states have internal predecessors, (933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:46,508 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 311.0) internal successors, (933), 3 states have internal predecessors, (933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:46,508 INFO  L175             Difference]: Start difference. First operand has 97 places, 94 transitions, 206 flow. Second operand 2 states and 405 transitions.
[2023-10-27 12:20:46,508 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 93 transitions, 268 flow
[2023-10-27 12:20:46,508 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 93 transitions, 268 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-27 12:20:46,519 INFO  L231             Difference]: Finished difference. Result has 97 places, 93 transitions, 204 flow
[2023-10-27 12:20:46,519 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=311, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=204, PETRI_PLACES=97, PETRI_TRANSITIONS=93}
[2023-10-27 12:20:46,520 INFO  L288   CegarLoopForPetriNet]: 97 programPoint places, 0 predicate places.
[2023-10-27 12:20:46,520 INFO  L495      AbstractCegarLoop]: Abstraction has has 97 places, 93 transitions, 204 flow
[2023-10-27 12:20:46,521 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 186.5) internal successors, (373), 2 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:46,521 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:20:46,521 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1]
[2023-10-27 12:20:46,521 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2023-10-27 12:20:46,521 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2023-10-27 12:20:46,521 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:20:46,522 INFO  L85        PathProgramCache]: Analyzing trace with hash 26468539, now seen corresponding path program 1 times
[2023-10-27 12:20:46,522 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:20:46,522 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991439989]
[2023-10-27 12:20:46,522 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:20:46,522 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:20:46,529 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:20:46,552 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:20:46,552 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:20:46,553 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991439989]
[2023-10-27 12:20:46,553 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991439989] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:20:46,553 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:20:46,553 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-27 12:20:46,553 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639649153]
[2023-10-27 12:20:46,553 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:20:46,554 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-27 12:20:46,554 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:20:46,554 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-27 12:20:46,555 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-27 12:20:46,582 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 171 out of 311
[2023-10-27 12:20:46,583 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 93 transitions, 204 flow. Second operand  has 3 states, 3 states have (on average 172.33333333333334) internal successors, (517), 3 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:46,583 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:20:46,584 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 311
[2023-10-27 12:20:46,584 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:20:48,364 INFO  L130       PetriNetUnfolder]: 5357/12121 cut-off events.
[2023-10-27 12:20:48,377 INFO  L131       PetriNetUnfolder]: For 151/203 co-relation queries the response was YES.
[2023-10-27 12:20:48,387 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20951 conditions, 12121 events. 5357/12121 cut-off events. For 151/203 co-relation queries the response was YES. Maximal size of possible extension queue 494. Compared 109188 event pairs, 2351 based on Foata normal form. 1/10806 useless extension candidates. Maximal degree in co-relation 20946. Up to 4997 conditions per place. 
[2023-10-27 12:20:48,440 INFO  L137   encePairwiseOnDemand]: 296/311 looper letters, 71 selfloop transitions, 11 changer transitions 0/131 dead transitions.
[2023-10-27 12:20:48,441 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 131 transitions, 455 flow
[2023-10-27 12:20:48,441 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-27 12:20:48,441 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-27 12:20:48,442 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 599 transitions.
[2023-10-27 12:20:48,443 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6420150053590568
[2023-10-27 12:20:48,443 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 599 transitions.
[2023-10-27 12:20:48,443 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 599 transitions.
[2023-10-27 12:20:48,443 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:20:48,446 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 599 transitions.
[2023-10-27 12:20:48,449 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 199.66666666666666) internal successors, (599), 3 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:48,452 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 311.0) internal successors, (1244), 4 states have internal predecessors, (1244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:48,453 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 311.0) internal successors, (1244), 4 states have internal predecessors, (1244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:48,453 INFO  L175             Difference]: Start difference. First operand has 97 places, 93 transitions, 204 flow. Second operand 3 states and 599 transitions.
[2023-10-27 12:20:48,453 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 131 transitions, 455 flow
[2023-10-27 12:20:48,469 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 131 transitions, 455 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-27 12:20:48,470 INFO  L231             Difference]: Finished difference. Result has 101 places, 104 transitions, 300 flow
[2023-10-27 12:20:48,470 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=311, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=300, PETRI_PLACES=101, PETRI_TRANSITIONS=104}
[2023-10-27 12:20:48,471 INFO  L288   CegarLoopForPetriNet]: 97 programPoint places, 4 predicate places.
[2023-10-27 12:20:48,471 INFO  L495      AbstractCegarLoop]: Abstraction has has 101 places, 104 transitions, 300 flow
[2023-10-27 12:20:48,472 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 172.33333333333334) internal successors, (517), 3 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:48,472 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:20:48,472 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:20:48,472 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2023-10-27 12:20:48,473 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2023-10-27 12:20:48,473 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:20:48,473 INFO  L85        PathProgramCache]: Analyzing trace with hash 1365186758, now seen corresponding path program 1 times
[2023-10-27 12:20:48,473 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:20:48,474 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026949982]
[2023-10-27 12:20:48,474 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:20:48,474 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:20:48,490 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:20:48,542 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:20:48,542 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:20:48,543 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026949982]
[2023-10-27 12:20:48,543 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026949982] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:20:48,543 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:20:48,543 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-10-27 12:20:48,543 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102646110]
[2023-10-27 12:20:48,543 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:20:48,544 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-10-27 12:20:48,544 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:20:48,544 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-10-27 12:20:48,544 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-10-27 12:20:48,616 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 180 out of 311
[2023-10-27 12:20:48,617 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 104 transitions, 300 flow. Second operand  has 4 states, 4 states have (on average 180.75) internal successors, (723), 4 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:48,618 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:20:48,618 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 311
[2023-10-27 12:20:48,618 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:20:49,829 INFO  L130       PetriNetUnfolder]: 2948/9148 cut-off events.
[2023-10-27 12:20:49,830 INFO  L131       PetriNetUnfolder]: For 1819/1916 co-relation queries the response was YES.
[2023-10-27 12:20:49,850 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16419 conditions, 9148 events. 2948/9148 cut-off events. For 1819/1916 co-relation queries the response was YES. Maximal size of possible extension queue 404. Compared 94054 event pairs, 2258 based on Foata normal form. 4/8430 useless extension candidates. Maximal degree in co-relation 16412. Up to 4477 conditions per place. 
[2023-10-27 12:20:49,927 INFO  L137   encePairwiseOnDemand]: 307/311 looper letters, 50 selfloop transitions, 3 changer transitions 1/123 dead transitions.
[2023-10-27 12:20:49,927 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 123 transitions, 452 flow
[2023-10-27 12:20:49,927 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-10-27 12:20:49,927 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-10-27 12:20:49,929 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 772 transitions.
[2023-10-27 12:20:49,930 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6205787781350482
[2023-10-27 12:20:49,930 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 772 transitions.
[2023-10-27 12:20:49,930 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 772 transitions.
[2023-10-27 12:20:49,930 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:20:49,930 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 772 transitions.
[2023-10-27 12:20:49,932 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:49,933 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 311.0) internal successors, (1555), 5 states have internal predecessors, (1555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:49,934 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 311.0) internal successors, (1555), 5 states have internal predecessors, (1555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:49,934 INFO  L175             Difference]: Start difference. First operand has 101 places, 104 transitions, 300 flow. Second operand 4 states and 772 transitions.
[2023-10-27 12:20:49,934 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 123 transitions, 452 flow
[2023-10-27 12:20:49,949 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 123 transitions, 428 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-27 12:20:49,963 INFO  L231             Difference]: Finished difference. Result has 104 places, 106 transitions, 298 flow
[2023-10-27 12:20:49,963 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=311, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=298, PETRI_PLACES=104, PETRI_TRANSITIONS=106}
[2023-10-27 12:20:49,964 INFO  L288   CegarLoopForPetriNet]: 97 programPoint places, 7 predicate places.
[2023-10-27 12:20:49,965 INFO  L495      AbstractCegarLoop]: Abstraction has has 104 places, 106 transitions, 298 flow
[2023-10-27 12:20:49,965 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 180.75) internal successors, (723), 4 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:49,965 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:20:49,965 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:20:49,965 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2023-10-27 12:20:49,965 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2023-10-27 12:20:49,966 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:20:49,966 INFO  L85        PathProgramCache]: Analyzing trace with hash 2091110687, now seen corresponding path program 1 times
[2023-10-27 12:20:49,966 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:20:49,966 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626427444]
[2023-10-27 12:20:49,966 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:20:49,966 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:20:49,981 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:20:50,187 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:20:50,187 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:20:50,187 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626427444]
[2023-10-27 12:20:50,187 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626427444] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:20:50,187 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:20:50,188 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-27 12:20:50,188 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826743576]
[2023-10-27 12:20:50,188 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:20:50,188 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-27 12:20:50,188 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:20:50,188 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-27 12:20:50,189 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-27 12:20:50,462 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 157 out of 311
[2023-10-27 12:20:50,463 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 106 transitions, 298 flow. Second operand  has 6 states, 6 states have (on average 158.33333333333334) internal successors, (950), 6 states have internal predecessors, (950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:50,463 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:20:50,463 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 311
[2023-10-27 12:20:50,463 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:20:54,422 INFO  L130       PetriNetUnfolder]: 14684/31360 cut-off events.
[2023-10-27 12:20:54,422 INFO  L131       PetriNetUnfolder]: For 2727/3213 co-relation queries the response was YES.
[2023-10-27 12:20:54,473 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 60211 conditions, 31360 events. 14684/31360 cut-off events. For 2727/3213 co-relation queries the response was YES. Maximal size of possible extension queue 1023. Compared 306959 event pairs, 5263 based on Foata normal form. 116/29904 useless extension candidates. Maximal degree in co-relation 60202. Up to 13146 conditions per place. 
[2023-10-27 12:20:54,666 INFO  L137   encePairwiseOnDemand]: 284/311 looper letters, 137 selfloop transitions, 48 changer transitions 0/230 dead transitions.
[2023-10-27 12:20:54,667 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 230 transitions, 960 flow
[2023-10-27 12:20:54,667 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-27 12:20:54,667 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-27 12:20:54,669 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1118 transitions.
[2023-10-27 12:20:54,680 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5991425509110396
[2023-10-27 12:20:54,681 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 1118 transitions.
[2023-10-27 12:20:54,681 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 1118 transitions.
[2023-10-27 12:20:54,681 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:20:54,681 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1118 transitions.
[2023-10-27 12:20:54,683 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 186.33333333333334) internal successors, (1118), 6 states have internal predecessors, (1118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:54,685 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 311.0) internal successors, (2177), 7 states have internal predecessors, (2177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:54,686 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 311.0) internal successors, (2177), 7 states have internal predecessors, (2177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:54,686 INFO  L175             Difference]: Start difference. First operand has 104 places, 106 transitions, 298 flow. Second operand 6 states and 1118 transitions.
[2023-10-27 12:20:54,686 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 230 transitions, 960 flow
[2023-10-27 12:20:54,705 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 230 transitions, 957 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-10-27 12:20:54,708 INFO  L231             Difference]: Finished difference. Result has 113 places, 154 transitions, 638 flow
[2023-10-27 12:20:54,708 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=311, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=638, PETRI_PLACES=113, PETRI_TRANSITIONS=154}
[2023-10-27 12:20:54,709 INFO  L288   CegarLoopForPetriNet]: 97 programPoint places, 16 predicate places.
[2023-10-27 12:20:54,710 INFO  L495      AbstractCegarLoop]: Abstraction has has 113 places, 154 transitions, 638 flow
[2023-10-27 12:20:54,710 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 158.33333333333334) internal successors, (950), 6 states have internal predecessors, (950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:54,710 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:20:54,710 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:20:54,710 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2023-10-27 12:20:54,710 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2023-10-27 12:20:54,711 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:20:54,711 INFO  L85        PathProgramCache]: Analyzing trace with hash 1383306441, now seen corresponding path program 1 times
[2023-10-27 12:20:54,711 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:20:54,711 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89270182]
[2023-10-27 12:20:54,712 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:20:54,712 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:20:54,722 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:20:54,740 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:20:54,740 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:20:54,740 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89270182]
[2023-10-27 12:20:54,741 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89270182] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:20:54,741 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:20:54,741 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-27 12:20:54,742 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449174307]
[2023-10-27 12:20:54,742 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:20:54,743 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-27 12:20:54,743 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:20:54,743 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-27 12:20:54,743 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-27 12:20:54,785 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 174 out of 311
[2023-10-27 12:20:54,786 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 154 transitions, 638 flow. Second operand  has 3 states, 3 states have (on average 176.66666666666666) internal successors, (530), 3 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:54,786 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:20:54,786 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 311
[2023-10-27 12:20:54,786 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:20:57,513 INFO  L130       PetriNetUnfolder]: 8670/22287 cut-off events.
[2023-10-27 12:20:57,513 INFO  L131       PetriNetUnfolder]: For 5643/6274 co-relation queries the response was YES.
[2023-10-27 12:20:57,550 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 48649 conditions, 22287 events. 8670/22287 cut-off events. For 5643/6274 co-relation queries the response was YES. Maximal size of possible extension queue 779. Compared 236377 event pairs, 4640 based on Foata normal form. 56/20896 useless extension candidates. Maximal degree in co-relation 48636. Up to 10149 conditions per place. 
[2023-10-27 12:20:57,678 INFO  L137   encePairwiseOnDemand]: 304/311 looper letters, 64 selfloop transitions, 11 changer transitions 0/175 dead transitions.
[2023-10-27 12:20:57,693 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 175 transitions, 852 flow
[2023-10-27 12:20:57,694 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-27 12:20:57,694 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-27 12:20:57,695 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 577 transitions.
[2023-10-27 12:20:57,695 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6184351554126474
[2023-10-27 12:20:57,695 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 577 transitions.
[2023-10-27 12:20:57,695 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 577 transitions.
[2023-10-27 12:20:57,696 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:20:57,696 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 577 transitions.
[2023-10-27 12:20:57,697 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 192.33333333333334) internal successors, (577), 3 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:57,699 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 311.0) internal successors, (1244), 4 states have internal predecessors, (1244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:57,699 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 311.0) internal successors, (1244), 4 states have internal predecessors, (1244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:57,700 INFO  L175             Difference]: Start difference. First operand has 113 places, 154 transitions, 638 flow. Second operand 3 states and 577 transitions.
[2023-10-27 12:20:57,700 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 175 transitions, 852 flow
[2023-10-27 12:20:57,787 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 175 transitions, 852 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-27 12:20:57,788 INFO  L231             Difference]: Finished difference. Result has 116 places, 163 transitions, 725 flow
[2023-10-27 12:20:57,788 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=311, PETRI_DIFFERENCE_MINUEND_FLOW=638, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=725, PETRI_PLACES=116, PETRI_TRANSITIONS=163}
[2023-10-27 12:20:57,789 INFO  L288   CegarLoopForPetriNet]: 97 programPoint places, 19 predicate places.
[2023-10-27 12:20:57,789 INFO  L495      AbstractCegarLoop]: Abstraction has has 116 places, 163 transitions, 725 flow
[2023-10-27 12:20:57,789 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 176.66666666666666) internal successors, (530), 3 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:57,789 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:20:57,789 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:20:57,790 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2023-10-27 12:20:57,790 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2023-10-27 12:20:57,790 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:20:57,790 INFO  L85        PathProgramCache]: Analyzing trace with hash -487095100, now seen corresponding path program 1 times
[2023-10-27 12:20:57,790 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:20:57,790 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667508166]
[2023-10-27 12:20:57,791 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:20:57,791 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:20:57,811 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:20:57,820 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:20:57,820 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:20:57,820 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667508166]
[2023-10-27 12:20:57,820 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667508166] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:20:57,820 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:20:57,821 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-27 12:20:57,821 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093390799]
[2023-10-27 12:20:57,821 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:20:57,822 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-27 12:20:57,822 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:20:57,822 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-27 12:20:57,822 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-27 12:20:57,837 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 176 out of 311
[2023-10-27 12:20:57,838 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 163 transitions, 725 flow. Second operand  has 3 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:57,838 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:20:57,838 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 311
[2023-10-27 12:20:57,838 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:20:59,923 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([803] L1045-9-->threadEXIT: Formula: (let ((.cse0 (select |v_#race_73| v_~datas~0.base_75)) (.cse1 (* v_threadThread1of2ForFork0_~j~0_27 4))) (and (= (select .cse0 (+ .cse1 3 v_~datas~0.offset_67)) |v_threadThread1of2ForFork0_#t~nondet6_26|) (= |v_threadThread1of2ForFork0_#t~nondet6_26| (select .cse0 (+ .cse1 v_~datas~0.offset_67))) (= |v_threadThread1of2ForFork0_#res.offset_9| 0) (= |v_threadThread1of2ForFork0_#t~nondet6_26| (select .cse0 (+ .cse1 2 v_~datas~0.offset_67))) (= (select .cse0 (+ .cse1 v_~datas~0.offset_67 1)) |v_threadThread1of2ForFork0_#t~nondet6_26|) (= |v_threadThread1of2ForFork0_#res.base_9| 0)))  InVars {#race=|v_#race_73|, threadThread1of2ForFork0_~j~0=v_threadThread1of2ForFork0_~j~0_27, ~datas~0.base=v_~datas~0.base_75, ~datas~0.offset=v_~datas~0.offset_67, threadThread1of2ForFork0_#t~nondet6=|v_threadThread1of2ForFork0_#t~nondet6_26|}  OutVars{#race=|v_#race_73|, threadThread1of2ForFork0_#res.base=|v_threadThread1of2ForFork0_#res.base_9|, threadThread1of2ForFork0_~j~0=v_threadThread1of2ForFork0_~j~0_27, threadThread1of2ForFork0_#res.offset=|v_threadThread1of2ForFork0_#res.offset_9|, ~datas~0.base=v_~datas~0.base_75, threadThread1of2ForFork0_#t~nondet5=|v_threadThread1of2ForFork0_#t~nondet5_15|, ~datas~0.offset=v_~datas~0.offset_67}  AuxVars[]  AssignedVars[threadThread1of2ForFork0_#res.base, threadThread1of2ForFork0_#res.offset, threadThread1of2ForFork0_#t~nondet5, threadThread1of2ForFork0_#t~nondet6][93], [threadThread1of2ForFork0InUse, Black: 219#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 217#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread2of2ForFork0InUse, 2#ULTIMATE.startEXITtrue, Black: 228#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet14#1|), 233#(= |#race~datas~0| 0), 79#L1045-4true, Black: 201#(= |#race~threads_mask~0| 0), 214#true, Black: 210#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 74#threadEXITtrue, Black: 207#(= |ULTIMATE.start_main_~i~0#1| 0), 226#true, 196#true, Black: 218#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 216#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)])
[2023-10-27 12:20:59,923 INFO  L383   tUnfolder$Statistics]: this new event has 73 ancestors and is cut-off event
[2023-10-27 12:20:59,923 INFO  L386   tUnfolder$Statistics]:   existing Event has 73 ancestors and is cut-off event
[2023-10-27 12:20:59,923 INFO  L386   tUnfolder$Statistics]:   existing Event has 73 ancestors and is cut-off event
[2023-10-27 12:20:59,924 INFO  L386   tUnfolder$Statistics]:   existing Event has 73 ancestors and is cut-off event
[2023-10-27 12:20:59,924 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([754] L1045-4-->L1045-6: Formula: (= (store |v_#race_68| v_~datas~0.base_63 (store (select |v_#race_68| v_~datas~0.base_63) (+ (* v_threadThread2of2ForFork0_~j~0_21 4) v_~datas~0.offset_55) |v_threadThread2of2ForFork0_#t~nondet6_21|)) |v_#race_67|)  InVars {#race=|v_#race_68|, ~datas~0.base=v_~datas~0.base_63, threadThread2of2ForFork0_~j~0=v_threadThread2of2ForFork0_~j~0_21, ~datas~0.offset=v_~datas~0.offset_55}  OutVars{#race=|v_#race_67|, ~datas~0.base=v_~datas~0.base_63, threadThread2of2ForFork0_#t~nondet6=|v_threadThread2of2ForFork0_#t~nondet6_21|, threadThread2of2ForFork0_~j~0=v_threadThread2of2ForFork0_~j~0_21, ~datas~0.offset=v_~datas~0.offset_55}  AuxVars[]  AssignedVars[#race, threadThread2of2ForFork0_#t~nondet6][180], [threadThread1of2ForFork0InUse, Black: 219#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 217#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread2of2ForFork0InUse, 2#ULTIMATE.startEXITtrue, Black: 228#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet14#1|), 233#(= |#race~datas~0| 0), Black: 201#(= |#race~threads_mask~0| 0), 214#true, 146#L1045-6true, 51#L1045-9true, Black: 210#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 207#(= |ULTIMATE.start_main_~i~0#1| 0), 226#true, 196#true, Black: 218#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 216#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)])
[2023-10-27 12:20:59,924 INFO  L383   tUnfolder$Statistics]: this new event has 73 ancestors and is cut-off event
[2023-10-27 12:20:59,924 INFO  L386   tUnfolder$Statistics]:   existing Event has 73 ancestors and is cut-off event
[2023-10-27 12:20:59,924 INFO  L386   tUnfolder$Statistics]:   existing Event has 73 ancestors and is cut-off event
[2023-10-27 12:20:59,924 INFO  L386   tUnfolder$Statistics]:   existing Event has 73 ancestors and is cut-off event
[2023-10-27 12:21:00,174 INFO  L130       PetriNetUnfolder]: 8970/22243 cut-off events.
[2023-10-27 12:21:00,175 INFO  L131       PetriNetUnfolder]: For 7883/9651 co-relation queries the response was YES.
[2023-10-27 12:21:00,588 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 51382 conditions, 22243 events. 8970/22243 cut-off events. For 7883/9651 co-relation queries the response was YES. Maximal size of possible extension queue 808. Compared 232363 event pairs, 2771 based on Foata normal form. 551/21807 useless extension candidates. Maximal degree in co-relation 51367. Up to 8967 conditions per place. 
[2023-10-27 12:21:00,707 INFO  L137   encePairwiseOnDemand]: 305/311 looper letters, 74 selfloop transitions, 3 changer transitions 1/189 dead transitions.
[2023-10-27 12:21:00,717 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 189 transitions, 979 flow
[2023-10-27 12:21:00,717 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-27 12:21:00,718 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-27 12:21:00,721 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 588 transitions.
[2023-10-27 12:21:00,722 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6302250803858521
[2023-10-27 12:21:00,722 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 588 transitions.
[2023-10-27 12:21:00,722 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 588 transitions.
[2023-10-27 12:21:00,723 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:21:00,723 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 588 transitions.
[2023-10-27 12:21:00,725 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 196.0) internal successors, (588), 3 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:00,726 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 311.0) internal successors, (1244), 4 states have internal predecessors, (1244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:00,731 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 311.0) internal successors, (1244), 4 states have internal predecessors, (1244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:00,731 INFO  L175             Difference]: Start difference. First operand has 116 places, 163 transitions, 725 flow. Second operand 3 states and 588 transitions.
[2023-10-27 12:21:00,731 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 189 transitions, 979 flow
[2023-10-27 12:21:00,812 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 189 transitions, 965 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-10-27 12:21:00,815 INFO  L231             Difference]: Finished difference. Result has 115 places, 162 transitions, 723 flow
[2023-10-27 12:21:00,815 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=311, PETRI_DIFFERENCE_MINUEND_FLOW=708, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=723, PETRI_PLACES=115, PETRI_TRANSITIONS=162}
[2023-10-27 12:21:00,820 INFO  L288   CegarLoopForPetriNet]: 97 programPoint places, 18 predicate places.
[2023-10-27 12:21:00,820 INFO  L495      AbstractCegarLoop]: Abstraction has has 115 places, 162 transitions, 723 flow
[2023-10-27 12:21:00,821 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:00,821 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:21:00,821 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:21:00,821 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2023-10-27 12:21:00,821 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2023-10-27 12:21:00,821 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:21:00,822 INFO  L85        PathProgramCache]: Analyzing trace with hash -1215785545, now seen corresponding path program 1 times
[2023-10-27 12:21:00,822 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:21:00,824 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620141177]
[2023-10-27 12:21:00,824 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:21:00,824 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:21:00,850 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:21:00,901 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:21:00,901 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:21:00,902 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620141177]
[2023-10-27 12:21:00,902 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620141177] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:21:00,902 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:21:00,902 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-27 12:21:00,902 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855342709]
[2023-10-27 12:21:00,902 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:21:00,902 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-27 12:21:00,903 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:21:00,903 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-27 12:21:00,903 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-27 12:21:00,928 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 175 out of 311
[2023-10-27 12:21:00,929 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 162 transitions, 723 flow. Second operand  has 3 states, 3 states have (on average 180.33333333333334) internal successors, (541), 3 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:00,929 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:21:00,929 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 311
[2023-10-27 12:21:00,929 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:21:03,092 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([803] L1045-9-->threadEXIT: Formula: (let ((.cse0 (select |v_#race_73| v_~datas~0.base_75)) (.cse1 (* v_threadThread1of2ForFork0_~j~0_27 4))) (and (= (select .cse0 (+ .cse1 3 v_~datas~0.offset_67)) |v_threadThread1of2ForFork0_#t~nondet6_26|) (= |v_threadThread1of2ForFork0_#t~nondet6_26| (select .cse0 (+ .cse1 v_~datas~0.offset_67))) (= |v_threadThread1of2ForFork0_#res.offset_9| 0) (= |v_threadThread1of2ForFork0_#t~nondet6_26| (select .cse0 (+ .cse1 2 v_~datas~0.offset_67))) (= (select .cse0 (+ .cse1 v_~datas~0.offset_67 1)) |v_threadThread1of2ForFork0_#t~nondet6_26|) (= |v_threadThread1of2ForFork0_#res.base_9| 0)))  InVars {#race=|v_#race_73|, threadThread1of2ForFork0_~j~0=v_threadThread1of2ForFork0_~j~0_27, ~datas~0.base=v_~datas~0.base_75, ~datas~0.offset=v_~datas~0.offset_67, threadThread1of2ForFork0_#t~nondet6=|v_threadThread1of2ForFork0_#t~nondet6_26|}  OutVars{#race=|v_#race_73|, threadThread1of2ForFork0_#res.base=|v_threadThread1of2ForFork0_#res.base_9|, threadThread1of2ForFork0_~j~0=v_threadThread1of2ForFork0_~j~0_27, threadThread1of2ForFork0_#res.offset=|v_threadThread1of2ForFork0_#res.offset_9|, ~datas~0.base=v_~datas~0.base_75, threadThread1of2ForFork0_#t~nondet5=|v_threadThread1of2ForFork0_#t~nondet5_15|, ~datas~0.offset=v_~datas~0.offset_67}  AuxVars[]  AssignedVars[threadThread1of2ForFork0_#res.base, threadThread1of2ForFork0_#res.offset, threadThread1of2ForFork0_#t~nondet5, threadThread1of2ForFork0_#t~nondet6][91], [Black: 219#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread1of2ForFork0InUse, Black: 217#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread2of2ForFork0InUse, 2#ULTIMATE.startEXITtrue, Black: 228#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet14#1|), 233#(= |#race~datas~0| 0), Black: 201#(= |#race~threads_mask~0| 0), Black: 231#true, 214#true, Black: 210#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 74#threadEXITtrue, Black: 207#(= |ULTIMATE.start_main_~i~0#1| 0), 236#true, 196#true, 121#L1044true, Black: 218#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 216#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)])
[2023-10-27 12:21:03,093 INFO  L383   tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event
[2023-10-27 12:21:03,093 INFO  L386   tUnfolder$Statistics]:   existing Event has 69 ancestors and is cut-off event
[2023-10-27 12:21:03,093 INFO  L386   tUnfolder$Statistics]:   existing Event has 69 ancestors and is cut-off event
[2023-10-27 12:21:03,093 INFO  L386   tUnfolder$Statistics]:   existing Event has 69 ancestors and is cut-off event
[2023-10-27 12:21:03,635 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([803] L1045-9-->threadEXIT: Formula: (let ((.cse0 (select |v_#race_73| v_~datas~0.base_75)) (.cse1 (* v_threadThread1of2ForFork0_~j~0_27 4))) (and (= (select .cse0 (+ .cse1 3 v_~datas~0.offset_67)) |v_threadThread1of2ForFork0_#t~nondet6_26|) (= |v_threadThread1of2ForFork0_#t~nondet6_26| (select .cse0 (+ .cse1 v_~datas~0.offset_67))) (= |v_threadThread1of2ForFork0_#res.offset_9| 0) (= |v_threadThread1of2ForFork0_#t~nondet6_26| (select .cse0 (+ .cse1 2 v_~datas~0.offset_67))) (= (select .cse0 (+ .cse1 v_~datas~0.offset_67 1)) |v_threadThread1of2ForFork0_#t~nondet6_26|) (= |v_threadThread1of2ForFork0_#res.base_9| 0)))  InVars {#race=|v_#race_73|, threadThread1of2ForFork0_~j~0=v_threadThread1of2ForFork0_~j~0_27, ~datas~0.base=v_~datas~0.base_75, ~datas~0.offset=v_~datas~0.offset_67, threadThread1of2ForFork0_#t~nondet6=|v_threadThread1of2ForFork0_#t~nondet6_26|}  OutVars{#race=|v_#race_73|, threadThread1of2ForFork0_#res.base=|v_threadThread1of2ForFork0_#res.base_9|, threadThread1of2ForFork0_~j~0=v_threadThread1of2ForFork0_~j~0_27, threadThread1of2ForFork0_#res.offset=|v_threadThread1of2ForFork0_#res.offset_9|, ~datas~0.base=v_~datas~0.base_75, threadThread1of2ForFork0_#t~nondet5=|v_threadThread1of2ForFork0_#t~nondet5_15|, ~datas~0.offset=v_~datas~0.offset_67}  AuxVars[]  AssignedVars[threadThread1of2ForFork0_#res.base, threadThread1of2ForFork0_#res.offset, threadThread1of2ForFork0_#t~nondet5, threadThread1of2ForFork0_#t~nondet6][91], [Black: 219#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread1of2ForFork0InUse, Black: 217#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread2of2ForFork0InUse, 2#ULTIMATE.startEXITtrue, Black: 228#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet14#1|), 233#(= |#race~datas~0| 0), 79#L1045-4true, Black: 201#(= |#race~threads_mask~0| 0), Black: 231#true, 214#true, Black: 210#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 74#threadEXITtrue, Black: 207#(= |ULTIMATE.start_main_~i~0#1| 0), 236#true, 196#true, Black: 218#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 216#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)])
[2023-10-27 12:21:03,635 INFO  L383   tUnfolder$Statistics]: this new event has 73 ancestors and is cut-off event
[2023-10-27 12:21:03,635 INFO  L386   tUnfolder$Statistics]:   existing Event has 73 ancestors and is cut-off event
[2023-10-27 12:21:03,635 INFO  L386   tUnfolder$Statistics]:   existing Event has 73 ancestors and is cut-off event
[2023-10-27 12:21:03,636 INFO  L386   tUnfolder$Statistics]:   existing Event has 73 ancestors and is cut-off event
[2023-10-27 12:21:03,636 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([754] L1045-4-->L1045-6: Formula: (= (store |v_#race_68| v_~datas~0.base_63 (store (select |v_#race_68| v_~datas~0.base_63) (+ (* v_threadThread2of2ForFork0_~j~0_21 4) v_~datas~0.offset_55) |v_threadThread2of2ForFork0_#t~nondet6_21|)) |v_#race_67|)  InVars {#race=|v_#race_68|, ~datas~0.base=v_~datas~0.base_63, threadThread2of2ForFork0_~j~0=v_threadThread2of2ForFork0_~j~0_21, ~datas~0.offset=v_~datas~0.offset_55}  OutVars{#race=|v_#race_67|, ~datas~0.base=v_~datas~0.base_63, threadThread2of2ForFork0_#t~nondet6=|v_threadThread2of2ForFork0_#t~nondet6_21|, threadThread2of2ForFork0_~j~0=v_threadThread2of2ForFork0_~j~0_21, ~datas~0.offset=v_~datas~0.offset_55}  AuxVars[]  AssignedVars[#race, threadThread2of2ForFork0_#t~nondet6][183], [threadThread1of2ForFork0InUse, Black: 219#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 217#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread2of2ForFork0InUse, 2#ULTIMATE.startEXITtrue, Black: 228#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet14#1|), 233#(= |#race~datas~0| 0), Black: 201#(= |#race~threads_mask~0| 0), Black: 231#true, 214#true, 146#L1045-6true, 51#L1045-9true, Black: 210#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 207#(= |ULTIMATE.start_main_~i~0#1| 0), 236#true, 196#true, Black: 218#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 216#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)])
[2023-10-27 12:21:03,636 INFO  L383   tUnfolder$Statistics]: this new event has 73 ancestors and is cut-off event
[2023-10-27 12:21:03,636 INFO  L386   tUnfolder$Statistics]:   existing Event has 73 ancestors and is cut-off event
[2023-10-27 12:21:03,636 INFO  L386   tUnfolder$Statistics]:   existing Event has 73 ancestors and is cut-off event
[2023-10-27 12:21:03,636 INFO  L386   tUnfolder$Statistics]:   existing Event has 73 ancestors and is cut-off event
[2023-10-27 12:21:03,918 INFO  L130       PetriNetUnfolder]: 9537/23729 cut-off events.
[2023-10-27 12:21:03,918 INFO  L131       PetriNetUnfolder]: For 10739/11822 co-relation queries the response was YES.
[2023-10-27 12:21:03,964 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 56851 conditions, 23729 events. 9537/23729 cut-off events. For 10739/11822 co-relation queries the response was YES. Maximal size of possible extension queue 837. Compared 249470 event pairs, 4683 based on Foata normal form. 170/22647 useless extension candidates. Maximal degree in co-relation 56836. Up to 11157 conditions per place. 
[2023-10-27 12:21:04,089 INFO  L137   encePairwiseOnDemand]: 303/311 looper letters, 86 selfloop transitions, 15 changer transitions 0/200 dead transitions.
[2023-10-27 12:21:04,090 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 200 transitions, 1078 flow
[2023-10-27 12:21:04,090 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-27 12:21:04,090 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-27 12:21:04,097 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 591 transitions.
[2023-10-27 12:21:04,107 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6334405144694534
[2023-10-27 12:21:04,107 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 591 transitions.
[2023-10-27 12:21:04,108 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 591 transitions.
[2023-10-27 12:21:04,108 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:21:04,108 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 591 transitions.
[2023-10-27 12:21:04,109 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 197.0) internal successors, (591), 3 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:04,110 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 311.0) internal successors, (1244), 4 states have internal predecessors, (1244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:04,120 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 311.0) internal successors, (1244), 4 states have internal predecessors, (1244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:04,120 INFO  L175             Difference]: Start difference. First operand has 115 places, 162 transitions, 723 flow. Second operand 3 states and 591 transitions.
[2023-10-27 12:21:04,120 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 200 transitions, 1078 flow
[2023-10-27 12:21:04,224 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 200 transitions, 1074 flow, removed 2 selfloop flow, removed 1 redundant places.
[2023-10-27 12:21:04,229 INFO  L231             Difference]: Finished difference. Result has 116 places, 173 transitions, 844 flow
[2023-10-27 12:21:04,229 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=311, PETRI_DIFFERENCE_MINUEND_FLOW=721, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=844, PETRI_PLACES=116, PETRI_TRANSITIONS=173}
[2023-10-27 12:21:04,229 INFO  L288   CegarLoopForPetriNet]: 97 programPoint places, 19 predicate places.
[2023-10-27 12:21:04,230 INFO  L495      AbstractCegarLoop]: Abstraction has has 116 places, 173 transitions, 844 flow
[2023-10-27 12:21:04,230 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 180.33333333333334) internal successors, (541), 3 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:04,230 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:21:04,230 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:21:04,230 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2023-10-27 12:21:04,231 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2023-10-27 12:21:04,231 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:21:04,231 INFO  L85        PathProgramCache]: Analyzing trace with hash 2064351963, now seen corresponding path program 1 times
[2023-10-27 12:21:04,231 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:21:04,231 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982422648]
[2023-10-27 12:21:04,231 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:21:04,232 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:21:04,269 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:21:04,338 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-10-27 12:21:04,338 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:21:04,338 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982422648]
[2023-10-27 12:21:04,338 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982422648] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:21:04,339 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:21:04,339 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-10-27 12:21:04,339 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157229698]
[2023-10-27 12:21:04,339 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:21:04,339 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-27 12:21:04,339 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:21:04,340 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-27 12:21:04,340 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-27 12:21:04,353 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 179 out of 311
[2023-10-27 12:21:04,354 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 173 transitions, 844 flow. Second operand  has 3 states, 3 states have (on average 183.66666666666666) internal successors, (551), 3 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:04,354 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:21:04,354 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 311
[2023-10-27 12:21:04,354 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:21:05,406 INFO  L130       PetriNetUnfolder]: 3872/9936 cut-off events.
[2023-10-27 12:21:05,406 INFO  L131       PetriNetUnfolder]: For 5053/5508 co-relation queries the response was YES.
[2023-10-27 12:21:05,423 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 24072 conditions, 9936 events. 3872/9936 cut-off events. For 5053/5508 co-relation queries the response was YES. Maximal size of possible extension queue 404. Compared 92254 event pairs, 1079 based on Foata normal form. 201/9559 useless extension candidates. Maximal degree in co-relation 24056. Up to 2518 conditions per place. 
[2023-10-27 12:21:05,445 INFO  L137   encePairwiseOnDemand]: 305/311 looper letters, 59 selfloop transitions, 6 changer transitions 0/159 dead transitions.
[2023-10-27 12:21:05,445 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 159 transitions, 825 flow
[2023-10-27 12:21:05,445 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-27 12:21:05,445 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-27 12:21:05,447 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 592 transitions.
[2023-10-27 12:21:05,447 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6345123258306538
[2023-10-27 12:21:05,447 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 592 transitions.
[2023-10-27 12:21:05,447 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 592 transitions.
[2023-10-27 12:21:05,447 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:21:05,447 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 592 transitions.
[2023-10-27 12:21:05,472 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 197.33333333333334) internal successors, (592), 3 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:05,474 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 311.0) internal successors, (1244), 4 states have internal predecessors, (1244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:05,474 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 311.0) internal successors, (1244), 4 states have internal predecessors, (1244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:05,474 INFO  L175             Difference]: Start difference. First operand has 116 places, 173 transitions, 844 flow. Second operand 3 states and 592 transitions.
[2023-10-27 12:21:05,475 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 159 transitions, 825 flow
[2023-10-27 12:21:05,509 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 159 transitions, 775 flow, removed 14 selfloop flow, removed 7 redundant places.
[2023-10-27 12:21:05,522 INFO  L231             Difference]: Finished difference. Result has 105 places, 136 transitions, 571 flow
[2023-10-27 12:21:05,523 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=311, PETRI_DIFFERENCE_MINUEND_FLOW=559, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=571, PETRI_PLACES=105, PETRI_TRANSITIONS=136}
[2023-10-27 12:21:05,523 INFO  L288   CegarLoopForPetriNet]: 97 programPoint places, 8 predicate places.
[2023-10-27 12:21:05,523 INFO  L495      AbstractCegarLoop]: Abstraction has has 105 places, 136 transitions, 571 flow
[2023-10-27 12:21:05,524 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 183.66666666666666) internal successors, (551), 3 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:05,524 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:21:05,524 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:21:05,524 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2023-10-27 12:21:05,524 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting threadErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2023-10-27 12:21:05,524 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:21:05,525 INFO  L85        PathProgramCache]: Analyzing trace with hash 828752554, now seen corresponding path program 1 times
[2023-10-27 12:21:05,525 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:21:05,525 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510726503]
[2023-10-27 12:21:05,525 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:21:05,525 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:21:05,553 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:21:05,934 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:21:05,934 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:21:05,935 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510726503]
[2023-10-27 12:21:05,935 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510726503] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:21:05,935 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:21:05,935 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-27 12:21:05,935 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566539200]
[2023-10-27 12:21:05,935 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:21:05,937 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-27 12:21:05,938 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:21:05,938 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-27 12:21:05,938 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-27 12:21:06,142 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 155 out of 311
[2023-10-27 12:21:06,143 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 136 transitions, 571 flow. Second operand  has 6 states, 6 states have (on average 158.83333333333334) internal successors, (953), 6 states have internal predecessors, (953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:06,143 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:21:06,143 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 311
[2023-10-27 12:21:06,143 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:21:09,639 INFO  L130       PetriNetUnfolder]: 16288/31389 cut-off events.
[2023-10-27 12:21:09,644 INFO  L131       PetriNetUnfolder]: For 13922/14195 co-relation queries the response was YES.
[2023-10-27 12:21:09,693 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 80939 conditions, 31389 events. 16288/31389 cut-off events. For 13922/14195 co-relation queries the response was YES. Maximal size of possible extension queue 897. Compared 276128 event pairs, 7338 based on Foata normal form. 2/29594 useless extension candidates. Maximal degree in co-relation 80926. Up to 20334 conditions per place. 
[2023-10-27 12:21:09,773 INFO  L137   encePairwiseOnDemand]: 285/311 looper letters, 216 selfloop transitions, 111 changer transitions 0/359 dead transitions.
[2023-10-27 12:21:09,774 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 359 transitions, 2075 flow
[2023-10-27 12:21:09,774 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-27 12:21:09,774 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-27 12:21:09,776 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1168 transitions.
[2023-10-27 12:21:09,777 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6259378349410504
[2023-10-27 12:21:09,777 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 1168 transitions.
[2023-10-27 12:21:09,777 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 1168 transitions.
[2023-10-27 12:21:09,778 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:21:09,778 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1168 transitions.
[2023-10-27 12:21:09,791 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 194.66666666666666) internal successors, (1168), 6 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:09,801 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 311.0) internal successors, (2177), 7 states have internal predecessors, (2177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:09,801 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 311.0) internal successors, (2177), 7 states have internal predecessors, (2177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:09,801 INFO  L175             Difference]: Start difference. First operand has 105 places, 136 transitions, 571 flow. Second operand 6 states and 1168 transitions.
[2023-10-27 12:21:09,802 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 359 transitions, 2075 flow
[2023-10-27 12:21:09,863 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 359 transitions, 2057 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-10-27 12:21:09,867 INFO  L231             Difference]: Finished difference. Result has 113 places, 244 transitions, 1438 flow
[2023-10-27 12:21:09,867 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=311, PETRI_DIFFERENCE_MINUEND_FLOW=565, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1438, PETRI_PLACES=113, PETRI_TRANSITIONS=244}
[2023-10-27 12:21:09,868 INFO  L288   CegarLoopForPetriNet]: 97 programPoint places, 16 predicate places.
[2023-10-27 12:21:09,868 INFO  L495      AbstractCegarLoop]: Abstraction has has 113 places, 244 transitions, 1438 flow
[2023-10-27 12:21:09,869 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 158.83333333333334) internal successors, (953), 6 states have internal predecessors, (953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:09,869 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:21:09,878 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:21:09,878 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2023-10-27 12:21:09,878 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2023-10-27 12:21:09,879 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:21:09,879 INFO  L85        PathProgramCache]: Analyzing trace with hash -1963439994, now seen corresponding path program 1 times
[2023-10-27 12:21:09,879 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:21:09,883 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025879582]
[2023-10-27 12:21:09,884 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:21:09,884 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:21:09,912 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:21:10,264 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-10-27 12:21:10,265 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:21:10,265 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025879582]
[2023-10-27 12:21:10,265 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025879582] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:21:10,265 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:21:10,265 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-27 12:21:10,265 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219805196]
[2023-10-27 12:21:10,265 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:21:10,266 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-27 12:21:10,266 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:21:10,266 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-27 12:21:10,267 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-27 12:21:10,564 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 167 out of 311
[2023-10-27 12:21:10,565 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 244 transitions, 1438 flow. Second operand  has 6 states, 6 states have (on average 169.83333333333334) internal successors, (1019), 6 states have internal predecessors, (1019), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:10,565 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:21:10,565 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 311
[2023-10-27 12:21:10,565 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:21:12,289 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([745] L1064-4-->L1064-6: Formula: (let ((.cse0 (select |v_#race_65| |v_ULTIMATE.start_main_~#tids~0#1.base_99|))) (and (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_91|) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_91| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_91| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_91| 1)) 0) (= |v_#valid_113| (store |v_#valid_114| |v_ULTIMATE.start_main_#t~mem21#1.base_33| 0))))  InVars {#race=|v_#race_65|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_91|, ULTIMATE.start_main_#t~mem21#1.base=|v_ULTIMATE.start_main_#t~mem21#1.base_33|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_99|, #valid=|v_#valid_114|}  OutVars{#race=|v_#race_65|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_91|, ULTIMATE.start_main_#t~mem21#1.base=|v_ULTIMATE.start_main_#t~mem21#1.base_33|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_99|, #valid=|v_#valid_113|}  AuxVars[]  AssignedVars[#valid][39], [threadThread1of2ForFork0InUse, Black: 217#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread2of2ForFork0InUse, 172#L1064-6true, 233#(= |#race~datas~0| 0), Black: 231#true, 219#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 74#threadEXITtrue, Black: 207#(= |ULTIMATE.start_main_~i~0#1| 0), 245#true, Black: 248#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), 196#true, Black: 214#true, Black: 247#(= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))), Black: 218#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 250#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), 121#L1044true, Black: 216#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 249#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), 256#true])
[2023-10-27 12:21:12,289 INFO  L383   tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event
[2023-10-27 12:21:12,289 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2023-10-27 12:21:12,289 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2023-10-27 12:21:12,289 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2023-10-27 12:21:12,880 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([745] L1064-4-->L1064-6: Formula: (let ((.cse0 (select |v_#race_65| |v_ULTIMATE.start_main_~#tids~0#1.base_99|))) (and (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_91|) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_91| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_91| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_91| 1)) 0) (= |v_#valid_113| (store |v_#valid_114| |v_ULTIMATE.start_main_#t~mem21#1.base_33| 0))))  InVars {#race=|v_#race_65|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_91|, ULTIMATE.start_main_#t~mem21#1.base=|v_ULTIMATE.start_main_#t~mem21#1.base_33|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_99|, #valid=|v_#valid_114|}  OutVars{#race=|v_#race_65|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_91|, ULTIMATE.start_main_#t~mem21#1.base=|v_ULTIMATE.start_main_#t~mem21#1.base_33|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_99|, #valid=|v_#valid_113|}  AuxVars[]  AssignedVars[#valid][39], [threadThread1of2ForFork0InUse, Black: 217#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread2of2ForFork0InUse, 172#L1064-6true, 233#(= |#race~datas~0| 0), 79#L1045-4true, Black: 231#true, 219#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 74#threadEXITtrue, Black: 207#(= |ULTIMATE.start_main_~i~0#1| 0), 241#true, 245#true, Black: 248#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), 196#true, Black: 214#true, Black: 247#(= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))), Black: 218#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 250#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 216#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 249#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), 256#true])
[2023-10-27 12:21:12,880 INFO  L383   tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event
[2023-10-27 12:21:12,881 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-27 12:21:12,881 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-27 12:21:12,881 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-27 12:21:12,881 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([754] L1045-4-->L1045-6: Formula: (= (store |v_#race_68| v_~datas~0.base_63 (store (select |v_#race_68| v_~datas~0.base_63) (+ (* v_threadThread2of2ForFork0_~j~0_21 4) v_~datas~0.offset_55) |v_threadThread2of2ForFork0_#t~nondet6_21|)) |v_#race_67|)  InVars {#race=|v_#race_68|, ~datas~0.base=v_~datas~0.base_63, threadThread2of2ForFork0_~j~0=v_threadThread2of2ForFork0_~j~0_21, ~datas~0.offset=v_~datas~0.offset_55}  OutVars{#race=|v_#race_67|, ~datas~0.base=v_~datas~0.base_63, threadThread2of2ForFork0_#t~nondet6=|v_threadThread2of2ForFork0_#t~nondet6_21|, threadThread2of2ForFork0_~j~0=v_threadThread2of2ForFork0_~j~0_21, ~datas~0.offset=v_~datas~0.offset_55}  AuxVars[]  AssignedVars[#race, threadThread2of2ForFork0_#t~nondet6][234], [Black: 219#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread1of2ForFork0InUse, Black: 217#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread2of2ForFork0InUse, 233#(= |#race~datas~0| 0), Black: 231#true, 52#L1064-4true, 214#true, 146#L1045-6true, 74#threadEXITtrue, Black: 207#(= |ULTIMATE.start_main_~i~0#1| 0), 241#true, 245#true, Black: 248#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), 196#true, Black: 247#(= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))), Black: 218#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 250#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 216#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 249#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), 256#true])
[2023-10-27 12:21:12,881 INFO  L383   tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event
[2023-10-27 12:21:12,881 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-27 12:21:12,881 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-27 12:21:12,881 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-27 12:21:12,897 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([754] L1045-4-->L1045-6: Formula: (= (store |v_#race_68| v_~datas~0.base_63 (store (select |v_#race_68| v_~datas~0.base_63) (+ (* v_threadThread2of2ForFork0_~j~0_21 4) v_~datas~0.offset_55) |v_threadThread2of2ForFork0_#t~nondet6_21|)) |v_#race_67|)  InVars {#race=|v_#race_68|, ~datas~0.base=v_~datas~0.base_63, threadThread2of2ForFork0_~j~0=v_threadThread2of2ForFork0_~j~0_21, ~datas~0.offset=v_~datas~0.offset_55}  OutVars{#race=|v_#race_67|, ~datas~0.base=v_~datas~0.base_63, threadThread2of2ForFork0_#t~nondet6=|v_threadThread2of2ForFork0_#t~nondet6_21|, threadThread2of2ForFork0_~j~0=v_threadThread2of2ForFork0_~j~0_21, ~datas~0.offset=v_~datas~0.offset_55}  AuxVars[]  AssignedVars[#race, threadThread2of2ForFork0_#t~nondet6][234], [Black: 219#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread1of2ForFork0InUse, Black: 217#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread2of2ForFork0InUse, 233#(= |#race~datas~0| 0), Black: 231#true, 214#true, 146#L1045-6true, 74#threadEXITtrue, Black: 207#(= |ULTIMATE.start_main_~i~0#1| 0), 241#true, 169#L1062-5true, 245#true, Black: 248#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), 196#true, Black: 247#(= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))), Black: 250#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 218#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 249#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), 256#true, Black: 216#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)])
[2023-10-27 12:21:12,898 INFO  L383   tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event
[2023-10-27 12:21:12,898 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-27 12:21:12,898 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-27 12:21:12,899 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-27 12:21:13,817 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([754] L1045-4-->L1045-6: Formula: (= (store |v_#race_68| v_~datas~0.base_63 (store (select |v_#race_68| v_~datas~0.base_63) (+ (* v_threadThread2of2ForFork0_~j~0_21 4) v_~datas~0.offset_55) |v_threadThread2of2ForFork0_#t~nondet6_21|)) |v_#race_67|)  InVars {#race=|v_#race_68|, ~datas~0.base=v_~datas~0.base_63, threadThread2of2ForFork0_~j~0=v_threadThread2of2ForFork0_~j~0_21, ~datas~0.offset=v_~datas~0.offset_55}  OutVars{#race=|v_#race_67|, ~datas~0.base=v_~datas~0.base_63, threadThread2of2ForFork0_#t~nondet6=|v_threadThread2of2ForFork0_#t~nondet6_21|, threadThread2of2ForFork0_~j~0=v_threadThread2of2ForFork0_~j~0_21, ~datas~0.offset=v_~datas~0.offset_55}  AuxVars[]  AssignedVars[#race, threadThread2of2ForFork0_#t~nondet6][234], [Black: 219#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread1of2ForFork0InUse, Black: 217#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 9#L1059-7true, threadThread2of2ForFork0InUse, 233#(= |#race~datas~0| 0), Black: 231#true, 214#true, 146#L1045-6true, 74#threadEXITtrue, Black: 207#(= |ULTIMATE.start_main_~i~0#1| 0), 241#true, 245#true, Black: 248#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), 196#true, Black: 247#(= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))), Black: 250#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 218#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 256#true, Black: 216#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 249#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))))])
[2023-10-27 12:21:13,817 INFO  L383   tUnfolder$Statistics]: this new event has 79 ancestors and is not cut-off event
[2023-10-27 12:21:13,818 INFO  L386   tUnfolder$Statistics]:   existing Event has 79 ancestors and is not cut-off event
[2023-10-27 12:21:13,818 INFO  L386   tUnfolder$Statistics]:   existing Event has 79 ancestors and is not cut-off event
[2023-10-27 12:21:13,818 INFO  L386   tUnfolder$Statistics]:   existing Event has 79 ancestors and is not cut-off event
[2023-10-27 12:21:13,859 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([754] L1045-4-->L1045-6: Formula: (= (store |v_#race_68| v_~datas~0.base_63 (store (select |v_#race_68| v_~datas~0.base_63) (+ (* v_threadThread2of2ForFork0_~j~0_21 4) v_~datas~0.offset_55) |v_threadThread2of2ForFork0_#t~nondet6_21|)) |v_#race_67|)  InVars {#race=|v_#race_68|, ~datas~0.base=v_~datas~0.base_63, threadThread2of2ForFork0_~j~0=v_threadThread2of2ForFork0_~j~0_21, ~datas~0.offset=v_~datas~0.offset_55}  OutVars{#race=|v_#race_67|, ~datas~0.base=v_~datas~0.base_63, threadThread2of2ForFork0_#t~nondet6=|v_threadThread2of2ForFork0_#t~nondet6_21|, threadThread2of2ForFork0_~j~0=v_threadThread2of2ForFork0_~j~0_21, ~datas~0.offset=v_~datas~0.offset_55}  AuxVars[]  AssignedVars[#race, threadThread2of2ForFork0_#t~nondet6][234], [Black: 219#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread1of2ForFork0InUse, Black: 217#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread2of2ForFork0InUse, 233#(= |#race~datas~0| 0), Black: 231#true, 214#true, 146#L1045-6true, 74#threadEXITtrue, Black: 207#(= |ULTIMATE.start_main_~i~0#1| 0), 241#true, 245#true, Black: 248#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), 196#true, Black: 247#(= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))), 188#L1059-8true, Black: 250#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 218#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 256#true, Black: 216#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 249#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))))])
[2023-10-27 12:21:13,859 INFO  L383   tUnfolder$Statistics]: this new event has 80 ancestors and is not cut-off event
[2023-10-27 12:21:13,860 INFO  L386   tUnfolder$Statistics]:   existing Event has 80 ancestors and is not cut-off event
[2023-10-27 12:21:13,860 INFO  L386   tUnfolder$Statistics]:   existing Event has 80 ancestors and is not cut-off event
[2023-10-27 12:21:13,860 INFO  L386   tUnfolder$Statistics]:   existing Event has 80 ancestors and is not cut-off event
[2023-10-27 12:21:14,048 INFO  L130       PetriNetUnfolder]: 13929/27965 cut-off events.
[2023-10-27 12:21:14,048 INFO  L131       PetriNetUnfolder]: For 33017/33969 co-relation queries the response was YES.
[2023-10-27 12:21:14,101 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 86636 conditions, 27965 events. 13929/27965 cut-off events. For 33017/33969 co-relation queries the response was YES. Maximal size of possible extension queue 900. Compared 253765 event pairs, 5272 based on Foata normal form. 44/26631 useless extension candidates. Maximal degree in co-relation 86618. Up to 18513 conditions per place. 
[2023-10-27 12:21:14,180 INFO  L137   encePairwiseOnDemand]: 296/311 looper letters, 175 selfloop transitions, 88 changer transitions 0/377 dead transitions.
[2023-10-27 12:21:14,180 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 377 transitions, 2692 flow
[2023-10-27 12:21:14,181 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-27 12:21:14,181 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-27 12:21:14,183 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1132 transitions.
[2023-10-27 12:21:14,202 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6066452304394426
[2023-10-27 12:21:14,202 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 1132 transitions.
[2023-10-27 12:21:14,202 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 1132 transitions.
[2023-10-27 12:21:14,202 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:21:14,202 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1132 transitions.
[2023-10-27 12:21:14,204 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 188.66666666666666) internal successors, (1132), 6 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:14,206 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 311.0) internal successors, (2177), 7 states have internal predecessors, (2177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:14,206 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 311.0) internal successors, (2177), 7 states have internal predecessors, (2177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:14,206 INFO  L175             Difference]: Start difference. First operand has 113 places, 244 transitions, 1438 flow. Second operand 6 states and 1132 transitions.
[2023-10-27 12:21:14,206 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 377 transitions, 2692 flow
[2023-10-27 12:21:14,413 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 377 transitions, 2620 flow, removed 36 selfloop flow, removed 0 redundant places.
[2023-10-27 12:21:14,418 INFO  L231             Difference]: Finished difference. Result has 123 places, 327 transitions, 2384 flow
[2023-10-27 12:21:14,418 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=311, PETRI_DIFFERENCE_MINUEND_FLOW=1366, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2384, PETRI_PLACES=123, PETRI_TRANSITIONS=327}
[2023-10-27 12:21:14,420 INFO  L288   CegarLoopForPetriNet]: 97 programPoint places, 26 predicate places.
[2023-10-27 12:21:14,420 INFO  L495      AbstractCegarLoop]: Abstraction has has 123 places, 327 transitions, 2384 flow
[2023-10-27 12:21:14,433 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 169.83333333333334) internal successors, (1019), 6 states have internal predecessors, (1019), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:14,433 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:21:14,434 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:21:14,434 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2023-10-27 12:21:14,434 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2023-10-27 12:21:14,434 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:21:14,435 INFO  L85        PathProgramCache]: Analyzing trace with hash -1798417467, now seen corresponding path program 1 times
[2023-10-27 12:21:14,435 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:21:14,435 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656326325]
[2023-10-27 12:21:14,443 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:21:14,444 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:21:14,475 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:21:14,598 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:21:14,598 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:21:14,599 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656326325]
[2023-10-27 12:21:14,599 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656326325] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-27 12:21:14,599 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487072717]
[2023-10-27 12:21:14,599 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:21:14,599 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-27 12:21:14,599 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-27 12:21:14,621 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-27 12:21:14,664 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2023-10-27 12:21:14,809 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:21:14,811 INFO  L263         TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 4 conjunts are in the unsatisfiable core
[2023-10-27 12:21:14,814 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-27 12:21:14,990 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:21:14,991 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-27 12:21:15,081 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:21:15,081 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1487072717] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-27 12:21:15,081 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-27 12:21:15,081 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8
[2023-10-27 12:21:15,082 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235330084]
[2023-10-27 12:21:15,082 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-27 12:21:15,082 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2023-10-27 12:21:15,082 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:21:15,082 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2023-10-27 12:21:15,083 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2023-10-27 12:21:15,223 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 176 out of 311
[2023-10-27 12:21:15,224 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 327 transitions, 2384 flow. Second operand  has 9 states, 9 states have (on average 179.44444444444446) internal successors, (1615), 9 states have internal predecessors, (1615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:15,224 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:21:15,224 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 311
[2023-10-27 12:21:15,225 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:21:18,062 INFO  L130       PetriNetUnfolder]: 6717/16450 cut-off events.
[2023-10-27 12:21:18,063 INFO  L131       PetriNetUnfolder]: For 23499/27285 co-relation queries the response was YES.
[2023-10-27 12:21:18,096 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 55181 conditions, 16450 events. 6717/16450 cut-off events. For 23499/27285 co-relation queries the response was YES. Maximal size of possible extension queue 506. Compared 155839 event pairs, 1159 based on Foata normal form. 308/16278 useless extension candidates. Maximal degree in co-relation 55158. Up to 5619 conditions per place. 
[2023-10-27 12:21:18,140 INFO  L137   encePairwiseOnDemand]: 304/311 looper letters, 120 selfloop transitions, 6 changer transitions 6/391 dead transitions.
[2023-10-27 12:21:18,141 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 391 transitions, 2945 flow
[2023-10-27 12:21:18,141 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2023-10-27 12:21:18,141 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-10-27 12:21:18,148 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1307 transitions.
[2023-10-27 12:21:18,148 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.600367478180983
[2023-10-27 12:21:18,148 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 1307 transitions.
[2023-10-27 12:21:18,148 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 1307 transitions.
[2023-10-27 12:21:18,149 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:21:18,149 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1307 transitions.
[2023-10-27 12:21:18,151 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 186.71428571428572) internal successors, (1307), 7 states have internal predecessors, (1307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:18,153 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 311.0) internal successors, (2488), 8 states have internal predecessors, (2488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:18,153 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 311.0) internal successors, (2488), 8 states have internal predecessors, (2488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:18,153 INFO  L175             Difference]: Start difference. First operand has 123 places, 327 transitions, 2384 flow. Second operand 7 states and 1307 transitions.
[2023-10-27 12:21:18,154 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 391 transitions, 2945 flow
[2023-10-27 12:21:18,428 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 391 transitions, 2897 flow, removed 24 selfloop flow, removed 0 redundant places.
[2023-10-27 12:21:18,431 INFO  L231             Difference]: Finished difference. Result has 132 places, 324 transitions, 2334 flow
[2023-10-27 12:21:18,431 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=311, PETRI_DIFFERENCE_MINUEND_FLOW=2303, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=322, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=316, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2334, PETRI_PLACES=132, PETRI_TRANSITIONS=324}
[2023-10-27 12:21:18,432 INFO  L288   CegarLoopForPetriNet]: 97 programPoint places, 35 predicate places.
[2023-10-27 12:21:18,432 INFO  L495      AbstractCegarLoop]: Abstraction has has 132 places, 324 transitions, 2334 flow
[2023-10-27 12:21:18,432 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 179.44444444444446) internal successors, (1615), 9 states have internal predecessors, (1615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:18,432 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:21:18,433 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:21:18,440 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2023-10-27 12:21:18,638 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21
[2023-10-27 12:21:18,638 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2023-10-27 12:21:18,639 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:21:18,639 INFO  L85        PathProgramCache]: Analyzing trace with hash 1631727534, now seen corresponding path program 1 times
[2023-10-27 12:21:18,640 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:21:18,640 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623243848]
[2023-10-27 12:21:18,640 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:21:18,641 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:21:18,710 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:21:19,236 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-10-27 12:21:19,236 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:21:19,236 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623243848]
[2023-10-27 12:21:19,236 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623243848] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:21:19,237 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:21:19,237 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2023-10-27 12:21:19,237 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730483490]
[2023-10-27 12:21:19,237 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:21:19,237 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2023-10-27 12:21:19,237 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:21:19,238 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2023-10-27 12:21:19,238 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2023-10-27 12:21:19,597 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 155 out of 311
[2023-10-27 12:21:19,598 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 324 transitions, 2334 flow. Second operand  has 8 states, 8 states have (on average 158.5) internal successors, (1268), 8 states have internal predecessors, (1268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:19,598 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:21:19,598 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 311
[2023-10-27 12:21:19,598 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:21:23,516 INFO  L130       PetriNetUnfolder]: 11835/24320 cut-off events.
[2023-10-27 12:21:23,516 INFO  L131       PetriNetUnfolder]: For 47349/48127 co-relation queries the response was YES.
[2023-10-27 12:21:23,570 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 86027 conditions, 24320 events. 11835/24320 cut-off events. For 47349/48127 co-relation queries the response was YES. Maximal size of possible extension queue 713. Compared 215054 event pairs, 5742 based on Foata normal form. 379/24203 useless extension candidates. Maximal degree in co-relation 86000. Up to 18518 conditions per place. 
[2023-10-27 12:21:23,644 INFO  L137   encePairwiseOnDemand]: 302/311 looper letters, 287 selfloop transitions, 7 changer transitions 9/354 dead transitions.
[2023-10-27 12:21:23,645 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 354 transitions, 3095 flow
[2023-10-27 12:21:23,645 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2023-10-27 12:21:23,645 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-10-27 12:21:23,666 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1171 transitions.
[2023-10-27 12:21:23,666 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5378961874138724
[2023-10-27 12:21:23,666 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 1171 transitions.
[2023-10-27 12:21:23,666 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 1171 transitions.
[2023-10-27 12:21:23,667 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:21:23,667 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1171 transitions.
[2023-10-27 12:21:23,669 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 167.28571428571428) internal successors, (1171), 7 states have internal predecessors, (1171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:23,670 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 311.0) internal successors, (2488), 8 states have internal predecessors, (2488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:23,670 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 311.0) internal successors, (2488), 8 states have internal predecessors, (2488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:23,671 INFO  L175             Difference]: Start difference. First operand has 132 places, 324 transitions, 2334 flow. Second operand 7 states and 1171 transitions.
[2023-10-27 12:21:23,671 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 354 transitions, 3095 flow
[2023-10-27 12:21:23,921 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 354 transitions, 3092 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-27 12:21:23,924 INFO  L231             Difference]: Finished difference. Result has 137 places, 325 transitions, 2375 flow
[2023-10-27 12:21:23,924 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=311, PETRI_DIFFERENCE_MINUEND_FLOW=2319, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=314, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2375, PETRI_PLACES=137, PETRI_TRANSITIONS=325}
[2023-10-27 12:21:23,925 INFO  L288   CegarLoopForPetriNet]: 97 programPoint places, 40 predicate places.
[2023-10-27 12:21:23,925 INFO  L495      AbstractCegarLoop]: Abstraction has has 137 places, 325 transitions, 2375 flow
[2023-10-27 12:21:23,925 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 158.5) internal successors, (1268), 8 states have internal predecessors, (1268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:23,925 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:21:23,925 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:21:23,926 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2023-10-27 12:21:23,926 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting threadErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2023-10-27 12:21:23,926 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:21:23,926 INFO  L85        PathProgramCache]: Analyzing trace with hash 1196596694, now seen corresponding path program 1 times
[2023-10-27 12:21:23,926 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:21:23,926 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387576757]
[2023-10-27 12:21:23,926 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:21:23,927 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:21:23,982 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:21:24,448 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-10-27 12:21:24,449 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:21:24,449 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387576757]
[2023-10-27 12:21:24,449 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387576757] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:21:24,449 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:21:24,449 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2023-10-27 12:21:24,449 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823147416]
[2023-10-27 12:21:24,450 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:21:24,450 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2023-10-27 12:21:24,450 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:21:24,450 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2023-10-27 12:21:24,450 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2023-10-27 12:21:24,788 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 152 out of 311
[2023-10-27 12:21:24,789 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 325 transitions, 2375 flow. Second operand  has 8 states, 8 states have (on average 155.375) internal successors, (1243), 8 states have internal predecessors, (1243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:24,789 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:21:24,789 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 311
[2023-10-27 12:21:24,789 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:21:29,720 INFO  L130       PetriNetUnfolder]: 14647/27988 cut-off events.
[2023-10-27 12:21:29,720 INFO  L131       PetriNetUnfolder]: For 47664/47683 co-relation queries the response was YES.
[2023-10-27 12:21:29,840 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 102908 conditions, 27988 events. 14647/27988 cut-off events. For 47664/47683 co-relation queries the response was YES. Maximal size of possible extension queue 761. Compared 236598 event pairs, 5116 based on Foata normal form. 366/27997 useless extension candidates. Maximal degree in co-relation 102877. Up to 13983 conditions per place. 
[2023-10-27 12:21:29,921 INFO  L137   encePairwiseOnDemand]: 295/311 looper letters, 458 selfloop transitions, 154 changer transitions 27/670 dead transitions.
[2023-10-27 12:21:29,921 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 670 transitions, 5728 flow
[2023-10-27 12:21:29,922 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2023-10-27 12:21:29,922 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2023-10-27 12:21:29,924 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1476 transitions.
[2023-10-27 12:21:29,924 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5932475884244373
[2023-10-27 12:21:29,924 INFO  L72            ComplementDD]: Start complementDD. Operand 8 states and 1476 transitions.
[2023-10-27 12:21:29,924 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 8 states and 1476 transitions.
[2023-10-27 12:21:29,925 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:21:29,925 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1476 transitions.
[2023-10-27 12:21:29,940 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 9 states, 8 states have (on average 184.5) internal successors, (1476), 8 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:29,948 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 9 states, 9 states have (on average 311.0) internal successors, (2799), 9 states have internal predecessors, (2799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:29,948 INFO  L81            ComplementDD]: Finished complementDD. Result  has 9 states, 9 states have (on average 311.0) internal successors, (2799), 9 states have internal predecessors, (2799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:29,948 INFO  L175             Difference]: Start difference. First operand has 137 places, 325 transitions, 2375 flow. Second operand 8 states and 1476 transitions.
[2023-10-27 12:21:29,948 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 670 transitions, 5728 flow
[2023-10-27 12:21:30,326 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 670 transitions, 5704 flow, removed 1 selfloop flow, removed 2 redundant places.
[2023-10-27 12:21:30,336 INFO  L231             Difference]: Finished difference. Result has 147 places, 405 transitions, 3566 flow
[2023-10-27 12:21:30,336 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=311, PETRI_DIFFERENCE_MINUEND_FLOW=2367, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3566, PETRI_PLACES=147, PETRI_TRANSITIONS=405}
[2023-10-27 12:21:30,337 INFO  L288   CegarLoopForPetriNet]: 97 programPoint places, 50 predicate places.
[2023-10-27 12:21:30,337 INFO  L495      AbstractCegarLoop]: Abstraction has has 147 places, 405 transitions, 3566 flow
[2023-10-27 12:21:30,338 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 155.375) internal successors, (1243), 8 states have internal predecessors, (1243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:30,338 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:21:30,338 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:21:30,338 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2023-10-27 12:21:30,338 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2023-10-27 12:21:30,339 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:21:30,339 INFO  L85        PathProgramCache]: Analyzing trace with hash 2087794908, now seen corresponding path program 1 times
[2023-10-27 12:21:30,339 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:21:30,339 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856125616]
[2023-10-27 12:21:30,339 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:21:30,339 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:21:30,375 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:21:30,403 INFO  L134       CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked.
[2023-10-27 12:21:30,404 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:21:30,416 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856125616]
[2023-10-27 12:21:30,416 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856125616] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:21:30,416 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:21:30,416 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-27 12:21:30,417 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35433415]
[2023-10-27 12:21:30,417 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:21:30,417 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-27 12:21:30,418 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:21:30,418 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-27 12:21:30,418 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-27 12:21:30,444 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 175 out of 311
[2023-10-27 12:21:30,445 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 405 transitions, 3566 flow. Second operand  has 3 states, 3 states have (on average 180.66666666666666) internal successors, (542), 3 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:30,445 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:21:30,445 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 311
[2023-10-27 12:21:30,445 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:21:32,828 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([754] L1045-4-->L1045-6: Formula: (= (store |v_#race_68| v_~datas~0.base_63 (store (select |v_#race_68| v_~datas~0.base_63) (+ (* v_threadThread2of2ForFork0_~j~0_21 4) v_~datas~0.offset_55) |v_threadThread2of2ForFork0_#t~nondet6_21|)) |v_#race_67|)  InVars {#race=|v_#race_68|, ~datas~0.base=v_~datas~0.base_63, threadThread2of2ForFork0_~j~0=v_threadThread2of2ForFork0_~j~0_21, ~datas~0.offset=v_~datas~0.offset_55}  OutVars{#race=|v_#race_67|, ~datas~0.base=v_~datas~0.base_63, threadThread2of2ForFork0_#t~nondet6=|v_threadThread2of2ForFork0_#t~nondet6_21|, threadThread2of2ForFork0_~j~0=v_threadThread2of2ForFork0_~j~0_21, ~datas~0.offset=v_~datas~0.offset_55}  AuxVars[]  AssignedVars[#race, threadThread2of2ForFork0_#t~nondet6][265], [threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, Black: 511#(not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 260#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem19#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem19#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem19#1.offset|)) 0)), 233#(= |#race~datas~0| 0), Black: 513#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 259#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem19#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem19#1.offset|)) 0)), Black: 512#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 258#(= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem19#1.offset|)) 0), Black: 514#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 261#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem19#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem19#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem19#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem19#1.offset|)) 0)), 214#true, Black: 526#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 529#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 207#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 525#(and (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 528#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 527#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), 245#true, 196#true, 524#(not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 218#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 256#true, Black: 216#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 219#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 217#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 9#L1059-7true, Black: 231#true, 146#L1045-6true, 536#true, 74#threadEXITtrue, 500#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), 241#true, Black: 502#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 248#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 270#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 247#(= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))), Black: 250#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 249#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))))])
[2023-10-27 12:21:32,828 INFO  L383   tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event
[2023-10-27 12:21:32,849 INFO  L386   tUnfolder$Statistics]:   existing Event has 79 ancestors and is cut-off event
[2023-10-27 12:21:32,851 INFO  L386   tUnfolder$Statistics]:   existing Event has 79 ancestors and is cut-off event
[2023-10-27 12:21:32,851 INFO  L386   tUnfolder$Statistics]:   existing Event has 79 ancestors and is cut-off event
[2023-10-27 12:21:32,857 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([754] L1045-4-->L1045-6: Formula: (= (store |v_#race_68| v_~datas~0.base_63 (store (select |v_#race_68| v_~datas~0.base_63) (+ (* v_threadThread2of2ForFork0_~j~0_21 4) v_~datas~0.offset_55) |v_threadThread2of2ForFork0_#t~nondet6_21|)) |v_#race_67|)  InVars {#race=|v_#race_68|, ~datas~0.base=v_~datas~0.base_63, threadThread2of2ForFork0_~j~0=v_threadThread2of2ForFork0_~j~0_21, ~datas~0.offset=v_~datas~0.offset_55}  OutVars{#race=|v_#race_67|, ~datas~0.base=v_~datas~0.base_63, threadThread2of2ForFork0_#t~nondet6=|v_threadThread2of2ForFork0_#t~nondet6_21|, threadThread2of2ForFork0_~j~0=v_threadThread2of2ForFork0_~j~0_21, ~datas~0.offset=v_~datas~0.offset_55}  AuxVars[]  AssignedVars[#race, threadThread2of2ForFork0_#t~nondet6][189], [threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, Black: 511#(not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 260#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem19#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem19#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem19#1.offset|)) 0)), Black: 513#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), 233#(= |#race~datas~0| 0), Black: 259#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem19#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem19#1.offset|)) 0)), Black: 512#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 258#(= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem19#1.offset|)) 0), Black: 514#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 261#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem19#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem19#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem19#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem19#1.offset|)) 0)), 214#true, Black: 526#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 529#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 525#(and (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 207#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 528#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 527#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), 245#true, 196#true, 524#(not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)), 188#L1059-8true, Black: 218#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 216#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 256#true, Black: 219#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 217#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 231#true, 146#L1045-6true, 536#true, 74#threadEXITtrue, 500#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), 241#true, Black: 502#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 248#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 270#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 247#(= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))), Black: 250#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 249#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))))])
[2023-10-27 12:21:32,857 INFO  L383   tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event
[2023-10-27 12:21:32,857 INFO  L386   tUnfolder$Statistics]:   existing Event has 80 ancestors and is cut-off event
[2023-10-27 12:21:32,857 INFO  L386   tUnfolder$Statistics]:   existing Event has 80 ancestors and is cut-off event
[2023-10-27 12:21:32,858 INFO  L386   tUnfolder$Statistics]:   existing Event has 80 ancestors and is cut-off event
[2023-10-27 12:21:32,994 INFO  L381   tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([754] L1045-4-->L1045-6: Formula: (= (store |v_#race_68| v_~datas~0.base_63 (store (select |v_#race_68| v_~datas~0.base_63) (+ (* v_threadThread2of2ForFork0_~j~0_21 4) v_~datas~0.offset_55) |v_threadThread2of2ForFork0_#t~nondet6_21|)) |v_#race_67|)  InVars {#race=|v_#race_68|, ~datas~0.base=v_~datas~0.base_63, threadThread2of2ForFork0_~j~0=v_threadThread2of2ForFork0_~j~0_21, ~datas~0.offset=v_~datas~0.offset_55}  OutVars{#race=|v_#race_67|, ~datas~0.base=v_~datas~0.base_63, threadThread2of2ForFork0_#t~nondet6=|v_threadThread2of2ForFork0_#t~nondet6_21|, threadThread2of2ForFork0_~j~0=v_threadThread2of2ForFork0_~j~0_21, ~datas~0.offset=v_~datas~0.offset_55}  AuxVars[]  AssignedVars[#race, threadThread2of2ForFork0_#t~nondet6][189], [threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, Black: 511#(not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 260#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem19#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem19#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem19#1.offset|)) 0)), 233#(= |#race~datas~0| 0), Black: 513#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 259#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem19#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem19#1.offset|)) 0)), Black: 512#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 258#(= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem19#1.offset|)) 0), Black: 514#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 261#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem19#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem19#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem19#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem19#1.offset|)) 0)), 214#true, Black: 526#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 529#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 525#(and (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 207#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 528#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 527#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), 245#true, 196#true, 524#(not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 218#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 188#L1059-8true, 256#true, Black: 216#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 219#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 217#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 231#true, 146#L1045-6true, 536#true, 500#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), 74#threadEXITtrue, 241#true, Black: 502#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 248#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 270#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 247#(= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))), Black: 250#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 249#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))))])
[2023-10-27 12:21:32,994 INFO  L383   tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event
[2023-10-27 12:21:32,994 INFO  L386   tUnfolder$Statistics]:   existing Event has 80 ancestors and is cut-off event
[2023-10-27 12:21:32,994 INFO  L386   tUnfolder$Statistics]:   existing Event has 80 ancestors and is cut-off event
[2023-10-27 12:21:32,994 INFO  L386   tUnfolder$Statistics]:   existing Event has 80 ancestors and is cut-off event
[2023-10-27 12:21:32,995 INFO  L386   tUnfolder$Statistics]:   existing Event has 80 ancestors and is cut-off event
[2023-10-27 12:21:33,431 INFO  L130       PetriNetUnfolder]: 7926/18777 cut-off events.
[2023-10-27 12:21:33,431 INFO  L131       PetriNetUnfolder]: For 52565/77473 co-relation queries the response was YES.
[2023-10-27 12:21:33,533 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 76404 conditions, 18777 events. 7926/18777 cut-off events. For 52565/77473 co-relation queries the response was YES. Maximal size of possible extension queue 655. Compared 179557 event pairs, 2211 based on Foata normal form. 661/18771 useless extension candidates. Maximal degree in co-relation 76368. Up to 6749 conditions per place. 
[2023-10-27 12:21:33,586 INFO  L137   encePairwiseOnDemand]: 308/311 looper letters, 115 selfloop transitions, 2 changer transitions 0/420 dead transitions.
[2023-10-27 12:21:33,587 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 420 transitions, 3877 flow
[2023-10-27 12:21:33,587 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-27 12:21:33,587 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-27 12:21:33,589 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 576 transitions.
[2023-10-27 12:21:33,589 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.617363344051447
[2023-10-27 12:21:33,589 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 576 transitions.
[2023-10-27 12:21:33,589 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 576 transitions.
[2023-10-27 12:21:33,590 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:21:33,590 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 576 transitions.
[2023-10-27 12:21:33,591 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 192.0) internal successors, (576), 3 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:33,592 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 311.0) internal successors, (1244), 4 states have internal predecessors, (1244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:33,608 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 311.0) internal successors, (1244), 4 states have internal predecessors, (1244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:33,608 INFO  L175             Difference]: Start difference. First operand has 147 places, 405 transitions, 3566 flow. Second operand 3 states and 576 transitions.
[2023-10-27 12:21:33,608 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 420 transitions, 3877 flow
[2023-10-27 12:21:34,059 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 420 transitions, 3871 flow, removed 3 selfloop flow, removed 1 redundant places.
[2023-10-27 12:21:34,063 INFO  L231             Difference]: Finished difference. Result has 146 places, 404 transitions, 3562 flow
[2023-10-27 12:21:34,064 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=311, PETRI_DIFFERENCE_MINUEND_FLOW=3558, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=404, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=402, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3562, PETRI_PLACES=146, PETRI_TRANSITIONS=404}
[2023-10-27 12:21:34,064 INFO  L288   CegarLoopForPetriNet]: 97 programPoint places, 49 predicate places.
[2023-10-27 12:21:34,064 INFO  L495      AbstractCegarLoop]: Abstraction has has 146 places, 404 transitions, 3562 flow
[2023-10-27 12:21:34,065 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 180.66666666666666) internal successors, (542), 3 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:34,065 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:21:34,065 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:21:34,065 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2023-10-27 12:21:34,065 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2023-10-27 12:21:34,065 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:21:34,066 INFO  L85        PathProgramCache]: Analyzing trace with hash -1622271745, now seen corresponding path program 1 times
[2023-10-27 12:21:34,066 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:21:34,066 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390716667]
[2023-10-27 12:21:34,066 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:21:34,066 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:21:34,105 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:21:34,790 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:21:34,790 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:21:34,791 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390716667]
[2023-10-27 12:21:34,791 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390716667] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-27 12:21:34,791 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1902369290]
[2023-10-27 12:21:34,791 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:21:34,791 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-27 12:21:34,791 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-27 12:21:34,806 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-27 12:21:34,843 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2023-10-27 12:21:35,004 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:21:35,006 INFO  L263         TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 27 conjunts are in the unsatisfiable core
[2023-10-27 12:21:35,012 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-27 12:21:35,067 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 58
[2023-10-27 12:21:35,256 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2023-10-27 12:21:35,257 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29
[2023-10-27 12:21:35,307 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2023-10-27 12:21:35,341 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2023-10-27 12:21:35,362 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2023-10-27 12:21:35,375 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:21:35,375 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2023-10-27 12:21:35,415 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:21:35,416 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2023-10-27 12:21:35,445 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-10-27 12:21:35,454 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-10-27 12:21:35,454 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-10-27 12:21:35,454 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1902369290] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:21:35,454 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2023-10-27 12:21:35,455 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 11
[2023-10-27 12:21:35,455 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443019125]
[2023-10-27 12:21:35,455 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:21:35,455 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2023-10-27 12:21:35,461 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:21:35,462 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2023-10-27 12:21:35,462 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156
[2023-10-27 12:21:36,522 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 158 out of 311
[2023-10-27 12:21:36,523 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 404 transitions, 3562 flow. Second operand  has 10 states, 10 states have (on average 160.4) internal successors, (1604), 10 states have internal predecessors, (1604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:36,523 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:21:36,523 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 311
[2023-10-27 12:21:36,523 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:21:42,984 INFO  L130       PetriNetUnfolder]: 18355/34927 cut-off events.
[2023-10-27 12:21:42,985 INFO  L131       PetriNetUnfolder]: For 118862/119341 co-relation queries the response was YES.
[2023-10-27 12:21:43,110 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 157735 conditions, 34927 events. 18355/34927 cut-off events. For 118862/119341 co-relation queries the response was YES. Maximal size of possible extension queue 1165. Compared 311232 event pairs, 2397 based on Foata normal form. 278/34683 useless extension candidates. Maximal degree in co-relation 157699. Up to 18280 conditions per place. 
[2023-10-27 12:21:43,237 INFO  L137   encePairwiseOnDemand]: 290/311 looper letters, 743 selfloop transitions, 85 changer transitions 0/933 dead transitions.
[2023-10-27 12:21:43,238 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 933 transitions, 9869 flow
[2023-10-27 12:21:43,238 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2023-10-27 12:21:43,238 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 15 states.
[2023-10-27 12:21:43,241 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2623 transitions.
[2023-10-27 12:21:43,241 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.562272240085745
[2023-10-27 12:21:43,241 INFO  L72            ComplementDD]: Start complementDD. Operand 15 states and 2623 transitions.
[2023-10-27 12:21:43,242 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 15 states and 2623 transitions.
[2023-10-27 12:21:43,242 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:21:43,242 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2623 transitions.
[2023-10-27 12:21:43,245 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 16 states, 15 states have (on average 174.86666666666667) internal successors, (2623), 15 states have internal predecessors, (2623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:43,265 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 16 states, 16 states have (on average 311.0) internal successors, (4976), 16 states have internal predecessors, (4976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:43,281 INFO  L81            ComplementDD]: Finished complementDD. Result  has 16 states, 16 states have (on average 311.0) internal successors, (4976), 16 states have internal predecessors, (4976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:43,282 INFO  L175             Difference]: Start difference. First operand has 146 places, 404 transitions, 3562 flow. Second operand 15 states and 2623 transitions.
[2023-10-27 12:21:43,282 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 933 transitions, 9869 flow
[2023-10-27 12:21:44,767 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 933 transitions, 9813 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-27 12:21:44,776 INFO  L231             Difference]: Finished difference. Result has 172 places, 487 transitions, 4792 flow
[2023-10-27 12:21:44,776 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=311, PETRI_DIFFERENCE_MINUEND_FLOW=3558, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=404, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=336, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=4792, PETRI_PLACES=172, PETRI_TRANSITIONS=487}
[2023-10-27 12:21:44,777 INFO  L288   CegarLoopForPetriNet]: 97 programPoint places, 75 predicate places.
[2023-10-27 12:21:44,778 INFO  L495      AbstractCegarLoop]: Abstraction has has 172 places, 487 transitions, 4792 flow
[2023-10-27 12:21:44,778 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 160.4) internal successors, (1604), 10 states have internal predecessors, (1604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:44,779 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:21:44,779 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:21:44,785 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2023-10-27 12:21:44,983 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,3 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-27 12:21:44,984 INFO  L420      AbstractCegarLoop]: === Iteration 16 === Targeting threadErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2023-10-27 12:21:44,986 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:21:44,986 INFO  L85        PathProgramCache]: Analyzing trace with hash 14273182, now seen corresponding path program 1 times
[2023-10-27 12:21:44,986 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:21:44,987 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090329771]
[2023-10-27 12:21:44,987 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:21:44,987 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:21:45,039 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:21:45,723 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:21:45,724 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:21:45,724 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090329771]
[2023-10-27 12:21:45,724 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090329771] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-27 12:21:45,724 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [513526229]
[2023-10-27 12:21:45,724 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:21:45,724 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-27 12:21:45,724 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-27 12:21:45,738 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-27 12:21:45,771 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2023-10-27 12:21:45,959 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:21:45,961 INFO  L263         TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core
[2023-10-27 12:21:45,965 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-27 12:21:45,980 INFO  L321             Elim1Store]: treesize reduction 11, result has 8.3 percent of original size
[2023-10-27 12:21:45,980 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 140 treesize of output 130
[2023-10-27 12:21:46,109 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2023-10-27 12:21:46,110 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28
[2023-10-27 12:21:46,167 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12
[2023-10-27 12:21:46,200 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2023-10-27 12:21:46,207 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2023-10-27 12:21:46,219 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:21:46,219 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2023-10-27 12:21:46,253 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:21:46,254 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2023-10-27 12:21:46,270 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-10-27 12:21:46,293 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-10-27 12:21:46,293 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-10-27 12:21:46,293 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [513526229] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:21:46,293 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2023-10-27 12:21:46,293 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 10
[2023-10-27 12:21:46,294 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782616970]
[2023-10-27 12:21:46,294 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:21:46,294 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2023-10-27 12:21:46,294 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:21:46,295 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2023-10-27 12:21:46,295 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132
[2023-10-27 12:21:46,798 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 145 out of 311
[2023-10-27 12:21:46,798 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 487 transitions, 4792 flow. Second operand  has 10 states, 10 states have (on average 148.2) internal successors, (1482), 10 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:46,798 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:21:46,798 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 311
[2023-10-27 12:21:46,799 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:21:55,614 INFO  L130       PetriNetUnfolder]: 23303/42081 cut-off events.
[2023-10-27 12:21:55,615 INFO  L131       PetriNetUnfolder]: For 186041/186255 co-relation queries the response was YES.
[2023-10-27 12:21:55,856 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 206995 conditions, 42081 events. 23303/42081 cut-off events. For 186041/186255 co-relation queries the response was YES. Maximal size of possible extension queue 1248. Compared 363871 event pairs, 4058 based on Foata normal form. 222/42004 useless extension candidates. Maximal degree in co-relation 206946. Up to 24256 conditions per place. 
[2023-10-27 12:21:56,018 INFO  L137   encePairwiseOnDemand]: 289/311 looper letters, 793 selfloop transitions, 227 changer transitions 2/1051 dead transitions.
[2023-10-27 12:21:56,019 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 1051 transitions, 12381 flow
[2023-10-27 12:21:56,019 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2023-10-27 12:21:56,019 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2023-10-27 12:21:56,021 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1832 transitions.
[2023-10-27 12:21:56,021 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5355159310143233
[2023-10-27 12:21:56,021 INFO  L72            ComplementDD]: Start complementDD. Operand 11 states and 1832 transitions.
[2023-10-27 12:21:56,022 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 11 states and 1832 transitions.
[2023-10-27 12:21:56,022 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:21:56,022 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1832 transitions.
[2023-10-27 12:21:56,038 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 12 states, 11 states have (on average 166.54545454545453) internal successors, (1832), 11 states have internal predecessors, (1832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:56,042 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 12 states, 12 states have (on average 311.0) internal successors, (3732), 12 states have internal predecessors, (3732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:56,043 INFO  L81            ComplementDD]: Finished complementDD. Result  has 12 states, 12 states have (on average 311.0) internal successors, (3732), 12 states have internal predecessors, (3732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:56,043 INFO  L175             Difference]: Start difference. First operand has 172 places, 487 transitions, 4792 flow. Second operand 11 states and 1832 transitions.
[2023-10-27 12:21:56,043 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 1051 transitions, 12381 flow
[2023-10-27 12:21:59,123 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 1051 transitions, 12373 flow, removed 4 selfloop flow, removed 0 redundant places.
[2023-10-27 12:21:59,135 INFO  L231             Difference]: Finished difference. Result has 188 places, 690 transitions, 8206 flow
[2023-10-27 12:21:59,135 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=311, PETRI_DIFFERENCE_MINUEND_FLOW=4784, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=487, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=326, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=8206, PETRI_PLACES=188, PETRI_TRANSITIONS=690}
[2023-10-27 12:21:59,136 INFO  L288   CegarLoopForPetriNet]: 97 programPoint places, 91 predicate places.
[2023-10-27 12:21:59,136 INFO  L495      AbstractCegarLoop]: Abstraction has has 188 places, 690 transitions, 8206 flow
[2023-10-27 12:21:59,136 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 148.2) internal successors, (1482), 10 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:59,136 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:21:59,136 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:21:59,143 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2023-10-27 12:21:59,341 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26
[2023-10-27 12:21:59,341 INFO  L420      AbstractCegarLoop]: === Iteration 17 === Targeting threadErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2023-10-27 12:21:59,342 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:21:59,342 INFO  L85        PathProgramCache]: Analyzing trace with hash 1455919734, now seen corresponding path program 2 times
[2023-10-27 12:21:59,342 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:21:59,342 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067049805]
[2023-10-27 12:21:59,343 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:21:59,343 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:21:59,402 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:22:00,219 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:22:00,219 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:22:00,219 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067049805]
[2023-10-27 12:22:00,219 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067049805] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-27 12:22:00,219 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1428711935]
[2023-10-27 12:22:00,219 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2023-10-27 12:22:00,219 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-27 12:22:00,219 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-27 12:22:00,223 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-27 12:22:00,248 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2023-10-27 12:22:00,539 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2023-10-27 12:22:00,539 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-27 12:22:00,540 INFO  L263         TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 31 conjunts are in the unsatisfiable core
[2023-10-27 12:22:00,543 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-27 12:22:00,551 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16
[2023-10-27 12:22:00,749 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2023-10-27 12:22:00,750 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29
[2023-10-27 12:22:00,863 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2023-10-27 12:22:00,910 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2023-10-27 12:22:00,945 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2023-10-27 12:22:01,019 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:22:01,020 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2023-10-27 12:22:01,094 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:22:01,094 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2023-10-27 12:22:01,174 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-10-27 12:22:01,246 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-10-27 12:22:01,258 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-10-27 12:22:01,258 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-10-27 12:22:01,258 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1428711935] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:22:01,258 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2023-10-27 12:22:01,258 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 17
[2023-10-27 12:22:01,258 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220955202]
[2023-10-27 12:22:01,258 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:22:01,258 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2023-10-27 12:22:01,259 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:22:01,259 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2023-10-27 12:22:01,259 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342
[2023-10-27 12:22:01,906 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 147 out of 311
[2023-10-27 12:22:01,907 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 690 transitions, 8206 flow. Second operand  has 11 states, 11 states have (on average 149.9090909090909) internal successors, (1649), 11 states have internal predecessors, (1649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:22:01,907 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:22:01,907 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 311
[2023-10-27 12:22:01,907 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:22:14,013 INFO  L130       PetriNetUnfolder]: 27347/48794 cut-off events.
[2023-10-27 12:22:14,013 INFO  L131       PetriNetUnfolder]: For 303207/303420 co-relation queries the response was YES.
[2023-10-27 12:22:14,523 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 266573 conditions, 48794 events. 27347/48794 cut-off events. For 303207/303420 co-relation queries the response was YES. Maximal size of possible extension queue 1340. Compared 426593 event pairs, 5604 based on Foata normal form. 388/48807 useless extension candidates. Maximal degree in co-relation 266517. Up to 16078 conditions per place. 
[2023-10-27 12:22:14,706 INFO  L137   encePairwiseOnDemand]: 295/311 looper letters, 927 selfloop transitions, 531 changer transitions 32/1519 dead transitions.
[2023-10-27 12:22:14,706 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 1519 transitions, 20783 flow
[2023-10-27 12:22:14,706 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2023-10-27 12:22:14,707 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2023-10-27 12:22:14,709 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1836 transitions.
[2023-10-27 12:22:14,709 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5366851797719965
[2023-10-27 12:22:14,709 INFO  L72            ComplementDD]: Start complementDD. Operand 11 states and 1836 transitions.
[2023-10-27 12:22:14,710 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 11 states and 1836 transitions.
[2023-10-27 12:22:14,710 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:22:14,710 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1836 transitions.
[2023-10-27 12:22:14,712 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 12 states, 11 states have (on average 166.9090909090909) internal successors, (1836), 11 states have internal predecessors, (1836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:22:14,714 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 12 states, 12 states have (on average 311.0) internal successors, (3732), 12 states have internal predecessors, (3732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:22:14,714 INFO  L81            ComplementDD]: Finished complementDD. Result  has 12 states, 12 states have (on average 311.0) internal successors, (3732), 12 states have internal predecessors, (3732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:22:14,714 INFO  L175             Difference]: Start difference. First operand has 188 places, 690 transitions, 8206 flow. Second operand 11 states and 1836 transitions.
[2023-10-27 12:22:14,714 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 1519 transitions, 20783 flow
[2023-10-27 12:22:19,000 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 1519 transitions, 20722 flow, removed 19 selfloop flow, removed 3 redundant places.
[2023-10-27 12:22:19,017 INFO  L231             Difference]: Finished difference. Result has 202 places, 1001 transitions, 14801 flow
[2023-10-27 12:22:19,018 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=311, PETRI_DIFFERENCE_MINUEND_FLOW=8145, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=690, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=262, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=14801, PETRI_PLACES=202, PETRI_TRANSITIONS=1001}
[2023-10-27 12:22:19,018 INFO  L288   CegarLoopForPetriNet]: 97 programPoint places, 105 predicate places.
[2023-10-27 12:22:19,019 INFO  L495      AbstractCegarLoop]: Abstraction has has 202 places, 1001 transitions, 14801 flow
[2023-10-27 12:22:19,019 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 149.9090909090909) internal successors, (1649), 11 states have internal predecessors, (1649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:22:19,019 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:22:19,020 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:22:19,026 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0
[2023-10-27 12:22:19,224 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,5 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-27 12:22:19,225 INFO  L420      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2023-10-27 12:22:19,233 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:22:19,234 INFO  L85        PathProgramCache]: Analyzing trace with hash -793526429, now seen corresponding path program 2 times
[2023-10-27 12:22:19,234 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:22:19,235 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159983621]
[2023-10-27 12:22:19,235 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:22:19,235 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:22:19,275 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:22:19,949 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:22:19,949 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:22:19,950 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159983621]
[2023-10-27 12:22:19,950 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159983621] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-27 12:22:19,950 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455197439]
[2023-10-27 12:22:19,950 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2023-10-27 12:22:19,950 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-27 12:22:19,950 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-27 12:22:19,951 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-27 12:22:20,004 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2023-10-27 12:22:20,246 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2023-10-27 12:22:20,246 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-27 12:22:20,248 INFO  L263         TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 28 conjunts are in the unsatisfiable core
[2023-10-27 12:22:20,251 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-27 12:22:20,263 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:22:20,266 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24
[2023-10-27 12:22:20,491 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2023-10-27 12:22:20,492 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29
[2023-10-27 12:22:20,607 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:22:20,608 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24
[2023-10-27 12:22:20,620 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2023-10-27 12:22:20,651 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2023-10-27 12:22:20,662 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20
[2023-10-27 12:22:20,669 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2023-10-27 12:22:20,679 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:22:20,680 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2023-10-27 12:22:20,702 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:22:20,703 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2023-10-27 12:22:20,710 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-10-27 12:22:20,710 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-10-27 12:22:20,710 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1455197439] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:22:20,711 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2023-10-27 12:22:20,711 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 12
[2023-10-27 12:22:20,711 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428419339]
[2023-10-27 12:22:20,711 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:22:20,712 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2023-10-27 12:22:20,712 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:22:20,713 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2023-10-27 12:22:20,713 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182
[2023-10-27 12:22:21,285 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 160 out of 311
[2023-10-27 12:22:21,286 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 1001 transitions, 14801 flow. Second operand  has 10 states, 10 states have (on average 162.4) internal successors, (1624), 10 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:22:21,286 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:22:21,286 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 311
[2023-10-27 12:22:21,286 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:22:29,613 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([649] L1059-8-->L1059-9: Formula: (let ((.cse0 (+ |v_ULTIMATE.start_main_#t~mem16#1.offset_3| (* |v_ULTIMATE.start_main_~i~0#1_5| 4)))) (and (= (store |v_#memory_int_9| |v_ULTIMATE.start_main_#t~mem16#1.base_3| (store (select |v_#memory_int_9| |v_ULTIMATE.start_main_#t~mem16#1.base_3|) .cse0 |v_ULTIMATE.start_main_#t~pre15#1_3|)) |v_#memory_int_8|) (= |v_#memory_$Pointer$.base_5| (store |v_#memory_$Pointer$.base_6| |v_ULTIMATE.start_main_#t~mem16#1.base_3| (store (select |v_#memory_$Pointer$.base_6| |v_ULTIMATE.start_main_#t~mem16#1.base_3|) .cse0 (select (select |v_#memory_$Pointer$.base_5| |v_ULTIMATE.start_main_#t~mem16#1.base_3|) .cse0)))) (= (store |v_#memory_$Pointer$.offset_6| |v_ULTIMATE.start_main_#t~mem16#1.base_3| (store (select |v_#memory_$Pointer$.offset_6| |v_ULTIMATE.start_main_#t~mem16#1.base_3|) .cse0 (select (select |v_#memory_$Pointer$.offset_5| |v_ULTIMATE.start_main_#t~mem16#1.base_3|) .cse0))) |v_#memory_$Pointer$.offset_5|)))  InVars {ULTIMATE.start_main_#t~mem16#1.offset=|v_ULTIMATE.start_main_#t~mem16#1.offset_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_6|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_3|, ULTIMATE.start_main_#t~mem16#1.base=|v_ULTIMATE.start_main_#t~mem16#1.base_3|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_6|}  OutVars{ULTIMATE.start_main_#t~mem16#1.offset=|v_ULTIMATE.start_main_#t~mem16#1.offset_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_5|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_3|, ULTIMATE.start_main_#t~mem16#1.base=|v_ULTIMATE.start_main_#t~mem16#1.base_3|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_5|}  AuxVars[]  AssignedVars[#memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset][16], [Black: 868#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 511#(not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 260#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem19#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem19#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem19#1.offset|)) 0)), Black: 513#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 259#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem19#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem19#1.offset|)) 0)), Black: 512#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 258#(= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem19#1.offset|)) 0), Black: 514#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 261#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem19#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem19#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem19#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem19#1.offset|)) 0)), Black: 526#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 525#(and (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 528#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 527#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), 245#true, 903#(and (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_#t~mem16#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), 524#(not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)), 121#L1044true, 219#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 74#threadEXITtrue, 500#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 691#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem19#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem19#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem19#1.offset|)) 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem19#1.base|)) (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem19#1.offset|)) 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 687#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem19#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem19#1.offset|)) 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem19#1.base|)) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 554#(and (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 550#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem19#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem19#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem19#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem19#1.offset|)) 0)), Black: 548#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem19#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem19#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem19#1.offset|)) 0) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem19#1.base|))), Black: 683#(and (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem19#1.base|)) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 585#(and (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (= |ULTIMATE.start_main_#t~mem16#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 689#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem19#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem19#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem19#1.offset|)) 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem19#1.base|)) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 545#(not (= ~datas~0.base |ULTIMATE.start_main_#t~mem19#1.base|)), Black: 685#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem19#1.offset|)) 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem19#1.base|)) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 546#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem19#1.offset|)) 0) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem19#1.base|))), threadThread1of2ForFork0InUse, Black: 547#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem19#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem19#1.offset|)) 0) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem19#1.base|))), Black: 549#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem19#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem19#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem19#1.offset|)) 0) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem19#1.base|)) (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem19#1.offset|)) 0)), threadThread2of2ForFork0InUse, 233#(= |#race~datas~0| 0), 95#L1059-9true, Black: 715#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem19#1.base|)) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 712#(not (= ~datas~0.base |ULTIMATE.start_main_#t~mem19#1.base|)), Black: 714#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem19#1.base|)) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 207#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 717#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 716#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem19#1.base|)) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 713#(and (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem19#1.base|)) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), 196#true, Black: 214#true, Black: 218#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 216#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 256#true, Black: 217#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 540#true, Black: 231#true, 1071#(and (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= |ULTIMATE.start_main_#t~mem16#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), 707#true, Black: 1006#(and (<= (+ 2 |ULTIMATE.start_main_#t~mem19#1.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem19#1.base|)) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 502#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 1014#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ 2 |ULTIMATE.start_main_#t~mem19#1.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem19#1.base|)) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 248#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 270#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 1012#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ 2 |ULTIMATE.start_main_#t~mem19#1.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem19#1.base|)) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 247#(= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))), Black: 1016#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 1010#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ 2 |ULTIMATE.start_main_#t~mem19#1.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem19#1.base|)) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 250#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 1008#(and (<= (+ 2 |ULTIMATE.start_main_#t~mem19#1.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem19#1.base|)) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 249#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))))])
[2023-10-27 12:22:29,613 INFO  L383   tUnfolder$Statistics]: this new event has 76 ancestors and is cut-off event
[2023-10-27 12:22:29,614 INFO  L386   tUnfolder$Statistics]:   existing Event has 76 ancestors and is cut-off event
[2023-10-27 12:22:29,614 INFO  L386   tUnfolder$Statistics]:   existing Event has 76 ancestors and is cut-off event
[2023-10-27 12:22:29,614 INFO  L386   tUnfolder$Statistics]:   existing Event has 76 ancestors and is cut-off event
[2023-10-27 12:22:31,830 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([649] L1059-8-->L1059-9: Formula: (let ((.cse0 (+ |v_ULTIMATE.start_main_#t~mem16#1.offset_3| (* |v_ULTIMATE.start_main_~i~0#1_5| 4)))) (and (= (store |v_#memory_int_9| |v_ULTIMATE.start_main_#t~mem16#1.base_3| (store (select |v_#memory_int_9| |v_ULTIMATE.start_main_#t~mem16#1.base_3|) .cse0 |v_ULTIMATE.start_main_#t~pre15#1_3|)) |v_#memory_int_8|) (= |v_#memory_$Pointer$.base_5| (store |v_#memory_$Pointer$.base_6| |v_ULTIMATE.start_main_#t~mem16#1.base_3| (store (select |v_#memory_$Pointer$.base_6| |v_ULTIMATE.start_main_#t~mem16#1.base_3|) .cse0 (select (select |v_#memory_$Pointer$.base_5| |v_ULTIMATE.start_main_#t~mem16#1.base_3|) .cse0)))) (= (store |v_#memory_$Pointer$.offset_6| |v_ULTIMATE.start_main_#t~mem16#1.base_3| (store (select |v_#memory_$Pointer$.offset_6| |v_ULTIMATE.start_main_#t~mem16#1.base_3|) .cse0 (select (select |v_#memory_$Pointer$.offset_5| |v_ULTIMATE.start_main_#t~mem16#1.base_3|) .cse0))) |v_#memory_$Pointer$.offset_5|)))  InVars {ULTIMATE.start_main_#t~mem16#1.offset=|v_ULTIMATE.start_main_#t~mem16#1.offset_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_6|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_3|, ULTIMATE.start_main_#t~mem16#1.base=|v_ULTIMATE.start_main_#t~mem16#1.base_3|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_6|}  OutVars{ULTIMATE.start_main_#t~mem16#1.offset=|v_ULTIMATE.start_main_#t~mem16#1.offset_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_5|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_3|, ULTIMATE.start_main_#t~mem16#1.base=|v_ULTIMATE.start_main_#t~mem16#1.base_3|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_5|}  AuxVars[]  AssignedVars[#memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset][16], [Black: 868#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 511#(not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 260#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem19#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem19#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem19#1.offset|)) 0)), Black: 513#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 259#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem19#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem19#1.offset|)) 0)), 79#L1045-4true, Black: 512#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 258#(= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem19#1.offset|)) 0), Black: 514#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 261#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem19#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem19#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem19#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem19#1.offset|)) 0)), Black: 526#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 525#(and (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 528#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 527#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), 903#(and (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_#t~mem16#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), 245#true, 524#(not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)), 219#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 74#threadEXITtrue, 500#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 691#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem19#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem19#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem19#1.offset|)) 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem19#1.base|)) (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem19#1.offset|)) 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), 241#true, Black: 687#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem19#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem19#1.offset|)) 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem19#1.base|)) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 554#(and (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 550#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem19#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem19#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem19#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem19#1.offset|)) 0)), Black: 548#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem19#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem19#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem19#1.offset|)) 0) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem19#1.base|))), Black: 683#(and (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem19#1.base|)) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 585#(and (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (= |ULTIMATE.start_main_#t~mem16#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 689#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem19#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem19#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem19#1.offset|)) 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem19#1.base|)) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 545#(not (= ~datas~0.base |ULTIMATE.start_main_#t~mem19#1.base|)), Black: 685#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem19#1.offset|)) 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem19#1.base|)) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 546#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem19#1.offset|)) 0) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem19#1.base|))), threadThread1of2ForFork0InUse, Black: 547#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem19#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem19#1.offset|)) 0) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem19#1.base|))), Black: 549#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem19#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem19#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem19#1.offset|)) 0) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem19#1.base|)) (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem19#1.offset|)) 0)), threadThread2of2ForFork0InUse, 233#(= |#race~datas~0| 0), 95#L1059-9true, Black: 715#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem19#1.base|)) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 712#(not (= ~datas~0.base |ULTIMATE.start_main_#t~mem19#1.base|)), Black: 714#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem19#1.base|)) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 207#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 717#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 716#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem19#1.base|)) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 713#(and (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem19#1.base|)) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 214#true, 196#true, Black: 218#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 216#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 256#true, Black: 217#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 540#true, Black: 231#true, 1071#(and (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= |ULTIMATE.start_main_#t~mem16#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), 707#true, Black: 1006#(and (<= (+ 2 |ULTIMATE.start_main_#t~mem19#1.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem19#1.base|)) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 502#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 1014#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ 2 |ULTIMATE.start_main_#t~mem19#1.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem19#1.base|)) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 248#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 270#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 1012#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ 2 |ULTIMATE.start_main_#t~mem19#1.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem19#1.base|)) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 247#(= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))), Black: 1016#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 1010#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ 2 |ULTIMATE.start_main_#t~mem19#1.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem19#1.base|)) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 250#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 1008#(and (<= (+ 2 |ULTIMATE.start_main_#t~mem19#1.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem19#1.base|)) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 249#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))))])
[2023-10-27 12:22:31,831 INFO  L383   tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event
[2023-10-27 12:22:31,831 INFO  L386   tUnfolder$Statistics]:   existing Event has 80 ancestors and is cut-off event
[2023-10-27 12:22:31,831 INFO  L386   tUnfolder$Statistics]:   existing Event has 80 ancestors and is cut-off event
[2023-10-27 12:22:31,831 INFO  L386   tUnfolder$Statistics]:   existing Event has 80 ancestors and is cut-off event
[2023-10-27 12:22:31,831 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([754] L1045-4-->L1045-6: Formula: (= (store |v_#race_68| v_~datas~0.base_63 (store (select |v_#race_68| v_~datas~0.base_63) (+ (* v_threadThread2of2ForFork0_~j~0_21 4) v_~datas~0.offset_55) |v_threadThread2of2ForFork0_#t~nondet6_21|)) |v_#race_67|)  InVars {#race=|v_#race_68|, ~datas~0.base=v_~datas~0.base_63, threadThread2of2ForFork0_~j~0=v_threadThread2of2ForFork0_~j~0_21, ~datas~0.offset=v_~datas~0.offset_55}  OutVars{#race=|v_#race_67|, ~datas~0.base=v_~datas~0.base_63, threadThread2of2ForFork0_#t~nondet6=|v_threadThread2of2ForFork0_#t~nondet6_21|, threadThread2of2ForFork0_~j~0=v_threadThread2of2ForFork0_~j~0_21, ~datas~0.offset=v_~datas~0.offset_55}  AuxVars[]  AssignedVars[#race, threadThread2of2ForFork0_#t~nondet6][466], [Black: 868#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 511#(not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 260#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem19#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem19#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem19#1.offset|)) 0)), Black: 513#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 259#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem19#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem19#1.offset|)) 0)), Black: 512#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 258#(= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem19#1.offset|)) 0), Black: 514#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 261#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem19#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem19#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem19#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem19#1.offset|)) 0)), 214#true, Black: 526#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 525#(and (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 528#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 527#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), 245#true, 903#(and (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_#t~mem16#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), 524#(not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)), 188#L1059-8true, 146#L1045-6true, 74#threadEXITtrue, 500#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 691#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem19#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem19#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem19#1.offset|)) 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem19#1.base|)) (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem19#1.offset|)) 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), 241#true, Black: 687#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem19#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem19#1.offset|)) 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem19#1.base|)) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 554#(and (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 550#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem19#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem19#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem19#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem19#1.offset|)) 0)), Black: 548#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem19#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem19#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem19#1.offset|)) 0) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem19#1.base|))), Black: 683#(and (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem19#1.base|)) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 585#(and (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (= |ULTIMATE.start_main_#t~mem16#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 689#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem19#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem19#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem19#1.offset|)) 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem19#1.base|)) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 545#(not (= ~datas~0.base |ULTIMATE.start_main_#t~mem19#1.base|)), Black: 685#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem19#1.offset|)) 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem19#1.base|)) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 546#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem19#1.offset|)) 0) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem19#1.base|))), threadThread1of2ForFork0InUse, Black: 547#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem19#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem19#1.offset|)) 0) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem19#1.base|))), Black: 549#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem19#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem19#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem19#1.offset|)) 0) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem19#1.base|)) (= (select (select |#race| |ULTIMATE.start_main_#t~mem19#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem19#1.offset|)) 0)), threadThread2of2ForFork0InUse, 233#(= |#race~datas~0| 0), Black: 715#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem19#1.base|)) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 712#(not (= ~datas~0.base |ULTIMATE.start_main_#t~mem19#1.base|)), Black: 714#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem19#1.base|)) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 207#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 717#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 716#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem19#1.base|)) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 713#(and (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem19#1.base|)) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), 196#true, Black: 218#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 216#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 256#true, Black: 219#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 217#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 540#true, Black: 231#true, 1071#(and (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= |ULTIMATE.start_main_#t~mem16#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), 707#true, Black: 1006#(and (<= (+ 2 |ULTIMATE.start_main_#t~mem19#1.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem19#1.base|)) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 502#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 1014#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ 2 |ULTIMATE.start_main_#t~mem19#1.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem19#1.base|)) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 248#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 270#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 1012#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ 2 |ULTIMATE.start_main_#t~mem19#1.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem19#1.base|)) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 247#(= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))), Black: 1016#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 1010#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ 2 |ULTIMATE.start_main_#t~mem19#1.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem19#1.base|)) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 250#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 1008#(and (<= (+ 2 |ULTIMATE.start_main_#t~mem19#1.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem19#1.base|)) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 249#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))))])
[2023-10-27 12:22:31,832 INFO  L383   tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event
[2023-10-27 12:22:31,832 INFO  L386   tUnfolder$Statistics]:   existing Event has 80 ancestors and is cut-off event
[2023-10-27 12:22:31,832 INFO  L386   tUnfolder$Statistics]:   existing Event has 80 ancestors and is cut-off event
[2023-10-27 12:22:31,832 INFO  L386   tUnfolder$Statistics]:   existing Event has 80 ancestors and is cut-off event
[2023-10-27 12:22:33,522 INFO  L130       PetriNetUnfolder]: 23104/43420 cut-off events.
[2023-10-27 12:22:33,522 INFO  L131       PetriNetUnfolder]: For 402768/404115 co-relation queries the response was YES.
[2023-10-27 12:22:33,791 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 266226 conditions, 43420 events. 23104/43420 cut-off events. For 402768/404115 co-relation queries the response was YES. Maximal size of possible extension queue 1328. Compared 397978 event pairs, 2053 based on Foata normal form. 475/43198 useless extension candidates. Maximal degree in co-relation 266162. Up to 15528 conditions per place. 
[2023-10-27 12:22:33,971 INFO  L137   encePairwiseOnDemand]: 300/311 looper letters, 1376 selfloop transitions, 98 changer transitions 13/1608 dead transitions.
[2023-10-27 12:22:33,971 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 1608 transitions, 26527 flow
[2023-10-27 12:22:33,971 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2023-10-27 12:22:33,972 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2023-10-27 12:22:33,972 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1618 transitions.
[2023-10-27 12:22:33,973 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5780635941407646
[2023-10-27 12:22:33,973 INFO  L72            ComplementDD]: Start complementDD. Operand 9 states and 1618 transitions.
[2023-10-27 12:22:33,973 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 9 states and 1618 transitions.
[2023-10-27 12:22:33,973 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:22:33,974 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1618 transitions.
[2023-10-27 12:22:33,975 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 10 states, 9 states have (on average 179.77777777777777) internal successors, (1618), 9 states have internal predecessors, (1618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:22:33,977 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 10 states, 10 states have (on average 311.0) internal successors, (3110), 10 states have internal predecessors, (3110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:22:33,977 INFO  L81            ComplementDD]: Finished complementDD. Result  has 10 states, 10 states have (on average 311.0) internal successors, (3110), 10 states have internal predecessors, (3110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:22:33,977 INFO  L175             Difference]: Start difference. First operand has 202 places, 1001 transitions, 14801 flow. Second operand 9 states and 1618 transitions.
[2023-10-27 12:22:33,977 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 1608 transitions, 26527 flow
[2023-10-27 12:22:38,936 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 1608 transitions, 26372 flow, removed 73 selfloop flow, removed 2 redundant places.
[2023-10-27 12:22:38,953 INFO  L231             Difference]: Finished difference. Result has 206 places, 994 transitions, 14811 flow
[2023-10-27 12:22:38,953 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=311, PETRI_DIFFERENCE_MINUEND_FLOW=14694, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1000, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=902, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=14811, PETRI_PLACES=206, PETRI_TRANSITIONS=994}
[2023-10-27 12:22:38,957 INFO  L288   CegarLoopForPetriNet]: 97 programPoint places, 109 predicate places.
[2023-10-27 12:22:38,957 INFO  L495      AbstractCegarLoop]: Abstraction has has 206 places, 994 transitions, 14811 flow
[2023-10-27 12:22:38,958 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 162.4) internal successors, (1624), 10 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:22:38,958 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:22:38,958 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:22:38,965 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0
[2023-10-27 12:22:39,163 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28
[2023-10-27 12:22:39,164 INFO  L420      AbstractCegarLoop]: === Iteration 19 === Targeting threadErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2023-10-27 12:22:39,164 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:22:39,165 INFO  L85        PathProgramCache]: Analyzing trace with hash -935568446, now seen corresponding path program 3 times
[2023-10-27 12:22:39,165 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:22:39,165 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270940010]
[2023-10-27 12:22:39,166 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:22:39,166 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:22:39,220 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:22:40,081 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:22:40,081 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:22:40,081 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270940010]
[2023-10-27 12:22:40,081 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270940010] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-27 12:22:40,081 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [335277617]
[2023-10-27 12:22:40,081 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2023-10-27 12:22:40,082 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-27 12:22:40,082 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-27 12:22:40,090 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-27 12:22:40,132 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2023-10-27 12:22:40,350 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2023-10-27 12:22:40,350 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-27 12:22:40,352 INFO  L263         TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 35 conjunts are in the unsatisfiable core
[2023-10-27 12:22:40,360 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-27 12:22:40,368 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16
[2023-10-27 12:22:40,574 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2023-10-27 12:22:40,575 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29
[2023-10-27 12:22:40,685 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24
[2023-10-27 12:22:40,715 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2023-10-27 12:22:40,744 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2023-10-27 12:22:40,814 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:22:40,816 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2023-10-27 12:22:40,879 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2023-10-27 12:22:40,927 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40
[2023-10-27 12:22:40,964 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:22:40,964 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2023-10-27 12:22:41,023 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-10-27 12:22:41,056 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-10-27 12:22:41,087 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-10-27 12:22:41,133 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-10-27 12:22:41,144 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-10-27 12:22:41,144 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-10-27 12:22:41,145 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [335277617] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:22:41,145 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2023-10-27 12:22:41,145 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 17
[2023-10-27 12:22:41,145 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12564985]
[2023-10-27 12:22:41,145 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:22:41,145 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2023-10-27 12:22:41,145 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:22:41,146 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2023-10-27 12:22:41,146 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342
[2023-10-27 12:22:41,554 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 147 out of 311
[2023-10-27 12:22:41,555 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 994 transitions, 14811 flow. Second operand  has 11 states, 11 states have (on average 149.9090909090909) internal successors, (1649), 11 states have internal predecessors, (1649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:22:41,555 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:22:41,555 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 311
[2023-10-27 12:22:41,555 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:22:56,922 INFO  L130       PetriNetUnfolder]: 28443/51209 cut-off events.
[2023-10-27 12:22:56,923 INFO  L131       PetriNetUnfolder]: For 463413/463614 co-relation queries the response was YES.
[2023-10-27 12:22:57,209 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 316245 conditions, 51209 events. 28443/51209 cut-off events. For 463413/463614 co-relation queries the response was YES. Maximal size of possible extension queue 1373. Compared 452490 event pairs, 5868 based on Foata normal form. 283/51133 useless extension candidates. Maximal degree in co-relation 316182. Up to 25204 conditions per place. 
[2023-10-27 12:22:57,410 INFO  L137   encePairwiseOnDemand]: 291/311 looper letters, 1045 selfloop transitions, 600 changer transitions 33/1706 dead transitions.
[2023-10-27 12:22:57,410 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 1706 transitions, 25817 flow
[2023-10-27 12:22:57,410 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2023-10-27 12:22:57,420 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 15 states.
[2023-10-27 12:22:57,421 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2583 transitions.
[2023-10-27 12:22:57,422 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5536977491961415
[2023-10-27 12:22:57,422 INFO  L72            ComplementDD]: Start complementDD. Operand 15 states and 2583 transitions.
[2023-10-27 12:22:57,422 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 15 states and 2583 transitions.
[2023-10-27 12:22:57,422 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:22:57,422 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2583 transitions.
[2023-10-27 12:22:57,425 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 16 states, 15 states have (on average 172.2) internal successors, (2583), 15 states have internal predecessors, (2583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:22:57,428 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 16 states, 16 states have (on average 311.0) internal successors, (4976), 16 states have internal predecessors, (4976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:22:57,428 INFO  L81            ComplementDD]: Finished complementDD. Result  has 16 states, 16 states have (on average 311.0) internal successors, (4976), 16 states have internal predecessors, (4976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:22:57,428 INFO  L175             Difference]: Start difference. First operand has 206 places, 994 transitions, 14811 flow. Second operand 15 states and 2583 transitions.
[2023-10-27 12:22:57,429 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 1706 transitions, 25817 flow
[2023-10-27 12:23:04,830 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 1706 transitions, 25445 flow, removed 17 selfloop flow, removed 9 redundant places.
[2023-10-27 12:23:04,882 INFO  L231             Difference]: Finished difference. Result has 216 places, 1254 transitions, 20384 flow
[2023-10-27 12:23:04,883 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=311, PETRI_DIFFERENCE_MINUEND_FLOW=14607, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=994, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=356, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=584, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=20384, PETRI_PLACES=216, PETRI_TRANSITIONS=1254}
[2023-10-27 12:23:04,885 INFO  L288   CegarLoopForPetriNet]: 97 programPoint places, 119 predicate places.
[2023-10-27 12:23:04,886 INFO  L495      AbstractCegarLoop]: Abstraction has has 216 places, 1254 transitions, 20384 flow
[2023-10-27 12:23:04,886 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 149.9090909090909) internal successors, (1649), 11 states have internal predecessors, (1649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:23:04,886 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:23:04,886 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:23:04,905 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0
[2023-10-27 12:23:05,092 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,7 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-27 12:23:05,092 INFO  L420      AbstractCegarLoop]: === Iteration 20 === Targeting threadErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2023-10-27 12:23:05,093 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:23:05,093 INFO  L85        PathProgramCache]: Analyzing trace with hash -1553782916, now seen corresponding path program 4 times
[2023-10-27 12:23:05,093 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:23:05,093 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466141005]
[2023-10-27 12:23:05,093 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:23:05,094 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:23:05,113 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:23:05,904 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:23:05,904 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:23:05,905 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466141005]
[2023-10-27 12:23:05,905 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466141005] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-27 12:23:05,905 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690216426]
[2023-10-27 12:23:05,905 INFO  L93    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2023-10-27 12:23:05,905 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-27 12:23:05,905 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-27 12:23:05,906 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-27 12:23:05,946 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2023-10-27 12:23:06,440 INFO  L228   tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2023-10-27 12:23:06,440 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-27 12:23:06,442 INFO  L263         TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 36 conjunts are in the unsatisfiable core
[2023-10-27 12:23:06,446 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-27 12:23:06,454 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16
[2023-10-27 12:23:06,640 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2023-10-27 12:23:06,640 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29
[2023-10-27 12:23:06,750 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24
[2023-10-27 12:23:06,762 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2023-10-27 12:23:06,811 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2023-10-27 12:23:06,841 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2023-10-27 12:23:06,884 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:23:06,885 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2023-10-27 12:23:06,925 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:23:06,925 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2023-10-27 12:23:06,991 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-10-27 12:23:07,038 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-10-27 12:23:07,062 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-10-27 12:23:07,082 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-10-27 12:23:07,129 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-10-27 12:23:07,141 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-10-27 12:23:07,141 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-10-27 12:23:07,142 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1690216426] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:23:07,142 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2023-10-27 12:23:07,142 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 17
[2023-10-27 12:23:07,142 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031233788]
[2023-10-27 12:23:07,142 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:23:07,142 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2023-10-27 12:23:07,142 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:23:07,143 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2023-10-27 12:23:07,143 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342
[2023-10-27 12:23:07,596 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 147 out of 311
[2023-10-27 12:23:07,597 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 1254 transitions, 20384 flow. Second operand  has 11 states, 11 states have (on average 149.9090909090909) internal successors, (1649), 11 states have internal predecessors, (1649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:23:07,597 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:23:07,597 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 311
[2023-10-27 12:23:07,597 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:23:25,088 INFO  L130       PetriNetUnfolder]: 30944/54801 cut-off events.
[2023-10-27 12:23:25,088 INFO  L131       PetriNetUnfolder]: For 634699/634957 co-relation queries the response was YES.
[2023-10-27 12:23:25,645 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 368276 conditions, 54801 events. 30944/54801 cut-off events. For 634699/634957 co-relation queries the response was YES. Maximal size of possible extension queue 1463. Compared 481696 event pairs, 4770 based on Foata normal form. 284/54743 useless extension candidates. Maximal degree in co-relation 368207. Up to 24771 conditions per place. 
[2023-10-27 12:23:25,870 INFO  L137   encePairwiseOnDemand]: 291/311 looper letters, 1374 selfloop transitions, 546 changer transitions 30/1978 dead transitions.
[2023-10-27 12:23:25,870 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 1978 transitions, 34491 flow
[2023-10-27 12:23:25,871 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2023-10-27 12:23:25,871 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 12 states.
[2023-10-27 12:23:25,872 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2026 transitions.
[2023-10-27 12:23:25,872 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5428724544480171
[2023-10-27 12:23:25,873 INFO  L72            ComplementDD]: Start complementDD. Operand 12 states and 2026 transitions.
[2023-10-27 12:23:25,873 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 12 states and 2026 transitions.
[2023-10-27 12:23:25,873 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:23:25,873 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2026 transitions.
[2023-10-27 12:23:25,875 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 13 states, 12 states have (on average 168.83333333333334) internal successors, (2026), 12 states have internal predecessors, (2026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:23:25,879 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 13 states, 13 states have (on average 311.0) internal successors, (4043), 13 states have internal predecessors, (4043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:23:25,880 INFO  L81            ComplementDD]: Finished complementDD. Result  has 13 states, 13 states have (on average 311.0) internal successors, (4043), 13 states have internal predecessors, (4043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:23:25,880 INFO  L175             Difference]: Start difference. First operand has 216 places, 1254 transitions, 20384 flow. Second operand 12 states and 2026 transitions.
[2023-10-27 12:23:25,880 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 1978 transitions, 34491 flow
[2023-10-27 12:23:35,123 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 1978 transitions, 33698 flow, removed 388 selfloop flow, removed 2 redundant places.
[2023-10-27 12:23:35,148 INFO  L231             Difference]: Finished difference. Result has 231 places, 1533 transitions, 26648 flow
[2023-10-27 12:23:35,149 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=311, PETRI_DIFFERENCE_MINUEND_FLOW=19608, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=301, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=825, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=26648, PETRI_PLACES=231, PETRI_TRANSITIONS=1533}
[2023-10-27 12:23:35,158 INFO  L288   CegarLoopForPetriNet]: 97 programPoint places, 134 predicate places.
[2023-10-27 12:23:35,159 INFO  L495      AbstractCegarLoop]: Abstraction has has 231 places, 1533 transitions, 26648 flow
[2023-10-27 12:23:35,159 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 149.9090909090909) internal successors, (1649), 11 states have internal predecessors, (1649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:23:35,159 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:23:35,162 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:23:35,170 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0
[2023-10-27 12:23:35,368 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30
[2023-10-27 12:23:35,368 INFO  L420      AbstractCegarLoop]: === Iteration 21 === Targeting threadErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2023-10-27 12:23:35,370 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:23:35,370 INFO  L85        PathProgramCache]: Analyzing trace with hash 511920996, now seen corresponding path program 5 times
[2023-10-27 12:23:35,371 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:23:35,371 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379570065]
[2023-10-27 12:23:35,371 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:23:35,372 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:23:35,421 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:23:36,137 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:23:36,137 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:23:36,137 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379570065]
[2023-10-27 12:23:36,138 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379570065] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-27 12:23:36,138 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248322893]
[2023-10-27 12:23:36,138 INFO  L93    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2023-10-27 12:23:36,138 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-27 12:23:36,138 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-27 12:23:36,139 INFO  L229       MonitoredProcess]: Starting monitored process 9 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-27 12:23:36,165 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2023-10-27 12:23:36,320 INFO  L228   tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2023-10-27 12:23:36,321 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-27 12:23:36,322 INFO  L263         TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 33 conjunts are in the unsatisfiable core
[2023-10-27 12:23:36,325 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-27 12:23:36,332 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:23:36,334 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24
[2023-10-27 12:23:36,521 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2023-10-27 12:23:36,522 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29
[2023-10-27 12:23:36,619 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:23:36,620 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24
[2023-10-27 12:23:36,631 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2023-10-27 12:23:36,680 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2023-10-27 12:23:36,737 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2023-10-27 12:23:36,779 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:23:36,780 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30
[2023-10-27 12:23:36,808 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:23:36,809 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30
[2023-10-27 12:23:36,824 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:23:36,824 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30
[2023-10-27 12:23:36,858 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:23:36,858 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30
[2023-10-27 12:23:36,877 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:23:36,877 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2023-10-27 12:23:36,906 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:23:36,906 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2023-10-27 12:23:36,945 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-10-27 12:23:36,954 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-10-27 12:23:36,954 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-10-27 12:23:36,954 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [248322893] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:23:36,954 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2023-10-27 12:23:36,954 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 15
[2023-10-27 12:23:36,954 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434552926]
[2023-10-27 12:23:36,955 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:23:36,956 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2023-10-27 12:23:36,956 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:23:36,956 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2023-10-27 12:23:36,956 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272
[2023-10-27 12:23:37,434 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 147 out of 311
[2023-10-27 12:23:37,435 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 1533 transitions, 26648 flow. Second operand  has 11 states, 11 states have (on average 149.9090909090909) internal successors, (1649), 11 states have internal predecessors, (1649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:23:37,435 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:23:37,435 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 311
[2023-10-27 12:23:37,435 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:23:57,650 INFO  L130       PetriNetUnfolder]: 31682/57072 cut-off events.
[2023-10-27 12:23:57,650 INFO  L131       PetriNetUnfolder]: For 803560/803846 co-relation queries the response was YES.
[2023-10-27 12:23:58,074 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 405659 conditions, 57072 events. 31682/57072 cut-off events. For 803560/803846 co-relation queries the response was YES. Maximal size of possible extension queue 1447. Compared 510558 event pairs, 6219 based on Foata normal form. 302/56987 useless extension candidates. Maximal degree in co-relation 405584. Up to 27717 conditions per place. 
[2023-10-27 12:23:58,331 INFO  L137   encePairwiseOnDemand]: 291/311 looper letters, 1390 selfloop transitions, 649 changer transitions 25/2092 dead transitions.
[2023-10-27 12:23:58,336 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 2092 transitions, 38458 flow
[2023-10-27 12:23:58,336 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2023-10-27 12:23:58,336 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 13 states.
[2023-10-27 12:23:58,337 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2209 transitions.
[2023-10-27 12:23:58,338 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5463764531288647
[2023-10-27 12:23:58,338 INFO  L72            ComplementDD]: Start complementDD. Operand 13 states and 2209 transitions.
[2023-10-27 12:23:58,338 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 13 states and 2209 transitions.
[2023-10-27 12:23:58,338 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:23:58,338 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2209 transitions.
[2023-10-27 12:23:58,340 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 14 states, 13 states have (on average 169.92307692307693) internal successors, (2209), 13 states have internal predecessors, (2209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:23:58,342 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 14 states, 14 states have (on average 311.0) internal successors, (4354), 14 states have internal predecessors, (4354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:23:58,343 INFO  L81            ComplementDD]: Finished complementDD. Result  has 14 states, 14 states have (on average 311.0) internal successors, (4354), 14 states have internal predecessors, (4354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:23:58,343 INFO  L175             Difference]: Start difference. First operand has 231 places, 1533 transitions, 26648 flow. Second operand 13 states and 2209 transitions.
[2023-10-27 12:23:58,344 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 2092 transitions, 38458 flow
[2023-10-27 12:24:11,875 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 2092 transitions, 37387 flow, removed 475 selfloop flow, removed 5 redundant places.
[2023-10-27 12:24:11,901 INFO  L231             Difference]: Finished difference. Result has 243 places, 1676 transitions, 30892 flow
[2023-10-27 12:24:11,902 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=311, PETRI_DIFFERENCE_MINUEND_FLOW=25712, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1533, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=520, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=939, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=30892, PETRI_PLACES=243, PETRI_TRANSITIONS=1676}
[2023-10-27 12:24:11,903 INFO  L288   CegarLoopForPetriNet]: 97 programPoint places, 146 predicate places.
[2023-10-27 12:24:11,903 INFO  L495      AbstractCegarLoop]: Abstraction has has 243 places, 1676 transitions, 30892 flow
[2023-10-27 12:24:11,904 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 149.9090909090909) internal successors, (1649), 11 states have internal predecessors, (1649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:24:11,904 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:24:11,904 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:24:11,910 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0
[2023-10-27 12:24:12,108 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31
[2023-10-27 12:24:12,109 INFO  L420      AbstractCegarLoop]: === Iteration 22 === Targeting threadErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2023-10-27 12:24:12,112 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:24:12,113 INFO  L85        PathProgramCache]: Analyzing trace with hash -1555840349, now seen corresponding path program 1 times
[2023-10-27 12:24:12,113 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:24:12,113 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70028032]
[2023-10-27 12:24:12,114 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:24:12,118 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:24:12,167 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:24:12,478 INFO  L134       CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked.
[2023-10-27 12:24:12,479 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:24:12,479 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70028032]
[2023-10-27 12:24:12,479 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70028032] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:24:12,479 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:24:12,479 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-27 12:24:12,479 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026402311]
[2023-10-27 12:24:12,480 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:24:12,480 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-27 12:24:12,480 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:24:12,480 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-27 12:24:12,481 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-27 12:24:12,678 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 155 out of 311
[2023-10-27 12:24:12,678 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 1676 transitions, 30892 flow. Second operand  has 6 states, 6 states have (on average 159.0) internal successors, (954), 6 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:24:12,678 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:24:12,678 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 311
[2023-10-27 12:24:12,678 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:24:38,373 INFO  L130       PetriNetUnfolder]: 37103/67069 cut-off events.
[2023-10-27 12:24:38,373 INFO  L131       PetriNetUnfolder]: For 1170322/1173278 co-relation queries the response was YES.
[2023-10-27 12:24:38,913 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 493386 conditions, 67069 events. 37103/67069 cut-off events. For 1170322/1173278 co-relation queries the response was YES. Maximal size of possible extension queue 1731. Compared 613178 event pairs, 8690 based on Foata normal form. 160/63421 useless extension candidates. Maximal degree in co-relation 493306. Up to 51466 conditions per place. 
[2023-10-27 12:24:39,221 INFO  L137   encePairwiseOnDemand]: 285/311 looper letters, 1381 selfloop transitions, 518 changer transitions 17/1979 dead transitions.
[2023-10-27 12:24:39,221 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 1979 transitions, 38712 flow
[2023-10-27 12:24:39,222 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-27 12:24:39,222 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-27 12:24:39,222 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1168 transitions.
[2023-10-27 12:24:39,223 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6259378349410504
[2023-10-27 12:24:39,223 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 1168 transitions.
[2023-10-27 12:24:39,223 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 1168 transitions.
[2023-10-27 12:24:39,224 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:24:39,224 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1168 transitions.
[2023-10-27 12:24:39,226 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 194.66666666666666) internal successors, (1168), 6 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:24:39,227 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 311.0) internal successors, (2177), 7 states have internal predecessors, (2177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:24:39,227 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 311.0) internal successors, (2177), 7 states have internal predecessors, (2177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:24:39,227 INFO  L175             Difference]: Start difference. First operand has 243 places, 1676 transitions, 30892 flow. Second operand 6 states and 1168 transitions.
[2023-10-27 12:24:39,228 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 1979 transitions, 38712 flow
[2023-10-27 12:24:53,232 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 1979 transitions, 37628 flow, removed 438 selfloop flow, removed 6 redundant places.
[2023-10-27 12:24:53,258 INFO  L231             Difference]: Finished difference. Result has 244 places, 1835 transitions, 34024 flow
[2023-10-27 12:24:53,259 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=311, PETRI_DIFFERENCE_MINUEND_FLOW=29840, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1676, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=396, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=34024, PETRI_PLACES=244, PETRI_TRANSITIONS=1835}
[2023-10-27 12:24:53,260 INFO  L288   CegarLoopForPetriNet]: 97 programPoint places, 147 predicate places.
[2023-10-27 12:24:53,260 INFO  L495      AbstractCegarLoop]: Abstraction has has 244 places, 1835 transitions, 34024 flow
[2023-10-27 12:24:53,260 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 159.0) internal successors, (954), 6 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:24:53,260 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:24:53,260 INFO  L209   CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1]
[2023-10-27 12:24:53,261 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2023-10-27 12:24:53,261 INFO  L420      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2023-10-27 12:24:53,261 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:24:53,261 INFO  L85        PathProgramCache]: Analyzing trace with hash -198904401, now seen corresponding path program 1 times
[2023-10-27 12:24:53,261 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:24:53,261 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458808010]
[2023-10-27 12:24:53,262 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:24:53,262 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:24:53,333 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-27 12:24:53,333 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-10-27 12:24:53,360 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-27 12:24:53,387 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-10-27 12:24:53,388 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-10-27 12:24:53,388 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 22 remaining)
[2023-10-27 12:24:53,388 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (20 of 22 remaining)
[2023-10-27 12:24:53,388 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (19 of 22 remaining)
[2023-10-27 12:24:53,388 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (18 of 22 remaining)
[2023-10-27 12:24:53,389 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (17 of 22 remaining)
[2023-10-27 12:24:53,389 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (16 of 22 remaining)
[2023-10-27 12:24:53,389 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (15 of 22 remaining)
[2023-10-27 12:24:53,389 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (14 of 22 remaining)
[2023-10-27 12:24:53,389 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (13 of 22 remaining)
[2023-10-27 12:24:53,390 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (12 of 22 remaining)
[2023-10-27 12:24:53,390 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (11 of 22 remaining)
[2023-10-27 12:24:53,390 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (10 of 22 remaining)
[2023-10-27 12:24:53,390 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (9 of 22 remaining)
[2023-10-27 12:24:53,390 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (8 of 22 remaining)
[2023-10-27 12:24:53,390 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (7 of 22 remaining)
[2023-10-27 12:24:53,390 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (6 of 22 remaining)
[2023-10-27 12:24:53,391 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (5 of 22 remaining)
[2023-10-27 12:24:53,391 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (4 of 22 remaining)
[2023-10-27 12:24:53,391 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 22 remaining)
[2023-10-27 12:24:53,391 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 22 remaining)
[2023-10-27 12:24:53,391 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (1 of 22 remaining)
[2023-10-27 12:24:53,391 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (0 of 22 remaining)
[2023-10-27 12:24:53,391 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2023-10-27 12:24:53,392 INFO  L445         BasicCegarLoop]: Path program histogram: [5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:24:53,392 WARN  L233   ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-10-27 12:24:53,392 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances.
[2023-10-27 12:24:53,438 INFO  L144    ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions.
[2023-10-27 12:24:53,440 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 226 places, 226 transitions, 482 flow
[2023-10-27 12:24:53,524 INFO  L130       PetriNetUnfolder]: 22/628 cut-off events.
[2023-10-27 12:24:53,524 INFO  L131       PetriNetUnfolder]: For 19/19 co-relation queries the response was YES.
[2023-10-27 12:24:53,528 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 656 conditions, 628 events. 22/628 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1752 event pairs, 1 based on Foata normal form. 0/541 useless extension candidates. Maximal degree in co-relation 394. Up to 16 conditions per place. 
[2023-10-27 12:24:53,528 INFO  L82        GeneralOperation]: Start removeDead. Operand has 226 places, 226 transitions, 482 flow
[2023-10-27 12:24:53,530 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 226 places, 226 transitions, 482 flow
[2023-10-27 12:24:53,530 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-10-27 12:24:53,531 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 226 places, 226 transitions, 482 flow
[2023-10-27 12:24:53,531 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 226 places, 226 transitions, 482 flow
[2023-10-27 12:24:53,531 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 226 places, 226 transitions, 482 flow
[2023-10-27 12:24:53,632 INFO  L130       PetriNetUnfolder]: 22/628 cut-off events.
[2023-10-27 12:24:53,632 INFO  L131       PetriNetUnfolder]: For 19/19 co-relation queries the response was YES.
[2023-10-27 12:24:53,634 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 656 conditions, 628 events. 22/628 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1752 event pairs, 1 based on Foata normal form. 0/541 useless extension candidates. Maximal degree in co-relation 394. Up to 16 conditions per place. 
[2023-10-27 12:24:53,654 INFO  L119        LiptonReduction]: Number of co-enabled transitions 20520
[2023-10-27 12:24:56,986 INFO  L134        LiptonReduction]: Checked pairs total: 136368
[2023-10-27 12:24:56,986 INFO  L136        LiptonReduction]: Total number of compositions: 124
[2023-10-27 12:24:56,987 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-10-27 12:24:56,987 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7c8b142a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-10-27 12:24:56,988 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 26 error locations.
[2023-10-27 12:24:56,988 INFO  L130       PetriNetUnfolder]: 0/1 cut-off events.
[2023-10-27 12:24:56,988 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-27 12:24:56,988 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:24:56,988 INFO  L209   CegarLoopForPetriNet]: trace histogram [1]
[2023-10-27 12:24:56,988 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 23 more)] ===
[2023-10-27 12:24:56,990 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:24:56,990 INFO  L85        PathProgramCache]: Analyzing trace with hash 1244, now seen corresponding path program 1 times
[2023-10-27 12:24:56,990 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:24:56,990 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232219816]
[2023-10-27 12:24:56,990 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:24:56,990 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:24:56,993 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:24:57,006 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:24:57,006 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:24:57,007 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232219816]
[2023-10-27 12:24:57,007 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232219816] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:24:57,007 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:24:57,007 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0
[2023-10-27 12:24:57,007 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966435306]
[2023-10-27 12:24:57,007 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:24:57,007 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-10-27 12:24:57,007 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:24:57,008 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-10-27 12:24:57,008 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-10-27 12:24:57,008 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 216 out of 350
[2023-10-27 12:24:57,009 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 115 transitions, 260 flow. Second operand  has 2 states, 2 states have (on average 216.5) internal successors, (433), 2 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:24:57,009 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:24:57,009 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 350
[2023-10-27 12:24:57,009 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:25:00,769 INFO  L130       PetriNetUnfolder]: 19237/44669 cut-off events.
[2023-10-27 12:25:00,773 INFO  L131       PetriNetUnfolder]: For 901/919 co-relation queries the response was YES.
[2023-10-27 12:25:00,849 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 72676 conditions, 44669 events. 19237/44669 cut-off events. For 901/919 co-relation queries the response was YES. Maximal size of possible extension queue 1374. Compared 490597 event pairs, 19146 based on Foata normal form. 0/39655 useless extension candidates. Maximal degree in co-relation 64156. Up to 27493 conditions per place. 
[2023-10-27 12:25:00,990 INFO  L137   encePairwiseOnDemand]: 349/350 looper letters, 41 selfloop transitions, 0 changer transitions 0/114 dead transitions.
[2023-10-27 12:25:00,990 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 114 transitions, 340 flow
[2023-10-27 12:25:00,990 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-10-27 12:25:00,990 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-10-27 12:25:00,991 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 474 transitions.
[2023-10-27 12:25:00,991 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6771428571428572
[2023-10-27 12:25:00,991 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 474 transitions.
[2023-10-27 12:25:00,991 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 474 transitions.
[2023-10-27 12:25:00,991 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:25:00,992 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 474 transitions.
[2023-10-27 12:25:00,992 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 237.0) internal successors, (474), 2 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:25:00,993 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 350.0) internal successors, (1050), 3 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:25:00,993 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 350.0) internal successors, (1050), 3 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:25:00,993 INFO  L175             Difference]: Start difference. First operand has 119 places, 115 transitions, 260 flow. Second operand 2 states and 474 transitions.
[2023-10-27 12:25:00,993 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 114 transitions, 340 flow
[2023-10-27 12:25:00,995 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 114 transitions, 340 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-27 12:25:00,996 INFO  L231             Difference]: Finished difference. Result has 119 places, 114 transitions, 258 flow
[2023-10-27 12:25:00,997 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=258, PETRI_PLACES=119, PETRI_TRANSITIONS=114}
[2023-10-27 12:25:00,997 INFO  L288   CegarLoopForPetriNet]: 119 programPoint places, 0 predicate places.
[2023-10-27 12:25:00,997 INFO  L495      AbstractCegarLoop]: Abstraction has has 119 places, 114 transitions, 258 flow
[2023-10-27 12:25:00,997 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 216.5) internal successors, (433), 2 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:25:00,997 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:25:00,997 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1]
[2023-10-27 12:25:00,997 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2023-10-27 12:25:00,998 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 23 more)] ===
[2023-10-27 12:25:00,998 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:25:00,998 INFO  L85        PathProgramCache]: Analyzing trace with hash 38203219, now seen corresponding path program 1 times
[2023-10-27 12:25:00,998 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:25:00,998 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749738461]
[2023-10-27 12:25:00,998 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:25:00,998 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:25:01,007 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:25:01,043 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:25:01,043 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:25:01,043 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749738461]
[2023-10-27 12:25:01,043 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749738461] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:25:01,043 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:25:01,043 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-27 12:25:01,044 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518069302]
[2023-10-27 12:25:01,044 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:25:01,044 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-27 12:25:01,044 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:25:01,044 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-27 12:25:01,044 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-27 12:25:01,069 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 197 out of 350
[2023-10-27 12:25:01,069 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 114 transitions, 258 flow. Second operand  has 3 states, 3 states have (on average 198.33333333333334) internal successors, (595), 3 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:25:01,070 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:25:01,070 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 350
[2023-10-27 12:25:01,070 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:25:16,704 INFO  L130       PetriNetUnfolder]: 95842/172334 cut-off events.
[2023-10-27 12:25:16,704 INFO  L131       PetriNetUnfolder]: For 3691/4574 co-relation queries the response was YES.
[2023-10-27 12:25:17,082 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 310255 conditions, 172334 events. 95842/172334 cut-off events. For 3691/4574 co-relation queries the response was YES. Maximal size of possible extension queue 5589. Compared 1857211 event pairs, 39666 based on Foata normal form. 12/152525 useless extension candidates. Maximal degree in co-relation 310249. Up to 72883 conditions per place. 
[2023-10-27 12:25:17,724 INFO  L137   encePairwiseOnDemand]: 331/350 looper letters, 87 selfloop transitions, 14 changer transitions 0/161 dead transitions.
[2023-10-27 12:25:17,724 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 161 transitions, 575 flow
[2023-10-27 12:25:17,725 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-27 12:25:17,725 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-27 12:25:17,726 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 697 transitions.
[2023-10-27 12:25:17,726 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6638095238095238
[2023-10-27 12:25:17,726 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 697 transitions.
[2023-10-27 12:25:17,726 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 697 transitions.
[2023-10-27 12:25:17,726 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:25:17,727 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 697 transitions.
[2023-10-27 12:25:17,727 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 232.33333333333334) internal successors, (697), 3 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:25:17,728 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 350.0) internal successors, (1400), 4 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:25:17,728 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 350.0) internal successors, (1400), 4 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:25:17,728 INFO  L175             Difference]: Start difference. First operand has 119 places, 114 transitions, 258 flow. Second operand 3 states and 697 transitions.
[2023-10-27 12:25:17,729 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 161 transitions, 575 flow
[2023-10-27 12:25:17,734 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 161 transitions, 575 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-27 12:25:17,735 INFO  L231             Difference]: Finished difference. Result has 123 places, 128 transitions, 380 flow
[2023-10-27 12:25:17,735 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=380, PETRI_PLACES=123, PETRI_TRANSITIONS=128}
[2023-10-27 12:25:17,736 INFO  L288   CegarLoopForPetriNet]: 119 programPoint places, 4 predicate places.
[2023-10-27 12:25:17,736 INFO  L495      AbstractCegarLoop]: Abstraction has has 123 places, 128 transitions, 380 flow
[2023-10-27 12:25:17,736 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 198.33333333333334) internal successors, (595), 3 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:25:17,736 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:25:17,736 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:25:17,736 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2023-10-27 12:25:17,736 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 23 more)] ===
[2023-10-27 12:25:17,737 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:25:17,737 INFO  L85        PathProgramCache]: Analyzing trace with hash 1831305046, now seen corresponding path program 1 times
[2023-10-27 12:25:17,737 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:25:17,737 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758268787]
[2023-10-27 12:25:17,737 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:25:17,738 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:25:17,745 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:25:17,921 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:25:17,922 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:25:17,922 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758268787]
[2023-10-27 12:25:17,922 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758268787] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:25:17,922 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:25:17,922 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-27 12:25:17,922 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708695786]
[2023-10-27 12:25:17,922 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:25:17,924 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-27 12:25:17,924 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:25:17,924 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-27 12:25:17,924 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-27 12:25:18,073 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 183 out of 350
[2023-10-27 12:25:18,073 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 128 transitions, 380 flow. Second operand  has 6 states, 6 states have (on average 184.33333333333334) internal successors, (1106), 6 states have internal predecessors, (1106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:25:18,074 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:25:18,074 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 350
[2023-10-27 12:25:18,074 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:25:52,412 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1091] L1043-2-->L1043-4: Formula: (= (ite (or (= v_~threads_mask~0_54 0) (= v_~shiftLeft_151 v_~threads_mask~0_54)) v_~shiftLeft_152 (ite (= v_~shiftLeft_153 0) v_~threads_mask~0_54 v_~bitwiseOr_51)) v_~threads_mask~0_53)  InVars {~threads_mask~0=v_~threads_mask~0_54}  OutVars{~threads_mask~0=v_~threads_mask~0_53, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_13|}  AuxVars[v_~bitwiseOr_51, v_~shiftLeft_152, v_~shiftLeft_151, v_~shiftLeft_153]  AssignedVars[~threads_mask~0, threadThread3of3ForFork0_#t~nondet4][267], [threadThread2of3ForFork0InUse, 34#L1043-4true, threadThread3of3ForFork0InUse, 32#L1059-5true, 241#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 229#true, 19#L1043-1true, 234#(= |#race~threads_mask~0| 0), Black: 232#true, 52#L1045-6true, threadThread1of3ForFork0InUse])
[2023-10-27 12:25:52,413 INFO  L383   tUnfolder$Statistics]: this new event has 87 ancestors and is cut-off event
[2023-10-27 12:25:52,413 INFO  L386   tUnfolder$Statistics]:   existing Event has 87 ancestors and is cut-off event
[2023-10-27 12:25:52,413 INFO  L386   tUnfolder$Statistics]:   existing Event has 87 ancestors and is cut-off event
[2023-10-27 12:25:52,413 INFO  L386   tUnfolder$Statistics]:   existing Event has 87 ancestors and is cut-off event
[2023-10-27 12:25:52,420 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1091] L1043-2-->L1043-4: Formula: (= (ite (or (= v_~threads_mask~0_54 0) (= v_~shiftLeft_151 v_~threads_mask~0_54)) v_~shiftLeft_152 (ite (= v_~shiftLeft_153 0) v_~threads_mask~0_54 v_~bitwiseOr_51)) v_~threads_mask~0_53)  InVars {~threads_mask~0=v_~threads_mask~0_54}  OutVars{~threads_mask~0=v_~threads_mask~0_53, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_13|}  AuxVars[v_~bitwiseOr_51, v_~shiftLeft_152, v_~shiftLeft_151, v_~shiftLeft_153]  AssignedVars[~threads_mask~0, threadThread3of3ForFork0_#t~nondet4][267], [115#L1043-1true, threadThread2of3ForFork0InUse, 34#L1043-4true, threadThread3of3ForFork0InUse, 32#L1059-5true, 241#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 229#true, 79#L1045-6true, 234#(= |#race~threads_mask~0| 0), Black: 232#true, threadThread1of3ForFork0InUse])
[2023-10-27 12:25:52,420 INFO  L383   tUnfolder$Statistics]: this new event has 87 ancestors and is cut-off event
[2023-10-27 12:25:52,420 INFO  L386   tUnfolder$Statistics]:   existing Event has 87 ancestors and is cut-off event
[2023-10-27 12:25:52,420 INFO  L386   tUnfolder$Statistics]:   existing Event has 87 ancestors and is cut-off event
[2023-10-27 12:25:52,421 INFO  L386   tUnfolder$Statistics]:   existing Event has 87 ancestors and is cut-off event
[2023-10-27 12:25:54,440 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1091] L1043-2-->L1043-4: Formula: (= (ite (or (= v_~threads_mask~0_54 0) (= v_~shiftLeft_151 v_~threads_mask~0_54)) v_~shiftLeft_152 (ite (= v_~shiftLeft_153 0) v_~threads_mask~0_54 v_~bitwiseOr_51)) v_~threads_mask~0_53)  InVars {~threads_mask~0=v_~threads_mask~0_54}  OutVars{~threads_mask~0=v_~threads_mask~0_53, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_13|}  AuxVars[v_~bitwiseOr_51, v_~shiftLeft_152, v_~shiftLeft_151, v_~shiftLeft_153]  AssignedVars[~threads_mask~0, threadThread3of3ForFork0_#t~nondet4][267], [34#L1043-4true, threadThread2of3ForFork0InUse, threadThread3of3ForFork0InUse, 241#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 32#L1059-5true, 229#true, 7#L1045-7true, 234#(= |#race~threads_mask~0| 0), 19#L1043-1true, Black: 232#true, threadThread1of3ForFork0InUse])
[2023-10-27 12:25:54,440 INFO  L383   tUnfolder$Statistics]: this new event has 88 ancestors and is cut-off event
[2023-10-27 12:25:54,440 INFO  L386   tUnfolder$Statistics]:   existing Event has 88 ancestors and is cut-off event
[2023-10-27 12:25:54,440 INFO  L386   tUnfolder$Statistics]:   existing Event has 88 ancestors and is cut-off event
[2023-10-27 12:25:54,440 INFO  L386   tUnfolder$Statistics]:   existing Event has 88 ancestors and is cut-off event
[2023-10-27 12:25:54,448 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1091] L1043-2-->L1043-4: Formula: (= (ite (or (= v_~threads_mask~0_54 0) (= v_~shiftLeft_151 v_~threads_mask~0_54)) v_~shiftLeft_152 (ite (= v_~shiftLeft_153 0) v_~threads_mask~0_54 v_~bitwiseOr_51)) v_~threads_mask~0_53)  InVars {~threads_mask~0=v_~threads_mask~0_54}  OutVars{~threads_mask~0=v_~threads_mask~0_53, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_13|}  AuxVars[v_~bitwiseOr_51, v_~shiftLeft_152, v_~shiftLeft_151, v_~shiftLeft_153]  AssignedVars[~threads_mask~0, threadThread3of3ForFork0_#t~nondet4][267], [115#L1043-1true, threadThread2of3ForFork0InUse, 34#L1043-4true, threadThread3of3ForFork0InUse, 241#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 32#L1059-5true, 229#true, 48#L1045-7true, 234#(= |#race~threads_mask~0| 0), Black: 232#true, threadThread1of3ForFork0InUse])
[2023-10-27 12:25:54,448 INFO  L383   tUnfolder$Statistics]: this new event has 88 ancestors and is cut-off event
[2023-10-27 12:25:54,448 INFO  L386   tUnfolder$Statistics]:   existing Event has 88 ancestors and is cut-off event
[2023-10-27 12:25:54,448 INFO  L386   tUnfolder$Statistics]:   existing Event has 88 ancestors and is cut-off event
[2023-10-27 12:25:54,448 INFO  L386   tUnfolder$Statistics]:   existing Event has 88 ancestors and is cut-off event
[2023-10-27 12:25:54,856 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1143] L1043-6-->L1045: Formula: (= |v_#pthreadsMutex_77| (store |v_#pthreadsMutex_78| |v_~#threads_mask_mutex~0.base_97| (store (select |v_#pthreadsMutex_78| |v_~#threads_mask_mutex~0.base_97|) |v_~#threads_mask_mutex~0.offset_97| 0)))  InVars {#pthreadsMutex=|v_#pthreadsMutex_78|, ~#threads_mask_mutex~0.base=|v_~#threads_mask_mutex~0.base_97|, ~#threads_mask_mutex~0.offset=|v_~#threads_mask_mutex~0.offset_97|}  OutVars{#pthreadsMutex=|v_#pthreadsMutex_77|, ~#threads_mask_mutex~0.base=|v_~#threads_mask_mutex~0.base_97|, threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_15|, ~#threads_mask_mutex~0.offset=|v_~#threads_mask_mutex~0.offset_97|}  AuxVars[]  AssignedVars[#pthreadsMutex, threadThread1of3ForFork0_#t~nondet4][98], [136#L1045true, threadThread2of3ForFork0InUse, threadThread3of3ForFork0InUse, 99#ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACEtrue, 15#L1045-8true, 2#L1043-2true, 229#true, 238#true, Black: 234#(= |#race~threads_mask~0| 0), 232#true, threadThread1of3ForFork0InUse])
[2023-10-27 12:25:54,856 INFO  L383   tUnfolder$Statistics]: this new event has 88 ancestors and is cut-off event
[2023-10-27 12:25:54,856 INFO  L386   tUnfolder$Statistics]:   existing Event has 88 ancestors and is cut-off event
[2023-10-27 12:25:54,856 INFO  L386   tUnfolder$Statistics]:   existing Event has 88 ancestors and is cut-off event
[2023-10-27 12:25:54,856 INFO  L386   tUnfolder$Statistics]:   existing Event has 88 ancestors and is cut-off event
[2023-10-27 12:25:54,961 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1143] L1043-6-->L1045: Formula: (= |v_#pthreadsMutex_77| (store |v_#pthreadsMutex_78| |v_~#threads_mask_mutex~0.base_97| (store (select |v_#pthreadsMutex_78| |v_~#threads_mask_mutex~0.base_97|) |v_~#threads_mask_mutex~0.offset_97| 0)))  InVars {#pthreadsMutex=|v_#pthreadsMutex_78|, ~#threads_mask_mutex~0.base=|v_~#threads_mask_mutex~0.base_97|, ~#threads_mask_mutex~0.offset=|v_~#threads_mask_mutex~0.offset_97|}  OutVars{#pthreadsMutex=|v_#pthreadsMutex_77|, ~#threads_mask_mutex~0.base=|v_~#threads_mask_mutex~0.base_97|, threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_15|, ~#threads_mask_mutex~0.offset=|v_~#threads_mask_mutex~0.offset_97|}  AuxVars[]  AssignedVars[#pthreadsMutex, threadThread1of3ForFork0_#t~nondet4][98], [136#L1045true, threadThread2of3ForFork0InUse, threadThread3of3ForFork0InUse, 15#L1045-8true, 2#L1043-2true, 229#true, 238#true, 108#ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACEtrue, Black: 234#(= |#race~threads_mask~0| 0), 232#true, threadThread1of3ForFork0InUse])
[2023-10-27 12:25:54,962 INFO  L383   tUnfolder$Statistics]: this new event has 88 ancestors and is cut-off event
[2023-10-27 12:25:54,962 INFO  L386   tUnfolder$Statistics]:   existing Event has 88 ancestors and is cut-off event
[2023-10-27 12:25:54,962 INFO  L386   tUnfolder$Statistics]:   existing Event has 88 ancestors and is cut-off event
[2023-10-27 12:25:54,962 INFO  L386   tUnfolder$Statistics]:   existing Event has 88 ancestors and is cut-off event
[2023-10-27 12:25:55,802 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1091] L1043-2-->L1043-4: Formula: (= (ite (or (= v_~threads_mask~0_54 0) (= v_~shiftLeft_151 v_~threads_mask~0_54)) v_~shiftLeft_152 (ite (= v_~shiftLeft_153 0) v_~threads_mask~0_54 v_~bitwiseOr_51)) v_~threads_mask~0_53)  InVars {~threads_mask~0=v_~threads_mask~0_54}  OutVars{~threads_mask~0=v_~threads_mask~0_53, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_13|}  AuxVars[v_~bitwiseOr_51, v_~shiftLeft_152, v_~shiftLeft_151, v_~shiftLeft_153]  AssignedVars[~threads_mask~0, threadThread3of3ForFork0_#t~nondet4][275], [threadThread2of3ForFork0InUse, 34#L1043-4true, threadThread3of3ForFork0InUse, 140#L1059-6true, 229#true, 242#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 19#L1043-1true, 234#(= |#race~threads_mask~0| 0), Black: 232#true, 52#L1045-6true, threadThread1of3ForFork0InUse])
[2023-10-27 12:25:55,803 INFO  L383   tUnfolder$Statistics]: this new event has 88 ancestors and is cut-off event
[2023-10-27 12:25:55,803 INFO  L386   tUnfolder$Statistics]:   existing Event has 88 ancestors and is cut-off event
[2023-10-27 12:25:55,803 INFO  L386   tUnfolder$Statistics]:   existing Event has 88 ancestors and is cut-off event
[2023-10-27 12:25:55,803 INFO  L386   tUnfolder$Statistics]:   existing Event has 88 ancestors and is cut-off event
[2023-10-27 12:25:55,810 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1091] L1043-2-->L1043-4: Formula: (= (ite (or (= v_~threads_mask~0_54 0) (= v_~shiftLeft_151 v_~threads_mask~0_54)) v_~shiftLeft_152 (ite (= v_~shiftLeft_153 0) v_~threads_mask~0_54 v_~bitwiseOr_51)) v_~threads_mask~0_53)  InVars {~threads_mask~0=v_~threads_mask~0_54}  OutVars{~threads_mask~0=v_~threads_mask~0_53, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_13|}  AuxVars[v_~bitwiseOr_51, v_~shiftLeft_152, v_~shiftLeft_151, v_~shiftLeft_153]  AssignedVars[~threads_mask~0, threadThread3of3ForFork0_#t~nondet4][275], [115#L1043-1true, 34#L1043-4true, threadThread2of3ForFork0InUse, 140#L1059-6true, threadThread3of3ForFork0InUse, 229#true, 79#L1045-6true, 242#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 234#(= |#race~threads_mask~0| 0), Black: 232#true, threadThread1of3ForFork0InUse])
[2023-10-27 12:25:55,810 INFO  L383   tUnfolder$Statistics]: this new event has 88 ancestors and is cut-off event
[2023-10-27 12:25:55,810 INFO  L386   tUnfolder$Statistics]:   existing Event has 88 ancestors and is cut-off event
[2023-10-27 12:25:55,811 INFO  L386   tUnfolder$Statistics]:   existing Event has 88 ancestors and is cut-off event
[2023-10-27 12:25:55,811 INFO  L386   tUnfolder$Statistics]:   existing Event has 88 ancestors and is cut-off event
[2023-10-27 12:25:57,093 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1091] L1043-2-->L1043-4: Formula: (= (ite (or (= v_~threads_mask~0_54 0) (= v_~shiftLeft_151 v_~threads_mask~0_54)) v_~shiftLeft_152 (ite (= v_~shiftLeft_153 0) v_~threads_mask~0_54 v_~bitwiseOr_51)) v_~threads_mask~0_53)  InVars {~threads_mask~0=v_~threads_mask~0_54}  OutVars{~threads_mask~0=v_~threads_mask~0_53, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_13|}  AuxVars[v_~bitwiseOr_51, v_~shiftLeft_152, v_~shiftLeft_151, v_~shiftLeft_153]  AssignedVars[~threads_mask~0, threadThread3of3ForFork0_#t~nondet4][275], [threadThread2of3ForFork0InUse, 34#L1043-4true, 140#L1059-6true, threadThread3of3ForFork0InUse, 229#true, 7#L1045-7true, 242#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 234#(= |#race~threads_mask~0| 0), 19#L1043-1true, Black: 232#true, threadThread1of3ForFork0InUse])
[2023-10-27 12:25:57,093 INFO  L383   tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event
[2023-10-27 12:25:57,093 INFO  L386   tUnfolder$Statistics]:   existing Event has 89 ancestors and is cut-off event
[2023-10-27 12:25:57,093 INFO  L386   tUnfolder$Statistics]:   existing Event has 89 ancestors and is cut-off event
[2023-10-27 12:25:57,093 INFO  L386   tUnfolder$Statistics]:   existing Event has 89 ancestors and is cut-off event
[2023-10-27 12:25:57,101 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1091] L1043-2-->L1043-4: Formula: (= (ite (or (= v_~threads_mask~0_54 0) (= v_~shiftLeft_151 v_~threads_mask~0_54)) v_~shiftLeft_152 (ite (= v_~shiftLeft_153 0) v_~threads_mask~0_54 v_~bitwiseOr_51)) v_~threads_mask~0_53)  InVars {~threads_mask~0=v_~threads_mask~0_54}  OutVars{~threads_mask~0=v_~threads_mask~0_53, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_13|}  AuxVars[v_~bitwiseOr_51, v_~shiftLeft_152, v_~shiftLeft_151, v_~shiftLeft_153]  AssignedVars[~threads_mask~0, threadThread3of3ForFork0_#t~nondet4][275], [115#L1043-1true, threadThread2of3ForFork0InUse, 34#L1043-4true, 140#L1059-6true, threadThread3of3ForFork0InUse, 229#true, 242#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 48#L1045-7true, 234#(= |#race~threads_mask~0| 0), Black: 232#true, threadThread1of3ForFork0InUse])
[2023-10-27 12:25:57,101 INFO  L383   tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event
[2023-10-27 12:25:57,101 INFO  L386   tUnfolder$Statistics]:   existing Event has 89 ancestors and is cut-off event
[2023-10-27 12:25:57,101 INFO  L386   tUnfolder$Statistics]:   existing Event has 89 ancestors and is cut-off event
[2023-10-27 12:25:57,101 INFO  L386   tUnfolder$Statistics]:   existing Event has 89 ancestors and is cut-off event
[2023-10-27 12:25:57,119 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1091] L1043-2-->L1043-4: Formula: (= (ite (or (= v_~threads_mask~0_54 0) (= v_~shiftLeft_151 v_~threads_mask~0_54)) v_~shiftLeft_152 (ite (= v_~shiftLeft_153 0) v_~threads_mask~0_54 v_~bitwiseOr_51)) v_~threads_mask~0_53)  InVars {~threads_mask~0=v_~threads_mask~0_54}  OutVars{~threads_mask~0=v_~threads_mask~0_53, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_13|}  AuxVars[v_~bitwiseOr_51, v_~shiftLeft_152, v_~shiftLeft_151, v_~shiftLeft_153]  AssignedVars[~threads_mask~0, threadThread3of3ForFork0_#t~nondet4][267], [115#L1043-1true, 34#L1043-4true, threadThread2of3ForFork0InUse, threadThread3of3ForFork0InUse, 15#L1045-8true, 241#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 32#L1059-5true, 229#true, 234#(= |#race~threads_mask~0| 0), Black: 232#true, threadThread1of3ForFork0InUse])
[2023-10-27 12:25:57,119 INFO  L383   tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event
[2023-10-27 12:25:57,119 INFO  L386   tUnfolder$Statistics]:   existing Event has 89 ancestors and is cut-off event
[2023-10-27 12:25:57,119 INFO  L386   tUnfolder$Statistics]:   existing Event has 89 ancestors and is cut-off event
[2023-10-27 12:25:57,120 INFO  L386   tUnfolder$Statistics]:   existing Event has 89 ancestors and is cut-off event
[2023-10-27 12:25:58,526 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1148] L1043-3-->L1043-5: Formula: (= |v_#race~threads_mask~0_53| |v_threadThread2of3ForFork0_#t~nondet4_17|)  InVars {}  OutVars{#race~threads_mask~0=|v_#race~threads_mask~0_53|, threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_17|}  AuxVars[]  AssignedVars[#race~threads_mask~0, threadThread2of3ForFork0_#t~nondet4][197], [threadThread2of3ForFork0InUse, threadThread3of3ForFork0InUse, 2#L1043-2true, 241#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 32#L1059-5true, 229#true, 14#L1043-5true, Black: 234#(= |#race~threads_mask~0| 0), 52#L1045-6true, threadThread1of3ForFork0InUse, 232#true])
[2023-10-27 12:25:58,527 INFO  L383   tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event
[2023-10-27 12:25:58,527 INFO  L386   tUnfolder$Statistics]:   existing Event has 89 ancestors and is cut-off event
[2023-10-27 12:25:58,527 INFO  L386   tUnfolder$Statistics]:   existing Event has 89 ancestors and is cut-off event
[2023-10-27 12:25:58,527 INFO  L386   tUnfolder$Statistics]:   existing Event has 89 ancestors and is cut-off event
[2023-10-27 12:26:00,469 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1091] L1043-2-->L1043-4: Formula: (= (ite (or (= v_~threads_mask~0_54 0) (= v_~shiftLeft_151 v_~threads_mask~0_54)) v_~shiftLeft_152 (ite (= v_~shiftLeft_153 0) v_~threads_mask~0_54 v_~bitwiseOr_51)) v_~threads_mask~0_53)  InVars {~threads_mask~0=v_~threads_mask~0_54}  OutVars{~threads_mask~0=v_~threads_mask~0_53, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_13|}  AuxVars[v_~bitwiseOr_51, v_~shiftLeft_152, v_~shiftLeft_151, v_~shiftLeft_153]  AssignedVars[~threads_mask~0, threadThread3of3ForFork0_#t~nondet4][275], [34#L1043-4true, 115#L1043-1true, threadThread2of3ForFork0InUse, threadThread3of3ForFork0InUse, 140#L1059-6true, 15#L1045-8true, 229#true, 242#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 234#(= |#race~threads_mask~0| 0), Black: 232#true, threadThread1of3ForFork0InUse])
[2023-10-27 12:26:00,469 INFO  L383   tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event
[2023-10-27 12:26:00,470 INFO  L386   tUnfolder$Statistics]:   existing Event has 90 ancestors and is cut-off event
[2023-10-27 12:26:00,470 INFO  L386   tUnfolder$Statistics]:   existing Event has 90 ancestors and is cut-off event
[2023-10-27 12:26:00,470 INFO  L386   tUnfolder$Statistics]:   existing Event has 90 ancestors and is cut-off event
[2023-10-27 12:26:00,478 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1148] L1043-3-->L1043-5: Formula: (= |v_#race~threads_mask~0_53| |v_threadThread2of3ForFork0_#t~nondet4_17|)  InVars {}  OutVars{#race~threads_mask~0=|v_#race~threads_mask~0_53|, threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_17|}  AuxVars[]  AssignedVars[#race~threads_mask~0, threadThread2of3ForFork0_#t~nondet4][197], [threadThread2of3ForFork0InUse, threadThread3of3ForFork0InUse, 2#L1043-2true, 241#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 32#L1059-5true, 229#true, 14#L1043-5true, 7#L1045-7true, Black: 234#(= |#race~threads_mask~0| 0), 232#true, threadThread1of3ForFork0InUse])
[2023-10-27 12:26:00,478 INFO  L383   tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event
[2023-10-27 12:26:00,478 INFO  L386   tUnfolder$Statistics]:   existing Event has 90 ancestors and is cut-off event
[2023-10-27 12:26:00,479 INFO  L386   tUnfolder$Statistics]:   existing Event has 90 ancestors and is cut-off event
[2023-10-27 12:26:00,479 INFO  L386   tUnfolder$Statistics]:   existing Event has 90 ancestors and is cut-off event
[2023-10-27 12:26:00,488 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1091] L1043-2-->L1043-4: Formula: (= (ite (or (= v_~threads_mask~0_54 0) (= v_~shiftLeft_151 v_~threads_mask~0_54)) v_~shiftLeft_152 (ite (= v_~shiftLeft_153 0) v_~threads_mask~0_54 v_~bitwiseOr_51)) v_~threads_mask~0_53)  InVars {~threads_mask~0=v_~threads_mask~0_54}  OutVars{~threads_mask~0=v_~threads_mask~0_53, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_13|}  AuxVars[v_~bitwiseOr_51, v_~shiftLeft_152, v_~shiftLeft_151, v_~shiftLeft_153]  AssignedVars[~threads_mask~0, threadThread3of3ForFork0_#t~nondet4][267], [115#L1043-1true, threadThread2of3ForFork0InUse, 34#L1043-4true, threadThread3of3ForFork0InUse, 32#L1059-5true, 241#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 229#true, 137#L1045-9true, 234#(= |#race~threads_mask~0| 0), Black: 232#true, threadThread1of3ForFork0InUse])
[2023-10-27 12:26:00,488 INFO  L383   tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event
[2023-10-27 12:26:00,488 INFO  L386   tUnfolder$Statistics]:   existing Event has 90 ancestors and is cut-off event
[2023-10-27 12:26:00,488 INFO  L386   tUnfolder$Statistics]:   existing Event has 90 ancestors and is cut-off event
[2023-10-27 12:26:00,488 INFO  L386   tUnfolder$Statistics]:   existing Event has 90 ancestors and is cut-off event
[2023-10-27 12:26:00,492 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1091] L1043-2-->L1043-4: Formula: (= (ite (or (= v_~threads_mask~0_54 0) (= v_~shiftLeft_151 v_~threads_mask~0_54)) v_~shiftLeft_152 (ite (= v_~shiftLeft_153 0) v_~threads_mask~0_54 v_~bitwiseOr_51)) v_~threads_mask~0_53)  InVars {~threads_mask~0=v_~threads_mask~0_54}  OutVars{~threads_mask~0=v_~threads_mask~0_53, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_13|}  AuxVars[v_~bitwiseOr_51, v_~shiftLeft_152, v_~shiftLeft_151, v_~shiftLeft_153]  AssignedVars[~threads_mask~0, threadThread3of3ForFork0_#t~nondet4][263], [34#L1043-4true, 115#L1043-1true, threadThread2of3ForFork0InUse, threadThread3of3ForFork0InUse, 240#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 229#true, 234#(= |#race~threads_mask~0| 0), Black: 232#true, 89#L1059-4true, 178#threadEXITtrue, threadThread1of3ForFork0InUse])
[2023-10-27 12:26:00,492 INFO  L383   tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event
[2023-10-27 12:26:00,492 INFO  L386   tUnfolder$Statistics]:   existing Event has 90 ancestors and is cut-off event
[2023-10-27 12:26:00,492 INFO  L386   tUnfolder$Statistics]:   existing Event has 90 ancestors and is cut-off event
[2023-10-27 12:26:00,493 INFO  L386   tUnfolder$Statistics]:   existing Event has 90 ancestors and is cut-off event
[2023-10-27 12:26:01,250 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1148] L1043-3-->L1043-5: Formula: (= |v_#race~threads_mask~0_53| |v_threadThread2of3ForFork0_#t~nondet4_17|)  InVars {}  OutVars{#race~threads_mask~0=|v_#race~threads_mask~0_53|, threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_17|}  AuxVars[]  AssignedVars[#race~threads_mask~0, threadThread2of3ForFork0_#t~nondet4][204], [threadThread2of3ForFork0InUse, threadThread3of3ForFork0InUse, 140#L1059-6true, 2#L1043-2true, 229#true, 14#L1043-5true, 242#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 234#(= |#race~threads_mask~0| 0), 52#L1045-6true, 232#true, threadThread1of3ForFork0InUse])
[2023-10-27 12:26:01,250 INFO  L383   tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event
[2023-10-27 12:26:01,250 INFO  L386   tUnfolder$Statistics]:   existing Event has 90 ancestors and is cut-off event
[2023-10-27 12:26:01,250 INFO  L386   tUnfolder$Statistics]:   existing Event has 90 ancestors and is cut-off event
[2023-10-27 12:26:01,250 INFO  L386   tUnfolder$Statistics]:   existing Event has 90 ancestors and is cut-off event
