./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 0e0057cc
Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data -tc /mnt/goblint-svcomp/benchexec/tools-pldi24/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-pldi24/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux --witnessprinter.witness.filename witness --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 4785f5a59ba5c7afc31ee3141f5fbd6c83d542519041c1c4b32446688f895d81
--- Real Ultimate output ---
This is Ultimate 0.2.4-dev-0e0057c
[2024-03-12 00:30:14,684 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-03-12 00:30:14,722 INFO  L114        SettingsManager]: Loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2024-03-12 00:30:14,725 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-03-12 00:30:14,725 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-03-12 00:30:14,739 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-03-12 00:30:14,740 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-03-12 00:30:14,740 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-03-12 00:30:14,740 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-03-12 00:30:14,741 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-03-12 00:30:14,741 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-03-12 00:30:14,741 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-03-12 00:30:14,742 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-03-12 00:30:14,742 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-03-12 00:30:14,742 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-03-12 00:30:14,742 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-03-12 00:30:14,743 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-03-12 00:30:14,743 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-03-12 00:30:14,743 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-03-12 00:30:14,743 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-03-12 00:30:14,744 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-03-12 00:30:14,744 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-03-12 00:30:14,744 INFO  L153        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2024-03-12 00:30:14,744 INFO  L153        SettingsManager]:  * Check unreachability of reach_error function=false
[2024-03-12 00:30:14,745 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-03-12 00:30:14,745 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-03-12 00:30:14,745 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-03-12 00:30:14,745 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-03-12 00:30:14,746 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-03-12 00:30:14,746 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-03-12 00:30:14,746 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-03-12 00:30:14,746 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-03-12 00:30:14,747 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-03-12 00:30:14,747 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-03-12 00:30:14,747 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-03-12 00:30:14,747 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-03-12 00:30:14,747 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-03-12 00:30:14,747 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-03-12 00:30:14,748 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-03-12 00:30:14,748 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-03-12 00:30:14,748 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-03-12 00:30:14,748 INFO  L153        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-pldi24/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-pldi24/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
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 -> 4785f5a59ba5c7afc31ee3141f5fbd6c83d542519041c1c4b32446688f895d81
[2024-03-12 00:30:14,917 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-03-12 00:30:14,935 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-03-12 00:30:14,937 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-03-12 00:30:14,938 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-03-12 00:30:14,938 INFO  L274        PluginConnector]: CDTParser initialized
[2024-03-12 00:30:14,939 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-index-bitmask-race-2.i
[2024-03-12 00:30:15,944 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-03-12 00:30:16,157 INFO  L384              CDTParser]: Found 1 translation units.
[2024-03-12 00:30:16,157 INFO  L180              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-index-bitmask-race-2.i
[2024-03-12 00:30:16,169 INFO  L427              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data/a4a72f447/a4bf081ae1b94843822458bb71e326d7/FLAGa87f2b40f
[2024-03-12 00:30:16,180 INFO  L435              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data/a4a72f447/a4bf081ae1b94843822458bb71e326d7
[2024-03-12 00:30:16,183 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-03-12 00:30:16,184 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-03-12 00:30:16,184 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-03-12 00:30:16,184 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-03-12 00:30:16,188 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-03-12 00:30:16,189 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.03 12:30:16" (1/1) ...
[2024-03-12 00:30:16,190 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a7c96ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 12:30:16, skipping insertion in model container
[2024-03-12 00:30:16,190 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.03 12:30:16" (1/1) ...
[2024-03-12 00:30:16,233 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-03-12 00:30:16,483 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2024-03-12 00:30:16,493 INFO  L202         MainTranslator]: Completed pre-run
[2024-03-12 00:30:16,528 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2024-03-12 00:30:16,562 WARN  L675               CHandler]: The function ffs is called, but not defined or handled by StandardFunctionHandler.
[2024-03-12 00:30:16,568 INFO  L206         MainTranslator]: Completed translation
[2024-03-12 00:30:16,568 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 12:30:16 WrapperNode
[2024-03-12 00:30:16,568 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-03-12 00:30:16,569 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-03-12 00:30:16,569 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-03-12 00:30:16,569 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-03-12 00:30:16,574 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 12:30:16" (1/1) ...
[2024-03-12 00:30:16,590 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 12:30:16" (1/1) ...
[2024-03-12 00:30:16,609 INFO  L138                Inliner]: procedures = 281, calls = 30, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 132
[2024-03-12 00:30:16,609 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-03-12 00:30:16,609 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-03-12 00:30:16,610 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-03-12 00:30:16,610 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-03-12 00:30:16,617 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 12:30:16" (1/1) ...
[2024-03-12 00:30:16,617 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 12:30:16" (1/1) ...
[2024-03-12 00:30:16,620 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 12:30:16" (1/1) ...
[2024-03-12 00:30:16,620 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 12:30:16" (1/1) ...
[2024-03-12 00:30:16,627 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 12:30:16" (1/1) ...
[2024-03-12 00:30:16,630 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 12:30:16" (1/1) ...
[2024-03-12 00:30:16,631 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 12:30:16" (1/1) ...
[2024-03-12 00:30:16,632 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 12:30:16" (1/1) ...
[2024-03-12 00:30:16,635 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-03-12 00:30:16,635 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-03-12 00:30:16,635 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-03-12 00:30:16,635 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-03-12 00:30:16,636 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 12:30:16" (1/1) ...
[2024-03-12 00:30:16,640 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-03-12 00:30:16,648 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 00:30:16,658 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-03-12 00:30:16,661 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-03-12 00:30:16,691 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2024-03-12 00:30:16,691 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2024-03-12 00:30:16,691 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-03-12 00:30:16,691 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2024-03-12 00:30:16,691 INFO  L130     BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock
[2024-03-12 00:30:16,692 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2024-03-12 00:30:16,692 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2024-03-12 00:30:16,692 INFO  L130     BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock
[2024-03-12 00:30:16,692 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2024-03-12 00:30:16,692 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-03-12 00:30:16,692 INFO  L130     BoogieDeclarations]: Found specification of procedure ffs
[2024-03-12 00:30:16,693 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2024-03-12 00:30:16,693 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2024-03-12 00:30:16,693 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2024-03-12 00:30:16,693 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-03-12 00:30:16,693 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-03-12 00:30:16,695 WARN  L213             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-03-12 00:30:16,827 INFO  L241             CfgBuilder]: Building ICFG
[2024-03-12 00:30:16,829 INFO  L267             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-03-12 00:30:17,098 INFO  L282             CfgBuilder]: Performing block encoding
[2024-03-12 00:30:17,114 INFO  L304             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-03-12 00:30:17,114 INFO  L309             CfgBuilder]: Removed 2 assume(true) statements.
[2024-03-12 00:30:17,116 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.03 12:30:17 BoogieIcfgContainer
[2024-03-12 00:30:17,116 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-03-12 00:30:17,118 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-03-12 00:30:17,118 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-03-12 00:30:17,120 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-03-12 00:30:17,120 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.03 12:30:16" (1/3) ...
[2024-03-12 00:30:17,121 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41b802d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.03 12:30:17, skipping insertion in model container
[2024-03-12 00:30:17,121 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 12:30:16" (2/3) ...
[2024-03-12 00:30:17,121 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41b802d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.03 12:30:17, skipping insertion in model container
[2024-03-12 00:30:17,121 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.03 12:30:17" (3/3) ...
[2024-03-12 00:30:17,122 INFO  L112   eAbstractionObserver]: Analyzing ICFG per-thread-index-bitmask-race-2.i
[2024-03-12 00:30:17,128 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2024-03-12 00:30:17,135 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-03-12 00:30:17,135 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations.
[2024-03-12 00:30:17,136 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-03-12 00:30:17,184 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2024-03-12 00:30:17,210 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 190 places, 198 transitions, 403 flow
[2024-03-12 00:30:17,277 INFO  L124   PetriNetUnfolderBase]: 16/287 cut-off events.
[2024-03-12 00:30:17,277 INFO  L125   PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES.
[2024-03-12 00:30:17,282 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 292 conditions, 287 events. 16/287 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 617 event pairs, 0 based on Foata normal form. 0/247 useless extension candidates. Maximal degree in co-relation 144. Up to 6 conditions per place. 
[2024-03-12 00:30:17,282 INFO  L82        GeneralOperation]: Start removeDead. Operand has 190 places, 198 transitions, 403 flow
[2024-03-12 00:30:17,287 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 190 places, 198 transitions, 403 flow
[2024-03-12 00:30:17,294 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-12 00:30:17,299 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=LoopHeads, 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;@49b92709, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-03-12 00:30:17,299 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 18 error locations.
[2024-03-12 00:30:17,305 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-03-12 00:30:17,315 INFO  L124   PetriNetUnfolderBase]: 2/41 cut-off events.
[2024-03-12 00:30:17,318 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-03-12 00:30:17,318 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:30:17,319 INFO  L208   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]
[2024-03-12 00:30:17,319 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)] ===
[2024-03-12 00:30:17,323 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:30:17,324 INFO  L85        PathProgramCache]: Analyzing trace with hash -17975759, now seen corresponding path program 1 times
[2024-03-12 00:30:17,332 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:30:17,332 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412702596]
[2024-03-12 00:30:17,332 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:30:17,333 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:30:17,419 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:30:17,505 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:30:17,505 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:30:17,505 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412702596]
[2024-03-12 00:30:17,506 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412702596] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:30:17,506 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:30:17,506 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 00:30:17,507 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973596124]
[2024-03-12 00:30:17,508 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:30:17,514 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 00:30:17,518 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:30:17,535 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 00:30:17,536 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 00:30:17,562 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 179 out of 198
[2024-03-12 00:30:17,564 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 198 transitions, 403 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)
[2024-03-12 00:30:17,565 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:30:17,565 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 198
[2024-03-12 00:30:17,565 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:30:17,648 INFO  L124   PetriNetUnfolderBase]: 34/480 cut-off events.
[2024-03-12 00:30:17,648 INFO  L125   PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES.
[2024-03-12 00:30:17,650 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 528 conditions, 480 events. 34/480 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1839 event pairs, 12 based on Foata normal form. 10/421 useless extension candidates. Maximal degree in co-relation 373. Up to 41 conditions per place. 
[2024-03-12 00:30:17,652 INFO  L140   encePairwiseOnDemand]: 191/198 looper letters, 12 selfloop transitions, 2 changer transitions 2/193 dead transitions.
[2024-03-12 00:30:17,653 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 193 transitions, 421 flow
[2024-03-12 00:30:17,654 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 00:30:17,656 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 00:30:17,662 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 556 transitions.
[2024-03-12 00:30:17,664 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.936026936026936
[2024-03-12 00:30:17,665 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 556 transitions.
[2024-03-12 00:30:17,665 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 556 transitions.
[2024-03-12 00:30:17,667 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:30:17,668 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 556 transitions.
[2024-03-12 00:30:17,672 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 185.33333333333334) internal successors, (556), 3 states have internal predecessors, (556), 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)
[2024-03-12 00:30:17,676 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 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)
[2024-03-12 00:30:17,677 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 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)
[2024-03-12 00:30:17,678 INFO  L175             Difference]: Start difference. First operand has 190 places, 198 transitions, 403 flow. Second operand 3 states and 556 transitions.
[2024-03-12 00:30:17,679 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 193 transitions, 421 flow
[2024-03-12 00:30:17,681 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 193 transitions, 421 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-12 00:30:17,684 INFO  L231             Difference]: Finished difference. Result has 191 places, 191 transitions, 393 flow
[2024-03-12 00:30:17,686 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=393, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=393, PETRI_PLACES=191, PETRI_TRANSITIONS=191}
[2024-03-12 00:30:17,689 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 1 predicate places.
[2024-03-12 00:30:17,689 INFO  L495      AbstractCegarLoop]: Abstraction has has 191 places, 191 transitions, 393 flow
[2024-03-12 00:30:17,689 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)
[2024-03-12 00:30:17,689 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:30:17,690 INFO  L208   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, 1, 1]
[2024-03-12 00:30:17,690 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-03-12 00:30:17,690 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)] ===
[2024-03-12 00:30:17,690 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:30:17,691 INFO  L85        PathProgramCache]: Analyzing trace with hash 1966895787, now seen corresponding path program 1 times
[2024-03-12 00:30:17,691 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:30:17,691 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113549591]
[2024-03-12 00:30:17,691 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:30:17,691 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:30:17,709 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:30:17,747 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:30:17,747 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:30:17,747 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113549591]
[2024-03-12 00:30:17,747 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113549591] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:30:17,747 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:30:17,747 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 00:30:17,748 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326519347]
[2024-03-12 00:30:17,748 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:30:17,749 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 00:30:17,749 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:30:17,749 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 00:30:17,749 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 00:30:17,770 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 177 out of 198
[2024-03-12 00:30:17,771 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 191 transitions, 393 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)
[2024-03-12 00:30:17,771 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:30:17,771 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 198
[2024-03-12 00:30:17,771 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:30:17,863 INFO  L124   PetriNetUnfolderBase]: 84/750 cut-off events.
[2024-03-12 00:30:17,863 INFO  L125   PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES.
[2024-03-12 00:30:17,867 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 877 conditions, 750 events. 84/750 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 3900 event pairs, 18 based on Foata normal form. 0/650 useless extension candidates. Maximal degree in co-relation 831. Up to 64 conditions per place. 
[2024-03-12 00:30:17,878 INFO  L140   encePairwiseOnDemand]: 187/198 looper letters, 21 selfloop transitions, 8 changer transitions 0/203 dead transitions.
[2024-03-12 00:30:17,878 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 203 transitions, 475 flow
[2024-03-12 00:30:17,879 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 00:30:17,879 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 00:30:17,880 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 563 transitions.
[2024-03-12 00:30:17,880 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9478114478114478
[2024-03-12 00:30:17,880 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 563 transitions.
[2024-03-12 00:30:17,880 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 563 transitions.
[2024-03-12 00:30:17,881 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:30:17,881 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 563 transitions.
[2024-03-12 00:30:17,882 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 187.66666666666666) internal successors, (563), 3 states have internal predecessors, (563), 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)
[2024-03-12 00:30:17,883 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 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)
[2024-03-12 00:30:17,884 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 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)
[2024-03-12 00:30:17,884 INFO  L175             Difference]: Start difference. First operand has 191 places, 191 transitions, 393 flow. Second operand 3 states and 563 transitions.
[2024-03-12 00:30:17,884 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 203 transitions, 475 flow
[2024-03-12 00:30:17,886 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 203 transitions, 471 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-12 00:30:17,888 INFO  L231             Difference]: Finished difference. Result has 191 places, 199 transitions, 459 flow
[2024-03-12 00:30:17,888 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=389, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=459, PETRI_PLACES=191, PETRI_TRANSITIONS=199}
[2024-03-12 00:30:17,889 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 1 predicate places.
[2024-03-12 00:30:17,889 INFO  L495      AbstractCegarLoop]: Abstraction has has 191 places, 199 transitions, 459 flow
[2024-03-12 00:30:17,889 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)
[2024-03-12 00:30:17,889 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:30:17,889 INFO  L208   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, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:30:17,890 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-03-12 00:30:17,890 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)] ===
[2024-03-12 00:30:17,890 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:30:17,890 INFO  L85        PathProgramCache]: Analyzing trace with hash 1736887687, now seen corresponding path program 1 times
[2024-03-12 00:30:17,890 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:30:17,891 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930684461]
[2024-03-12 00:30:17,891 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:30:17,891 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:30:17,911 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:30:17,993 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:30:17,993 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:30:17,994 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930684461]
[2024-03-12 00:30:17,994 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930684461] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:30:17,994 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:30:17,994 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 00:30:17,994 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625986396]
[2024-03-12 00:30:17,994 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:30:17,995 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-03-12 00:30:17,995 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:30:17,995 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-03-12 00:30:17,996 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-03-12 00:30:18,046 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 177 out of 198
[2024-03-12 00:30:18,047 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 199 transitions, 459 flow. Second operand  has 5 states, 5 states have (on average 178.4) internal successors, (892), 5 states have internal predecessors, (892), 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)
[2024-03-12 00:30:18,047 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:30:18,047 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 198
[2024-03-12 00:30:18,047 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:30:18,142 INFO  L124   PetriNetUnfolderBase]: 68/770 cut-off events.
[2024-03-12 00:30:18,142 INFO  L125   PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES.
[2024-03-12 00:30:18,143 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 934 conditions, 770 events. 68/770 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4161 event pairs, 7 based on Foata normal form. 1/679 useless extension candidates. Maximal degree in co-relation 745. Up to 61 conditions per place. 
[2024-03-12 00:30:18,145 INFO  L140   encePairwiseOnDemand]: 190/198 looper letters, 19 selfloop transitions, 6 changer transitions 1/208 dead transitions.
[2024-03-12 00:30:18,146 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 208 transitions, 529 flow
[2024-03-12 00:30:18,146 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 00:30:18,146 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 00:30:18,147 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1089 transitions.
[2024-03-12 00:30:18,148 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9166666666666666
[2024-03-12 00:30:18,148 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 1089 transitions.
[2024-03-12 00:30:18,148 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 1089 transitions.
[2024-03-12 00:30:18,149 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:30:18,149 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1089 transitions.
[2024-03-12 00:30:18,151 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 181.5) internal successors, (1089), 6 states have internal predecessors, (1089), 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)
[2024-03-12 00:30:18,153 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 198.0) internal successors, (1386), 7 states have internal predecessors, (1386), 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)
[2024-03-12 00:30:18,153 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 198.0) internal successors, (1386), 7 states have internal predecessors, (1386), 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)
[2024-03-12 00:30:18,153 INFO  L175             Difference]: Start difference. First operand has 191 places, 199 transitions, 459 flow. Second operand 6 states and 1089 transitions.
[2024-03-12 00:30:18,154 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 208 transitions, 529 flow
[2024-03-12 00:30:18,156 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 208 transitions, 513 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-12 00:30:18,158 INFO  L231             Difference]: Finished difference. Result has 198 places, 203 transitions, 485 flow
[2024-03-12 00:30:18,158 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=443, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=485, PETRI_PLACES=198, PETRI_TRANSITIONS=203}
[2024-03-12 00:30:18,158 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 8 predicate places.
[2024-03-12 00:30:18,159 INFO  L495      AbstractCegarLoop]: Abstraction has has 198 places, 203 transitions, 485 flow
[2024-03-12 00:30:18,159 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 178.4) internal successors, (892), 5 states have internal predecessors, (892), 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)
[2024-03-12 00:30:18,159 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:30:18,159 INFO  L208   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, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:30:18,160 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-03-12 00:30:18,160 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)] ===
[2024-03-12 00:30:18,160 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:30:18,160 INFO  L85        PathProgramCache]: Analyzing trace with hash 1821142723, now seen corresponding path program 1 times
[2024-03-12 00:30:18,160 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:30:18,161 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153838943]
[2024-03-12 00:30:18,161 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:30:18,161 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:30:18,178 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:30:18,444 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:30:18,445 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:30:18,445 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153838943]
[2024-03-12 00:30:18,445 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153838943] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:30:18,445 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:30:18,445 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 00:30:18,445 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344558897]
[2024-03-12 00:30:18,446 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:30:18,446 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-12 00:30:18,446 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:30:18,446 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-12 00:30:18,447 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-12 00:30:18,636 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 162 out of 198
[2024-03-12 00:30:18,638 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 203 transitions, 485 flow. Second operand  has 6 states, 6 states have (on average 163.16666666666666) internal successors, (979), 6 states have internal predecessors, (979), 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)
[2024-03-12 00:30:18,638 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:30:18,638 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 198
[2024-03-12 00:30:18,639 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:30:18,868 INFO  L124   PetriNetUnfolderBase]: 223/1359 cut-off events.
[2024-03-12 00:30:18,868 INFO  L125   PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES.
[2024-03-12 00:30:18,870 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1914 conditions, 1359 events. 223/1359 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 8766 event pairs, 57 based on Foata normal form. 0/1193 useless extension candidates. Maximal degree in co-relation 1758. Up to 237 conditions per place. 
[2024-03-12 00:30:18,873 INFO  L140   encePairwiseOnDemand]: 175/198 looper letters, 46 selfloop transitions, 29 changer transitions 0/246 dead transitions.
[2024-03-12 00:30:18,874 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 246 transitions, 724 flow
[2024-03-12 00:30:18,874 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 00:30:18,874 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 00:30:18,875 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1050 transitions.
[2024-03-12 00:30:18,876 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8838383838383839
[2024-03-12 00:30:18,876 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 1050 transitions.
[2024-03-12 00:30:18,876 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 1050 transitions.
[2024-03-12 00:30:18,877 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:30:18,877 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1050 transitions.
[2024-03-12 00:30:18,879 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 175.0) internal successors, (1050), 6 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)
[2024-03-12 00:30:18,880 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 198.0) internal successors, (1386), 7 states have internal predecessors, (1386), 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)
[2024-03-12 00:30:18,881 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 198.0) internal successors, (1386), 7 states have internal predecessors, (1386), 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)
[2024-03-12 00:30:18,881 INFO  L175             Difference]: Start difference. First operand has 198 places, 203 transitions, 485 flow. Second operand 6 states and 1050 transitions.
[2024-03-12 00:30:18,881 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 246 transitions, 724 flow
[2024-03-12 00:30:18,883 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 246 transitions, 722 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-12 00:30:18,885 INFO  L231             Difference]: Finished difference. Result has 207 places, 232 transitions, 703 flow
[2024-03-12 00:30:18,886 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=483, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=703, PETRI_PLACES=207, PETRI_TRANSITIONS=232}
[2024-03-12 00:30:18,886 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 17 predicate places.
[2024-03-12 00:30:18,886 INFO  L495      AbstractCegarLoop]: Abstraction has has 207 places, 232 transitions, 703 flow
[2024-03-12 00:30:18,887 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 163.16666666666666) internal successors, (979), 6 states have internal predecessors, (979), 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)
[2024-03-12 00:30:18,887 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:30:18,887 INFO  L208   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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:30:18,887 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-03-12 00:30:18,887 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:30:18,888 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:30:18,888 INFO  L85        PathProgramCache]: Analyzing trace with hash 1610552499, now seen corresponding path program 1 times
[2024-03-12 00:30:18,888 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:30:18,888 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051989813]
[2024-03-12 00:30:18,888 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:30:18,888 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:30:18,908 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:30:18,932 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:30:18,932 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:30:18,932 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051989813]
[2024-03-12 00:30:18,932 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051989813] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:30:18,932 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:30:18,932 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 00:30:18,933 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136597124]
[2024-03-12 00:30:18,933 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:30:18,933 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 00:30:18,933 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:30:18,934 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 00:30:18,934 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 00:30:18,945 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 181 out of 198
[2024-03-12 00:30:18,946 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 232 transitions, 703 flow. Second operand  has 3 states, 3 states have (on average 182.0) internal successors, (546), 3 states have internal predecessors, (546), 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)
[2024-03-12 00:30:18,946 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:30:18,946 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 198
[2024-03-12 00:30:18,946 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:30:19,056 INFO  L124   PetriNetUnfolderBase]: 146/1090 cut-off events.
[2024-03-12 00:30:19,056 INFO  L125   PetriNetUnfolderBase]: For 87/87 co-relation queries the response was YES.
[2024-03-12 00:30:19,059 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1710 conditions, 1090 events. 146/1090 cut-off events. For 87/87 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 6693 event pairs, 17 based on Foata normal form. 0/999 useless extension candidates. Maximal degree in co-relation 1444. Up to 132 conditions per place. 
[2024-03-12 00:30:19,062 INFO  L140   encePairwiseOnDemand]: 194/198 looper letters, 15 selfloop transitions, 2 changer transitions 4/236 dead transitions.
[2024-03-12 00:30:19,062 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 236 transitions, 745 flow
[2024-03-12 00:30:19,062 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 00:30:19,063 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 00:30:19,063 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 562 transitions.
[2024-03-12 00:30:19,064 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9461279461279462
[2024-03-12 00:30:19,064 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 562 transitions.
[2024-03-12 00:30:19,064 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 562 transitions.
[2024-03-12 00:30:19,064 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:30:19,064 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 562 transitions.
[2024-03-12 00:30:19,065 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 187.33333333333334) internal successors, (562), 3 states have internal predecessors, (562), 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)
[2024-03-12 00:30:19,066 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 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)
[2024-03-12 00:30:19,067 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 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)
[2024-03-12 00:30:19,067 INFO  L175             Difference]: Start difference. First operand has 207 places, 232 transitions, 703 flow. Second operand 3 states and 562 transitions.
[2024-03-12 00:30:19,067 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 236 transitions, 745 flow
[2024-03-12 00:30:19,070 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 236 transitions, 745 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-12 00:30:19,072 INFO  L231             Difference]: Finished difference. Result has 208 places, 228 transitions, 689 flow
[2024-03-12 00:30:19,072 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=699, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=689, PETRI_PLACES=208, PETRI_TRANSITIONS=228}
[2024-03-12 00:30:19,073 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 18 predicate places.
[2024-03-12 00:30:19,073 INFO  L495      AbstractCegarLoop]: Abstraction has has 208 places, 228 transitions, 689 flow
[2024-03-12 00:30:19,074 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 182.0) internal successors, (546), 3 states have internal predecessors, (546), 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)
[2024-03-12 00:30:19,074 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:30:19,074 INFO  L208   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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:30:19,074 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-03-12 00:30:19,074 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:30:19,074 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:30:19,074 INFO  L85        PathProgramCache]: Analyzing trace with hash -348790657, now seen corresponding path program 1 times
[2024-03-12 00:30:19,074 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:30:19,077 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561653208]
[2024-03-12 00:30:19,077 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:30:19,077 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:30:19,087 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:30:19,141 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:30:19,141 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:30:19,141 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561653208]
[2024-03-12 00:30:19,142 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561653208] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:30:19,142 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:30:19,142 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-03-12 00:30:19,142 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278296417]
[2024-03-12 00:30:19,142 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:30:19,143 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-03-12 00:30:19,143 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:30:19,144 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-03-12 00:30:19,144 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-03-12 00:30:19,172 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 179 out of 198
[2024-03-12 00:30:19,173 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 228 transitions, 689 flow. Second operand  has 4 states, 4 states have (on average 180.5) internal successors, (722), 4 states have internal predecessors, (722), 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)
[2024-03-12 00:30:19,173 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:30:19,173 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 198
[2024-03-12 00:30:19,173 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:30:19,305 INFO  L124   PetriNetUnfolderBase]: 160/1181 cut-off events.
[2024-03-12 00:30:19,306 INFO  L125   PetriNetUnfolderBase]: For 92/92 co-relation queries the response was YES.
[2024-03-12 00:30:19,308 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1860 conditions, 1181 events. 160/1181 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 7751 event pairs, 34 based on Foata normal form. 1/1080 useless extension candidates. Maximal degree in co-relation 1613. Up to 126 conditions per place. 
[2024-03-12 00:30:19,311 INFO  L140   encePairwiseOnDemand]: 194/198 looper letters, 17 selfloop transitions, 4 changer transitions 0/234 dead transitions.
[2024-03-12 00:30:19,311 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 234 transitions, 743 flow
[2024-03-12 00:30:19,311 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-12 00:30:19,312 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-12 00:30:19,312 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 738 transitions.
[2024-03-12 00:30:19,313 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9318181818181818
[2024-03-12 00:30:19,313 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 738 transitions.
[2024-03-12 00:30:19,313 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 738 transitions.
[2024-03-12 00:30:19,313 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:30:19,313 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 738 transitions.
[2024-03-12 00:30:19,315 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 184.5) internal successors, (738), 4 states have internal predecessors, (738), 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)
[2024-03-12 00:30:19,316 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 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)
[2024-03-12 00:30:19,316 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 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)
[2024-03-12 00:30:19,316 INFO  L175             Difference]: Start difference. First operand has 208 places, 228 transitions, 689 flow. Second operand 4 states and 738 transitions.
[2024-03-12 00:30:19,316 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 234 transitions, 743 flow
[2024-03-12 00:30:19,319 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 234 transitions, 731 flow, removed 5 selfloop flow, removed 4 redundant places.
[2024-03-12 00:30:19,321 INFO  L231             Difference]: Finished difference. Result has 206 places, 231 transitions, 702 flow
[2024-03-12 00:30:19,322 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=677, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=702, PETRI_PLACES=206, PETRI_TRANSITIONS=231}
[2024-03-12 00:30:19,322 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 16 predicate places.
[2024-03-12 00:30:19,322 INFO  L495      AbstractCegarLoop]: Abstraction has has 206 places, 231 transitions, 702 flow
[2024-03-12 00:30:19,323 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 180.5) internal successors, (722), 4 states have internal predecessors, (722), 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)
[2024-03-12 00:30:19,323 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:30:19,323 INFO  L208   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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:30:19,323 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-03-12 00:30:19,323 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:30:19,323 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:30:19,324 INFO  L85        PathProgramCache]: Analyzing trace with hash 221413779, now seen corresponding path program 1 times
[2024-03-12 00:30:19,324 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:30:19,324 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939643789]
[2024-03-12 00:30:19,324 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:30:19,324 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:30:19,334 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:30:19,380 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:30:19,380 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:30:19,380 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939643789]
[2024-03-12 00:30:19,380 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939643789] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:30:19,380 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:30:19,380 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-03-12 00:30:19,380 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443365696]
[2024-03-12 00:30:19,381 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:30:19,381 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-03-12 00:30:19,381 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:30:19,381 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-03-12 00:30:19,382 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-03-12 00:30:19,423 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 179 out of 198
[2024-03-12 00:30:19,424 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 231 transitions, 702 flow. Second operand  has 4 states, 4 states have (on average 180.5) internal successors, (722), 4 states have internal predecessors, (722), 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)
[2024-03-12 00:30:19,424 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:30:19,424 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 198
[2024-03-12 00:30:19,424 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:30:19,534 INFO  L124   PetriNetUnfolderBase]: 159/1179 cut-off events.
[2024-03-12 00:30:19,535 INFO  L125   PetriNetUnfolderBase]: For 110/110 co-relation queries the response was YES.
[2024-03-12 00:30:19,537 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1867 conditions, 1179 events. 159/1179 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 7768 event pairs, 34 based on Foata normal form. 1/1075 useless extension candidates. Maximal degree in co-relation 1622. Up to 126 conditions per place. 
[2024-03-12 00:30:19,540 INFO  L140   encePairwiseOnDemand]: 194/198 looper letters, 16 selfloop transitions, 4 changer transitions 0/233 dead transitions.
[2024-03-12 00:30:19,541 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 233 transitions, 746 flow
[2024-03-12 00:30:19,541 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-12 00:30:19,541 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-12 00:30:19,542 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 737 transitions.
[2024-03-12 00:30:19,542 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9305555555555556
[2024-03-12 00:30:19,543 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 737 transitions.
[2024-03-12 00:30:19,543 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 737 transitions.
[2024-03-12 00:30:19,543 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:30:19,543 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 737 transitions.
[2024-03-12 00:30:19,544 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 184.25) internal successors, (737), 4 states have internal predecessors, (737), 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)
[2024-03-12 00:30:19,546 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 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)
[2024-03-12 00:30:19,546 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 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)
[2024-03-12 00:30:19,546 INFO  L175             Difference]: Start difference. First operand has 206 places, 231 transitions, 702 flow. Second operand 4 states and 737 transitions.
[2024-03-12 00:30:19,546 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 233 transitions, 746 flow
[2024-03-12 00:30:19,549 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 233 transitions, 746 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-12 00:30:19,551 INFO  L231             Difference]: Finished difference. Result has 211 places, 232 transitions, 721 flow
[2024-03-12 00:30:19,552 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=702, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=721, PETRI_PLACES=211, PETRI_TRANSITIONS=232}
[2024-03-12 00:30:19,552 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 21 predicate places.
[2024-03-12 00:30:19,552 INFO  L495      AbstractCegarLoop]: Abstraction has has 211 places, 232 transitions, 721 flow
[2024-03-12 00:30:19,553 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 180.5) internal successors, (722), 4 states have internal predecessors, (722), 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)
[2024-03-12 00:30:19,553 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:30:19,553 INFO  L208   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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:30:19,553 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-03-12 00:30:19,553 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:30:19,553 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:30:19,553 INFO  L85        PathProgramCache]: Analyzing trace with hash 2090768914, now seen corresponding path program 1 times
[2024-03-12 00:30:19,554 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:30:19,554 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178264525]
[2024-03-12 00:30:19,554 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:30:19,554 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:30:19,563 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:30:19,612 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:30:19,612 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:30:19,612 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178264525]
[2024-03-12 00:30:19,612 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178264525] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:30:19,612 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:30:19,613 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-03-12 00:30:19,613 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330979836]
[2024-03-12 00:30:19,613 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:30:19,613 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-03-12 00:30:19,613 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:30:19,614 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-03-12 00:30:19,614 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-03-12 00:30:19,649 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 179 out of 198
[2024-03-12 00:30:19,650 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 232 transitions, 721 flow. Second operand  has 4 states, 4 states have (on average 180.5) internal successors, (722), 4 states have internal predecessors, (722), 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)
[2024-03-12 00:30:19,650 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:30:19,650 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 198
[2024-03-12 00:30:19,650 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:30:19,787 INFO  L124   PetriNetUnfolderBase]: 168/1324 cut-off events.
[2024-03-12 00:30:19,787 INFO  L125   PetriNetUnfolderBase]: For 134/134 co-relation queries the response was YES.
[2024-03-12 00:30:19,789 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2062 conditions, 1324 events. 168/1324 cut-off events. For 134/134 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 9152 event pairs, 33 based on Foata normal form. 1/1211 useless extension candidates. Maximal degree in co-relation 1945. Up to 150 conditions per place. 
[2024-03-12 00:30:19,792 INFO  L140   encePairwiseOnDemand]: 194/198 looper letters, 17 selfloop transitions, 4 changer transitions 0/234 dead transitions.
[2024-03-12 00:30:19,792 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 234 transitions, 767 flow
[2024-03-12 00:30:19,793 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-12 00:30:19,793 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-12 00:30:19,795 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 738 transitions.
[2024-03-12 00:30:19,795 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9318181818181818
[2024-03-12 00:30:19,796 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 738 transitions.
[2024-03-12 00:30:19,796 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 738 transitions.
[2024-03-12 00:30:19,796 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:30:19,797 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 738 transitions.
[2024-03-12 00:30:19,798 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 184.5) internal successors, (738), 4 states have internal predecessors, (738), 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)
[2024-03-12 00:30:19,800 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 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)
[2024-03-12 00:30:19,801 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 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)
[2024-03-12 00:30:19,801 INFO  L175             Difference]: Start difference. First operand has 211 places, 232 transitions, 721 flow. Second operand 4 states and 738 transitions.
[2024-03-12 00:30:19,801 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 234 transitions, 767 flow
[2024-03-12 00:30:19,805 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 234 transitions, 764 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-12 00:30:19,807 INFO  L231             Difference]: Finished difference. Result has 214 places, 232 transitions, 730 flow
[2024-03-12 00:30:19,807 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=718, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=730, PETRI_PLACES=214, PETRI_TRANSITIONS=232}
[2024-03-12 00:30:19,807 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 24 predicate places.
[2024-03-12 00:30:19,808 INFO  L495      AbstractCegarLoop]: Abstraction has has 214 places, 232 transitions, 730 flow
[2024-03-12 00:30:19,808 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 180.5) internal successors, (722), 4 states have internal predecessors, (722), 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)
[2024-03-12 00:30:19,808 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:30:19,808 INFO  L208   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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:30:19,808 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-03-12 00:30:19,808 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:30:19,809 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:30:19,809 INFO  L85        PathProgramCache]: Analyzing trace with hash -1707730050, now seen corresponding path program 1 times
[2024-03-12 00:30:19,809 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:30:19,809 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921095935]
[2024-03-12 00:30:19,809 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:30:19,809 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:30:19,819 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:30:19,861 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:30:19,861 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:30:19,861 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921095935]
[2024-03-12 00:30:19,861 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921095935] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:30:19,861 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:30:19,862 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-03-12 00:30:19,862 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356726615]
[2024-03-12 00:30:19,862 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:30:19,862 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-03-12 00:30:19,862 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:30:19,863 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-03-12 00:30:19,863 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-03-12 00:30:19,906 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 178 out of 198
[2024-03-12 00:30:19,907 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 232 transitions, 730 flow. Second operand  has 4 states, 4 states have (on average 179.5) internal successors, (718), 4 states have internal predecessors, (718), 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)
[2024-03-12 00:30:19,907 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:30:19,907 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 198
[2024-03-12 00:30:19,907 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:30:20,043 INFO  L124   PetriNetUnfolderBase]: 164/1242 cut-off events.
[2024-03-12 00:30:20,044 INFO  L125   PetriNetUnfolderBase]: For 162/162 co-relation queries the response was YES.
[2024-03-12 00:30:20,046 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1989 conditions, 1242 events. 164/1242 cut-off events. For 162/162 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 8390 event pairs, 38 based on Foata normal form. 1/1136 useless extension candidates. Maximal degree in co-relation 1871. Up to 134 conditions per place. 
[2024-03-12 00:30:20,049 INFO  L140   encePairwiseOnDemand]: 194/198 looper letters, 17 selfloop transitions, 4 changer transitions 0/233 dead transitions.
[2024-03-12 00:30:20,049 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 233 transitions, 774 flow
[2024-03-12 00:30:20,050 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-12 00:30:20,050 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-12 00:30:20,051 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 734 transitions.
[2024-03-12 00:30:20,051 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9267676767676768
[2024-03-12 00:30:20,052 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 734 transitions.
[2024-03-12 00:30:20,052 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 734 transitions.
[2024-03-12 00:30:20,052 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:30:20,052 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 734 transitions.
[2024-03-12 00:30:20,053 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 183.5) internal successors, (734), 4 states have internal predecessors, (734), 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)
[2024-03-12 00:30:20,055 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 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)
[2024-03-12 00:30:20,055 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 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)
[2024-03-12 00:30:20,055 INFO  L175             Difference]: Start difference. First operand has 214 places, 232 transitions, 730 flow. Second operand 4 states and 734 transitions.
[2024-03-12 00:30:20,055 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 233 transitions, 774 flow
[2024-03-12 00:30:20,059 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 233 transitions, 766 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-03-12 00:30:20,061 INFO  L231             Difference]: Finished difference. Result has 215 places, 232 transitions, 734 flow
[2024-03-12 00:30:20,061 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=722, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=734, PETRI_PLACES=215, PETRI_TRANSITIONS=232}
[2024-03-12 00:30:20,062 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 25 predicate places.
[2024-03-12 00:30:20,062 INFO  L495      AbstractCegarLoop]: Abstraction has has 215 places, 232 transitions, 734 flow
[2024-03-12 00:30:20,062 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 179.5) internal successors, (718), 4 states have internal predecessors, (718), 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)
[2024-03-12 00:30:20,062 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:30:20,062 INFO  L208   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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:30:20,062 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-03-12 00:30:20,062 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:30:20,063 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:30:20,063 INFO  L85        PathProgramCache]: Analyzing trace with hash 320241069, now seen corresponding path program 1 times
[2024-03-12 00:30:20,063 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:30:20,063 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372894174]
[2024-03-12 00:30:20,063 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:30:20,063 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:30:20,075 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:30:20,097 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:30:20,097 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:30:20,097 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372894174]
[2024-03-12 00:30:20,098 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372894174] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:30:20,098 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:30:20,098 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 00:30:20,098 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635413125]
[2024-03-12 00:30:20,098 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:30:20,098 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 00:30:20,099 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:30:20,099 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 00:30:20,099 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 00:30:20,129 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 177 out of 198
[2024-03-12 00:30:20,130 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 232 transitions, 734 flow. Second operand  has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 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)
[2024-03-12 00:30:20,130 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:30:20,130 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 198
[2024-03-12 00:30:20,130 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:30:20,248 INFO  L124   PetriNetUnfolderBase]: 187/1301 cut-off events.
[2024-03-12 00:30:20,248 INFO  L125   PetriNetUnfolderBase]: For 167/174 co-relation queries the response was YES.
[2024-03-12 00:30:20,251 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2078 conditions, 1301 events. 187/1301 cut-off events. For 167/174 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 8774 event pairs, 32 based on Foata normal form. 3/1186 useless extension candidates. Maximal degree in co-relation 2026. Up to 134 conditions per place. 
[2024-03-12 00:30:20,255 INFO  L140   encePairwiseOnDemand]: 192/198 looper letters, 22 selfloop transitions, 7 changer transitions 0/239 dead transitions.
[2024-03-12 00:30:20,255 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 239 transitions, 812 flow
[2024-03-12 00:30:20,255 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 00:30:20,255 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 00:30:20,256 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 555 transitions.
[2024-03-12 00:30:20,256 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9343434343434344
[2024-03-12 00:30:20,256 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 555 transitions.
[2024-03-12 00:30:20,256 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 555 transitions.
[2024-03-12 00:30:20,257 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:30:20,257 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 555 transitions.
[2024-03-12 00:30:20,258 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 185.0) internal successors, (555), 3 states have internal predecessors, (555), 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)
[2024-03-12 00:30:20,258 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 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)
[2024-03-12 00:30:20,259 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 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)
[2024-03-12 00:30:20,259 INFO  L175             Difference]: Start difference. First operand has 215 places, 232 transitions, 734 flow. Second operand 3 states and 555 transitions.
[2024-03-12 00:30:20,259 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 239 transitions, 812 flow
[2024-03-12 00:30:20,261 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 239 transitions, 804 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-03-12 00:30:20,263 INFO  L231             Difference]: Finished difference. Result has 216 places, 237 transitions, 782 flow
[2024-03-12 00:30:20,264 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=726, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=782, PETRI_PLACES=216, PETRI_TRANSITIONS=237}
[2024-03-12 00:30:20,264 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 26 predicate places.
[2024-03-12 00:30:20,264 INFO  L495      AbstractCegarLoop]: Abstraction has has 216 places, 237 transitions, 782 flow
[2024-03-12 00:30:20,265 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 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)
[2024-03-12 00:30:20,265 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:30:20,265 INFO  L208   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, 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, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:30:20,265 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-03-12 00:30:20,265 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:30:20,265 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:30:20,265 INFO  L85        PathProgramCache]: Analyzing trace with hash 299733149, now seen corresponding path program 1 times
[2024-03-12 00:30:20,265 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:30:20,265 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375408388]
[2024-03-12 00:30:20,265 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:30:20,266 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:30:20,279 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:30:20,298 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:30:20,298 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:30:20,298 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375408388]
[2024-03-12 00:30:20,298 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375408388] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:30:20,298 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:30:20,298 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 00:30:20,299 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544219799]
[2024-03-12 00:30:20,299 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:30:20,299 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 00:30:20,299 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:30:20,299 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 00:30:20,299 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 00:30:20,318 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 179 out of 198
[2024-03-12 00:30:20,319 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 237 transitions, 782 flow. Second operand  has 3 states, 3 states have (on average 182.66666666666666) internal successors, (548), 3 states have internal predecessors, (548), 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)
[2024-03-12 00:30:20,319 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:30:20,319 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 198
[2024-03-12 00:30:20,319 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:30:20,441 INFO  L124   PetriNetUnfolderBase]: 205/1381 cut-off events.
[2024-03-12 00:30:20,441 INFO  L125   PetriNetUnfolderBase]: For 321/323 co-relation queries the response was YES.
[2024-03-12 00:30:20,444 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2349 conditions, 1381 events. 205/1381 cut-off events. For 321/323 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 9493 event pairs, 29 based on Foata normal form. 1/1273 useless extension candidates. Maximal degree in co-relation 2290. Up to 142 conditions per place. 
[2024-03-12 00:30:20,447 INFO  L140   encePairwiseOnDemand]: 191/198 looper letters, 21 selfloop transitions, 11 changer transitions 0/246 dead transitions.
[2024-03-12 00:30:20,447 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 246 transitions, 882 flow
[2024-03-12 00:30:20,448 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 00:30:20,449 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 00:30:20,449 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 560 transitions.
[2024-03-12 00:30:20,449 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9427609427609428
[2024-03-12 00:30:20,450 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 560 transitions.
[2024-03-12 00:30:20,450 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 560 transitions.
[2024-03-12 00:30:20,450 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:30:20,450 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 560 transitions.
[2024-03-12 00:30:20,451 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 186.66666666666666) internal successors, (560), 3 states have internal predecessors, (560), 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)
[2024-03-12 00:30:20,452 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 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)
[2024-03-12 00:30:20,452 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 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)
[2024-03-12 00:30:20,452 INFO  L175             Difference]: Start difference. First operand has 216 places, 237 transitions, 782 flow. Second operand 3 states and 560 transitions.
[2024-03-12 00:30:20,452 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 246 transitions, 882 flow
[2024-03-12 00:30:20,455 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 246 transitions, 864 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-12 00:30:20,457 INFO  L231             Difference]: Finished difference. Result has 218 places, 244 transitions, 856 flow
[2024-03-12 00:30:20,457 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=768, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=856, PETRI_PLACES=218, PETRI_TRANSITIONS=244}
[2024-03-12 00:30:20,458 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 28 predicate places.
[2024-03-12 00:30:20,458 INFO  L495      AbstractCegarLoop]: Abstraction has has 218 places, 244 transitions, 856 flow
[2024-03-12 00:30:20,458 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 182.66666666666666) internal successors, (548), 3 states have internal predecessors, (548), 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)
[2024-03-12 00:30:20,458 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:30:20,458 INFO  L208   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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:30:20,458 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-03-12 00:30:20,458 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:30:20,459 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:30:20,459 INFO  L85        PathProgramCache]: Analyzing trace with hash -984572120, now seen corresponding path program 1 times
[2024-03-12 00:30:20,459 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:30:20,459 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863537555]
[2024-03-12 00:30:20,459 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:30:20,459 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:30:20,477 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:30:20,748 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-12 00:30:20,748 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:30:20,748 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863537555]
[2024-03-12 00:30:20,748 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863537555] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:30:20,749 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:30:20,749 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 00:30:20,749 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728750286]
[2024-03-12 00:30:20,749 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:30:20,749 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-12 00:30:20,750 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:30:20,750 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-12 00:30:20,750 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-12 00:30:20,962 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 171 out of 198
[2024-03-12 00:30:20,963 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 244 transitions, 856 flow. Second operand  has 6 states, 6 states have (on average 172.83333333333334) internal successors, (1037), 6 states have internal predecessors, (1037), 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)
[2024-03-12 00:30:20,963 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:30:20,963 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 198
[2024-03-12 00:30:20,963 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:30:21,189 INFO  L124   PetriNetUnfolderBase]: 277/1591 cut-off events.
[2024-03-12 00:30:21,189 INFO  L125   PetriNetUnfolderBase]: For 529/531 co-relation queries the response was YES.
[2024-03-12 00:30:21,193 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2925 conditions, 1591 events. 277/1591 cut-off events. For 529/531 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 11271 event pairs, 44 based on Foata normal form. 0/1473 useless extension candidates. Maximal degree in co-relation 2869. Up to 288 conditions per place. 
[2024-03-12 00:30:21,196 INFO  L140   encePairwiseOnDemand]: 187/198 looper letters, 40 selfloop transitions, 33 changer transitions 8/286 dead transitions.
[2024-03-12 00:30:21,197 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 286 transitions, 1187 flow
[2024-03-12 00:30:21,197 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 00:30:21,197 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 00:30:21,199 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1080 transitions.
[2024-03-12 00:30:21,199 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9090909090909091
[2024-03-12 00:30:21,199 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 1080 transitions.
[2024-03-12 00:30:21,199 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 1080 transitions.
[2024-03-12 00:30:21,200 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:30:21,200 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1080 transitions.
[2024-03-12 00:30:21,202 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 180.0) internal successors, (1080), 6 states have internal predecessors, (1080), 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)
[2024-03-12 00:30:21,203 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 198.0) internal successors, (1386), 7 states have internal predecessors, (1386), 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)
[2024-03-12 00:30:21,204 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 198.0) internal successors, (1386), 7 states have internal predecessors, (1386), 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)
[2024-03-12 00:30:21,204 INFO  L175             Difference]: Start difference. First operand has 218 places, 244 transitions, 856 flow. Second operand 6 states and 1080 transitions.
[2024-03-12 00:30:21,204 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 286 transitions, 1187 flow
[2024-03-12 00:30:21,207 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 286 transitions, 1165 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-12 00:30:21,210 INFO  L231             Difference]: Finished difference. Result has 226 places, 270 transitions, 1127 flow
[2024-03-12 00:30:21,210 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=834, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1127, PETRI_PLACES=226, PETRI_TRANSITIONS=270}
[2024-03-12 00:30:21,211 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 36 predicate places.
[2024-03-12 00:30:21,211 INFO  L495      AbstractCegarLoop]: Abstraction has has 226 places, 270 transitions, 1127 flow
[2024-03-12 00:30:21,211 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 172.83333333333334) internal successors, (1037), 6 states have internal predecessors, (1037), 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)
[2024-03-12 00:30:21,211 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:30:21,212 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 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, 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, 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]
[2024-03-12 00:30:21,212 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-03-12 00:30:21,212 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:30:21,212 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:30:21,212 INFO  L85        PathProgramCache]: Analyzing trace with hash 335018985, now seen corresponding path program 1 times
[2024-03-12 00:30:21,212 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:30:21,212 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144508067]
[2024-03-12 00:30:21,212 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:30:21,212 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:30:21,226 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:30:21,283 INFO  L134       CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2024-03-12 00:30:21,283 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:30:21,283 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144508067]
[2024-03-12 00:30:21,283 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144508067] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:30:21,283 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:30:21,283 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-03-12 00:30:21,284 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867591183]
[2024-03-12 00:30:21,284 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:30:21,284 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 00:30:21,284 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:30:21,284 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 00:30:21,285 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 00:30:21,294 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 187 out of 198
[2024-03-12 00:30:21,295 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 270 transitions, 1127 flow. Second operand  has 3 states, 3 states have (on average 189.0) internal successors, (567), 3 states have internal predecessors, (567), 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)
[2024-03-12 00:30:21,295 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:30:21,295 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 198
[2024-03-12 00:30:21,295 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:30:21,365 INFO  L124   PetriNetUnfolderBase]: 130/754 cut-off events.
[2024-03-12 00:30:21,365 INFO  L125   PetriNetUnfolderBase]: For 322/355 co-relation queries the response was YES.
[2024-03-12 00:30:21,366 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 754 events. 130/754 cut-off events. For 322/355 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3867 event pairs, 1 based on Foata normal form. 2/720 useless extension candidates. Maximal degree in co-relation 1511. Up to 147 conditions per place. 
[2024-03-12 00:30:21,368 INFO  L140   encePairwiseOnDemand]: 194/198 looper letters, 2 selfloop transitions, 4 changer transitions 0/245 dead transitions.
[2024-03-12 00:30:21,368 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 245 transitions, 1005 flow
[2024-03-12 00:30:21,369 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 00:30:21,369 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 00:30:21,370 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 569 transitions.
[2024-03-12 00:30:21,370 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9579124579124579
[2024-03-12 00:30:21,370 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 569 transitions.
[2024-03-12 00:30:21,370 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 569 transitions.
[2024-03-12 00:30:21,371 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:30:21,371 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 569 transitions.
[2024-03-12 00:30:21,372 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 189.66666666666666) internal successors, (569), 3 states have internal predecessors, (569), 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)
[2024-03-12 00:30:21,373 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 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)
[2024-03-12 00:30:21,373 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 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)
[2024-03-12 00:30:21,373 INFO  L175             Difference]: Start difference. First operand has 226 places, 270 transitions, 1127 flow. Second operand 3 states and 569 transitions.
[2024-03-12 00:30:21,373 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 245 transitions, 1005 flow
[2024-03-12 00:30:21,376 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 245 transitions, 967 flow, removed 11 selfloop flow, removed 6 redundant places.
[2024-03-12 00:30:21,379 INFO  L231             Difference]: Finished difference. Result has 212 places, 245 transitions, 963 flow
[2024-03-12 00:30:21,379 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=955, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=963, PETRI_PLACES=212, PETRI_TRANSITIONS=245}
[2024-03-12 00:30:21,379 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 22 predicate places.
[2024-03-12 00:30:21,380 INFO  L495      AbstractCegarLoop]: Abstraction has has 212 places, 245 transitions, 963 flow
[2024-03-12 00:30:21,380 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 189.0) internal successors, (567), 3 states have internal predecessors, (567), 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)
[2024-03-12 00:30:21,380 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:30:21,380 INFO  L208   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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:30:21,380 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-03-12 00:30:21,380 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting threadErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:30:21,380 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:30:21,380 INFO  L85        PathProgramCache]: Analyzing trace with hash 891340423, now seen corresponding path program 1 times
[2024-03-12 00:30:21,381 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:30:21,381 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184850116]
[2024-03-12 00:30:21,381 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:30:21,381 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:30:21,398 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:30:21,514 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:30:21,514 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:30:21,514 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184850116]
[2024-03-12 00:30:21,514 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184850116] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:30:21,514 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:30:21,514 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-03-12 00:30:21,514 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269752780]
[2024-03-12 00:30:21,515 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:30:21,515 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-03-12 00:30:21,515 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:30:21,515 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-03-12 00:30:21,515 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-03-12 00:30:21,631 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 168 out of 198
[2024-03-12 00:30:21,632 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 245 transitions, 963 flow. Second operand  has 8 states, 8 states have (on average 170.25) internal successors, (1362), 8 states have internal predecessors, (1362), 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)
[2024-03-12 00:30:21,632 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:30:21,632 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 198
[2024-03-12 00:30:21,633 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:30:21,819 INFO  L124   PetriNetUnfolderBase]: 162/996 cut-off events.
[2024-03-12 00:30:21,819 INFO  L125   PetriNetUnfolderBase]: For 346/381 co-relation queries the response was YES.
[2024-03-12 00:30:21,821 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1926 conditions, 996 events. 162/996 cut-off events. For 346/381 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 5745 event pairs, 8 based on Foata normal form. 4/945 useless extension candidates. Maximal degree in co-relation 1745. Up to 144 conditions per place. 
[2024-03-12 00:30:21,824 INFO  L140   encePairwiseOnDemand]: 187/198 looper letters, 52 selfloop transitions, 15 changer transitions 0/283 dead transitions.
[2024-03-12 00:30:21,824 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 283 transitions, 1206 flow
[2024-03-12 00:30:21,824 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-03-12 00:30:21,824 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-03-12 00:30:21,826 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1749 transitions.
[2024-03-12 00:30:21,827 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8833333333333333
[2024-03-12 00:30:21,827 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 1749 transitions.
[2024-03-12 00:30:21,827 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 1749 transitions.
[2024-03-12 00:30:21,828 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:30:21,828 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1749 transitions.
[2024-03-12 00:30:21,831 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 11 states, 10 states have (on average 174.9) internal successors, (1749), 10 states have internal predecessors, (1749), 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)
[2024-03-12 00:30:21,833 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 11 states, 11 states have (on average 198.0) internal successors, (2178), 11 states have internal predecessors, (2178), 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)
[2024-03-12 00:30:21,834 INFO  L81            ComplementDD]: Finished complementDD. Result  has 11 states, 11 states have (on average 198.0) internal successors, (2178), 11 states have internal predecessors, (2178), 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)
[2024-03-12 00:30:21,834 INFO  L175             Difference]: Start difference. First operand has 212 places, 245 transitions, 963 flow. Second operand 10 states and 1749 transitions.
[2024-03-12 00:30:21,834 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 283 transitions, 1206 flow
[2024-03-12 00:30:21,837 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 283 transitions, 1198 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-12 00:30:21,840 INFO  L231             Difference]: Finished difference. Result has 226 places, 256 transitions, 1057 flow
[2024-03-12 00:30:21,840 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=959, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1057, PETRI_PLACES=226, PETRI_TRANSITIONS=256}
[2024-03-12 00:30:21,840 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 36 predicate places.
[2024-03-12 00:30:21,841 INFO  L495      AbstractCegarLoop]: Abstraction has has 226 places, 256 transitions, 1057 flow
[2024-03-12 00:30:21,841 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 170.25) internal successors, (1362), 8 states have internal predecessors, (1362), 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)
[2024-03-12 00:30:21,841 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:30:21,841 INFO  L208   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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:30:21,841 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-03-12 00:30:21,841 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting threadErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:30:21,842 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:30:21,842 INFO  L85        PathProgramCache]: Analyzing trace with hash -286417305, now seen corresponding path program 1 times
[2024-03-12 00:30:21,842 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:30:21,842 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676148462]
[2024-03-12 00:30:21,842 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:30:21,842 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:30:21,859 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:30:21,987 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:30:21,988 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:30:21,988 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676148462]
[2024-03-12 00:30:21,988 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676148462] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:30:21,988 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:30:21,988 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-03-12 00:30:21,988 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549155328]
[2024-03-12 00:30:21,988 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:30:21,988 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-03-12 00:30:21,989 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:30:21,989 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-03-12 00:30:21,989 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-03-12 00:30:22,090 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 167 out of 198
[2024-03-12 00:30:22,091 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 256 transitions, 1057 flow. Second operand  has 8 states, 8 states have (on average 169.25) internal successors, (1354), 8 states have internal predecessors, (1354), 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)
[2024-03-12 00:30:22,091 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:30:22,091 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 198
[2024-03-12 00:30:22,091 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:30:22,292 INFO  L124   PetriNetUnfolderBase]: 156/1015 cut-off events.
[2024-03-12 00:30:22,292 INFO  L125   PetriNetUnfolderBase]: For 434/469 co-relation queries the response was YES.
[2024-03-12 00:30:22,295 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2042 conditions, 1015 events. 156/1015 cut-off events. For 434/469 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 5881 event pairs, 10 based on Foata normal form. 6/971 useless extension candidates. Maximal degree in co-relation 1854. Up to 154 conditions per place. 
[2024-03-12 00:30:22,297 INFO  L140   encePairwiseOnDemand]: 187/198 looper letters, 53 selfloop transitions, 15 changer transitions 0/283 dead transitions.
[2024-03-12 00:30:22,297 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 283 transitions, 1288 flow
[2024-03-12 00:30:22,299 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-03-12 00:30:22,299 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-03-12 00:30:22,301 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1740 transitions.
[2024-03-12 00:30:22,302 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8787878787878788
[2024-03-12 00:30:22,302 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 1740 transitions.
[2024-03-12 00:30:22,302 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 1740 transitions.
[2024-03-12 00:30:22,303 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:30:22,303 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1740 transitions.
[2024-03-12 00:30:22,306 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 11 states, 10 states have (on average 174.0) internal successors, (1740), 10 states have internal predecessors, (1740), 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)
[2024-03-12 00:30:22,309 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 11 states, 11 states have (on average 198.0) internal successors, (2178), 11 states have internal predecessors, (2178), 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)
[2024-03-12 00:30:22,309 INFO  L81            ComplementDD]: Finished complementDD. Result  has 11 states, 11 states have (on average 198.0) internal successors, (2178), 11 states have internal predecessors, (2178), 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)
[2024-03-12 00:30:22,309 INFO  L175             Difference]: Start difference. First operand has 226 places, 256 transitions, 1057 flow. Second operand 10 states and 1740 transitions.
[2024-03-12 00:30:22,309 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 283 transitions, 1288 flow
[2024-03-12 00:30:22,313 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 283 transitions, 1279 flow, removed 2 selfloop flow, removed 2 redundant places.
[2024-03-12 00:30:22,316 INFO  L231             Difference]: Finished difference. Result has 235 places, 257 transitions, 1094 flow
[2024-03-12 00:30:22,316 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=1048, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1094, PETRI_PLACES=235, PETRI_TRANSITIONS=257}
[2024-03-12 00:30:22,316 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 45 predicate places.
[2024-03-12 00:30:22,316 INFO  L495      AbstractCegarLoop]: Abstraction has has 235 places, 257 transitions, 1094 flow
[2024-03-12 00:30:22,317 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 169.25) internal successors, (1354), 8 states have internal predecessors, (1354), 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)
[2024-03-12 00:30:22,317 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:30:22,318 INFO  L208   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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:30:22,318 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-03-12 00:30:22,318 INFO  L420      AbstractCegarLoop]: === Iteration 16 === Targeting threadErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:30:22,318 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:30:22,318 INFO  L85        PathProgramCache]: Analyzing trace with hash -562146693, now seen corresponding path program 1 times
[2024-03-12 00:30:22,318 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:30:22,318 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269853877]
[2024-03-12 00:30:22,318 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:30:22,319 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:30:22,336 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:30:22,454 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:30:22,455 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:30:22,455 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269853877]
[2024-03-12 00:30:22,455 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269853877] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:30:22,455 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:30:22,455 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-03-12 00:30:22,455 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050847205]
[2024-03-12 00:30:22,455 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:30:22,455 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-03-12 00:30:22,456 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:30:22,456 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-03-12 00:30:22,456 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-03-12 00:30:22,534 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 168 out of 198
[2024-03-12 00:30:22,536 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 257 transitions, 1094 flow. Second operand  has 7 states, 7 states have (on average 170.42857142857142) internal successors, (1193), 7 states have internal predecessors, (1193), 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)
[2024-03-12 00:30:22,536 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:30:22,536 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 198
[2024-03-12 00:30:22,536 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:30:22,722 INFO  L124   PetriNetUnfolderBase]: 161/1079 cut-off events.
[2024-03-12 00:30:22,722 INFO  L125   PetriNetUnfolderBase]: For 516/551 co-relation queries the response was YES.
[2024-03-12 00:30:22,725 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2186 conditions, 1079 events. 161/1079 cut-off events. For 516/551 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 6449 event pairs, 10 based on Foata normal form. 7/1035 useless extension candidates. Maximal degree in co-relation 1995. Up to 154 conditions per place. 
[2024-03-12 00:30:22,727 INFO  L140   encePairwiseOnDemand]: 185/198 looper letters, 57 selfloop transitions, 15 changer transitions 0/288 dead transitions.
[2024-03-12 00:30:22,728 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 288 transitions, 1367 flow
[2024-03-12 00:30:22,729 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-03-12 00:30:22,729 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-03-12 00:30:22,731 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1744 transitions.
[2024-03-12 00:30:22,732 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8808080808080808
[2024-03-12 00:30:22,732 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 1744 transitions.
[2024-03-12 00:30:22,732 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 1744 transitions.
[2024-03-12 00:30:22,733 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:30:22,733 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1744 transitions.
[2024-03-12 00:30:22,735 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 11 states, 10 states have (on average 174.4) internal successors, (1744), 10 states have internal predecessors, (1744), 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)
[2024-03-12 00:30:22,738 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 11 states, 11 states have (on average 198.0) internal successors, (2178), 11 states have internal predecessors, (2178), 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)
[2024-03-12 00:30:22,738 INFO  L81            ComplementDD]: Finished complementDD. Result  has 11 states, 11 states have (on average 198.0) internal successors, (2178), 11 states have internal predecessors, (2178), 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)
[2024-03-12 00:30:22,738 INFO  L175             Difference]: Start difference. First operand has 235 places, 257 transitions, 1094 flow. Second operand 10 states and 1744 transitions.
[2024-03-12 00:30:22,738 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 288 transitions, 1367 flow
[2024-03-12 00:30:22,743 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 288 transitions, 1345 flow, removed 0 selfloop flow, removed 7 redundant places.
[2024-03-12 00:30:22,745 INFO  L231             Difference]: Finished difference. Result has 243 places, 268 transitions, 1200 flow
[2024-03-12 00:30:22,746 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=1072, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1200, PETRI_PLACES=243, PETRI_TRANSITIONS=268}
[2024-03-12 00:30:22,746 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 53 predicate places.
[2024-03-12 00:30:22,746 INFO  L495      AbstractCegarLoop]: Abstraction has has 243 places, 268 transitions, 1200 flow
[2024-03-12 00:30:22,746 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 170.42857142857142) internal successors, (1193), 7 states have internal predecessors, (1193), 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)
[2024-03-12 00:30:22,747 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:30:22,747 INFO  L208   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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:30:22,747 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-03-12 00:30:22,747 INFO  L420      AbstractCegarLoop]: === Iteration 17 === Targeting threadErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:30:22,747 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:30:22,747 INFO  L85        PathProgramCache]: Analyzing trace with hash 615611035, now seen corresponding path program 1 times
[2024-03-12 00:30:22,747 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:30:22,747 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877258182]
[2024-03-12 00:30:22,747 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:30:22,747 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:30:22,770 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:30:22,863 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:30:22,863 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:30:22,864 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877258182]
[2024-03-12 00:30:22,864 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877258182] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:30:22,864 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:30:22,864 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-03-12 00:30:22,864 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834322875]
[2024-03-12 00:30:22,864 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:30:22,864 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-03-12 00:30:22,864 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:30:22,865 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-03-12 00:30:22,865 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-03-12 00:30:22,982 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 169 out of 198
[2024-03-12 00:30:22,982 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 268 transitions, 1200 flow. Second operand  has 7 states, 7 states have (on average 171.42857142857142) internal successors, (1200), 7 states have internal predecessors, (1200), 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)
[2024-03-12 00:30:22,983 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:30:22,983 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 198
[2024-03-12 00:30:22,983 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:30:23,146 INFO  L124   PetriNetUnfolderBase]: 155/1078 cut-off events.
[2024-03-12 00:30:23,146 INFO  L125   PetriNetUnfolderBase]: For 638/673 co-relation queries the response was YES.
[2024-03-12 00:30:23,150 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2231 conditions, 1078 events. 155/1078 cut-off events. For 638/673 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 6525 event pairs, 8 based on Foata normal form. 3/1032 useless extension candidates. Maximal degree in co-relation 2034. Up to 154 conditions per place. 
[2024-03-12 00:30:23,154 INFO  L140   encePairwiseOnDemand]: 187/198 looper letters, 54 selfloop transitions, 15 changer transitions 0/286 dead transitions.
[2024-03-12 00:30:23,154 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 286 transitions, 1415 flow
[2024-03-12 00:30:23,156 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-03-12 00:30:23,157 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-03-12 00:30:23,160 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1749 transitions.
[2024-03-12 00:30:23,161 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8833333333333333
[2024-03-12 00:30:23,161 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 1749 transitions.
[2024-03-12 00:30:23,161 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 1749 transitions.
[2024-03-12 00:30:23,162 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:30:23,163 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1749 transitions.
[2024-03-12 00:30:23,166 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 11 states, 10 states have (on average 174.9) internal successors, (1749), 10 states have internal predecessors, (1749), 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)
[2024-03-12 00:30:23,169 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 11 states, 11 states have (on average 198.0) internal successors, (2178), 11 states have internal predecessors, (2178), 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)
[2024-03-12 00:30:23,170 INFO  L81            ComplementDD]: Finished complementDD. Result  has 11 states, 11 states have (on average 198.0) internal successors, (2178), 11 states have internal predecessors, (2178), 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)
[2024-03-12 00:30:23,170 INFO  L175             Difference]: Start difference. First operand has 243 places, 268 transitions, 1200 flow. Second operand 10 states and 1749 transitions.
[2024-03-12 00:30:23,170 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 286 transitions, 1415 flow
[2024-03-12 00:30:23,176 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 286 transitions, 1382 flow, removed 14 selfloop flow, removed 2 redundant places.
[2024-03-12 00:30:23,179 INFO  L231             Difference]: Finished difference. Result has 252 places, 269 transitions, 1213 flow
[2024-03-12 00:30:23,179 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=1167, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1213, PETRI_PLACES=252, PETRI_TRANSITIONS=269}
[2024-03-12 00:30:23,179 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 62 predicate places.
[2024-03-12 00:30:23,180 INFO  L495      AbstractCegarLoop]: Abstraction has has 252 places, 269 transitions, 1213 flow
[2024-03-12 00:30:23,180 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 171.42857142857142) internal successors, (1200), 7 states have internal predecessors, (1200), 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)
[2024-03-12 00:30:23,180 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:30:23,180 INFO  L208   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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:30:23,180 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-03-12 00:30:23,180 INFO  L420      AbstractCegarLoop]: === Iteration 18 === Targeting threadErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:30:23,181 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:30:23,181 INFO  L85        PathProgramCache]: Analyzing trace with hash -988742892, now seen corresponding path program 1 times
[2024-03-12 00:30:23,181 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:30:23,181 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092222129]
[2024-03-12 00:30:23,181 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:30:23,181 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:30:23,205 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:30:23,228 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:30:23,228 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:30:23,228 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092222129]
[2024-03-12 00:30:23,228 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092222129] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:30:23,228 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:30:23,228 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-03-12 00:30:23,228 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757760253]
[2024-03-12 00:30:23,228 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:30:23,229 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 00:30:23,229 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:30:23,229 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 00:30:23,229 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 00:30:23,241 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 184 out of 198
[2024-03-12 00:30:23,241 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 269 transitions, 1213 flow. Second operand  has 3 states, 3 states have (on average 186.66666666666666) internal successors, (560), 3 states have internal predecessors, (560), 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)
[2024-03-12 00:30:23,242 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:30:23,242 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 198
[2024-03-12 00:30:23,242 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:30:23,352 INFO  L124   PetriNetUnfolderBase]: 138/1003 cut-off events.
[2024-03-12 00:30:23,352 INFO  L125   PetriNetUnfolderBase]: For 516/551 co-relation queries the response was YES.
[2024-03-12 00:30:23,355 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2044 conditions, 1003 events. 138/1003 cut-off events. For 516/551 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 5670 event pairs, 0 based on Foata normal form. 5/970 useless extension candidates. Maximal degree in co-relation 1844. Up to 151 conditions per place. 
[2024-03-12 00:30:23,357 INFO  L140   encePairwiseOnDemand]: 195/198 looper letters, 10 selfloop transitions, 4 changer transitions 0/270 dead transitions.
[2024-03-12 00:30:23,357 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 270 transitions, 1243 flow
[2024-03-12 00:30:23,358 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 00:30:23,358 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 00:30:23,359 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 563 transitions.
[2024-03-12 00:30:23,359 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9478114478114478
[2024-03-12 00:30:23,359 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 563 transitions.
[2024-03-12 00:30:23,359 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 563 transitions.
[2024-03-12 00:30:23,359 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:30:23,360 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 563 transitions.
[2024-03-12 00:30:23,360 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 187.66666666666666) internal successors, (563), 3 states have internal predecessors, (563), 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)
[2024-03-12 00:30:23,361 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 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)
[2024-03-12 00:30:23,361 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 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)
[2024-03-12 00:30:23,361 INFO  L175             Difference]: Start difference. First operand has 252 places, 269 transitions, 1213 flow. Second operand 3 states and 563 transitions.
[2024-03-12 00:30:23,361 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 270 transitions, 1243 flow
[2024-03-12 00:30:23,366 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 270 transitions, 1221 flow, removed 0 selfloop flow, removed 7 redundant places.
[2024-03-12 00:30:23,368 INFO  L231             Difference]: Finished difference. Result has 248 places, 270 transitions, 1209 flow
[2024-03-12 00:30:23,369 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=1191, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1209, PETRI_PLACES=248, PETRI_TRANSITIONS=270}
[2024-03-12 00:30:23,369 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 58 predicate places.
[2024-03-12 00:30:23,369 INFO  L495      AbstractCegarLoop]: Abstraction has has 248 places, 270 transitions, 1209 flow
[2024-03-12 00:30:23,369 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 186.66666666666666) internal successors, (560), 3 states have internal predecessors, (560), 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)
[2024-03-12 00:30:23,369 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:30:23,369 INFO  L208   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, 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, 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]
[2024-03-12 00:30:23,369 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-03-12 00:30:23,369 INFO  L420      AbstractCegarLoop]: === Iteration 19 === Targeting threadErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:30:23,370 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:30:23,370 INFO  L85        PathProgramCache]: Analyzing trace with hash 774896376, now seen corresponding path program 1 times
[2024-03-12 00:30:23,370 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:30:23,370 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177841030]
[2024-03-12 00:30:23,370 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:30:23,370 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:30:23,386 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:30:23,674 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:30:23,674 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:30:23,675 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177841030]
[2024-03-12 00:30:23,675 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177841030] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:30:23,675 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:30:23,675 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 00:30:23,675 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579928677]
[2024-03-12 00:30:23,675 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:30:23,675 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-12 00:30:23,675 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:30:23,676 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-12 00:30:23,676 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-12 00:30:23,772 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 161 out of 198
[2024-03-12 00:30:23,773 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 270 transitions, 1209 flow. Second operand  has 6 states, 6 states have (on average 164.0) internal successors, (984), 6 states have internal predecessors, (984), 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)
[2024-03-12 00:30:23,773 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:30:23,774 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 198
[2024-03-12 00:30:23,774 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:30:24,296 INFO  L124   PetriNetUnfolderBase]: 498/2152 cut-off events.
[2024-03-12 00:30:24,297 INFO  L125   PetriNetUnfolderBase]: For 1220/1230 co-relation queries the response was YES.
[2024-03-12 00:30:24,303 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5055 conditions, 2152 events. 498/2152 cut-off events. For 1220/1230 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 15211 event pairs, 138 based on Foata normal form. 0/2047 useless extension candidates. Maximal degree in co-relation 4787. Up to 837 conditions per place. 
[2024-03-12 00:30:24,308 INFO  L140   encePairwiseOnDemand]: 175/198 looper letters, 90 selfloop transitions, 89 changer transitions 5/365 dead transitions.
[2024-03-12 00:30:24,308 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 365 transitions, 2029 flow
[2024-03-12 00:30:24,309 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 00:30:24,309 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 00:30:24,310 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1076 transitions.
[2024-03-12 00:30:24,310 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9057239057239057
[2024-03-12 00:30:24,310 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 1076 transitions.
[2024-03-12 00:30:24,311 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 1076 transitions.
[2024-03-12 00:30:24,311 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:30:24,311 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1076 transitions.
[2024-03-12 00:30:24,312 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 179.33333333333334) internal successors, (1076), 6 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)
[2024-03-12 00:30:24,314 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 198.0) internal successors, (1386), 7 states have internal predecessors, (1386), 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)
[2024-03-12 00:30:24,314 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 198.0) internal successors, (1386), 7 states have internal predecessors, (1386), 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)
[2024-03-12 00:30:24,314 INFO  L175             Difference]: Start difference. First operand has 248 places, 270 transitions, 1209 flow. Second operand 6 states and 1076 transitions.
[2024-03-12 00:30:24,314 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 365 transitions, 2029 flow
[2024-03-12 00:30:24,321 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 365 transitions, 2025 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-12 00:30:24,325 INFO  L231             Difference]: Finished difference. Result has 257 places, 352 transitions, 2039 flow
[2024-03-12 00:30:24,325 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=1205, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2039, PETRI_PLACES=257, PETRI_TRANSITIONS=352}
[2024-03-12 00:30:24,325 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 67 predicate places.
[2024-03-12 00:30:24,325 INFO  L495      AbstractCegarLoop]: Abstraction has has 257 places, 352 transitions, 2039 flow
[2024-03-12 00:30:24,326 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 164.0) internal successors, (984), 6 states have internal predecessors, (984), 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)
[2024-03-12 00:30:24,326 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:30:24,326 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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]
[2024-03-12 00:30:24,326 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-03-12 00:30:24,326 INFO  L420      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:30:24,326 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:30:24,326 INFO  L85        PathProgramCache]: Analyzing trace with hash 348766831, now seen corresponding path program 1 times
[2024-03-12 00:30:24,326 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:30:24,326 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170338956]
[2024-03-12 00:30:24,327 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:30:24,327 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:30:24,345 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:30:24,450 INFO  L134       CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2024-03-12 00:30:24,450 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:30:24,450 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170338956]
[2024-03-12 00:30:24,450 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170338956] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 00:30:24,450 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470312824]
[2024-03-12 00:30:24,450 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:30:24,451 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 00:30:24,451 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 00:30:24,452 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-12 00:30:24,461 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-03-12 00:30:24,599 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:30:24,602 INFO  L262         TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 6 conjunts are in the unsatisfiable core
[2024-03-12 00:30:24,611 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 00:30:24,806 INFO  L134       CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:30:24,806 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-03-12 00:30:24,806 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [470312824] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:30:24,806 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-03-12 00:30:24,807 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 10
[2024-03-12 00:30:24,807 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402254639]
[2024-03-12 00:30:24,807 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:30:24,807 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-03-12 00:30:24,807 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:30:24,808 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-03-12 00:30:24,808 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2024-03-12 00:30:24,874 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 172 out of 198
[2024-03-12 00:30:24,875 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 352 transitions, 2039 flow. Second operand  has 7 states, 7 states have (on average 174.85714285714286) internal successors, (1224), 7 states have internal predecessors, (1224), 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)
[2024-03-12 00:30:24,875 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:30:24,875 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 198
[2024-03-12 00:30:24,875 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:30:25,177 INFO  L124   PetriNetUnfolderBase]: 342/1608 cut-off events.
[2024-03-12 00:30:25,177 INFO  L125   PetriNetUnfolderBase]: For 1588/1841 co-relation queries the response was YES.
[2024-03-12 00:30:25,184 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4211 conditions, 1608 events. 342/1608 cut-off events. For 1588/1841 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 10693 event pairs, 31 based on Foata normal form. 2/1580 useless extension candidates. Maximal degree in co-relation 4079. Up to 280 conditions per place. 
[2024-03-12 00:30:25,188 INFO  L140   encePairwiseOnDemand]: 187/198 looper letters, 37 selfloop transitions, 30 changer transitions 1/375 dead transitions.
[2024-03-12 00:30:25,188 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 375 transitions, 2292 flow
[2024-03-12 00:30:25,188 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-03-12 00:30:25,188 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-03-12 00:30:25,190 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1942 transitions.
[2024-03-12 00:30:25,191 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.891643709825528
[2024-03-12 00:30:25,191 INFO  L72            ComplementDD]: Start complementDD. Operand 11 states and 1942 transitions.
[2024-03-12 00:30:25,191 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 11 states and 1942 transitions.
[2024-03-12 00:30:25,191 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:30:25,192 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1942 transitions.
[2024-03-12 00:30:25,194 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 12 states, 11 states have (on average 176.54545454545453) internal successors, (1942), 11 states have internal predecessors, (1942), 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)
[2024-03-12 00:30:25,196 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 12 states, 12 states have (on average 198.0) internal successors, (2376), 12 states have internal predecessors, (2376), 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)
[2024-03-12 00:30:25,196 INFO  L81            ComplementDD]: Finished complementDD. Result  has 12 states, 12 states have (on average 198.0) internal successors, (2376), 12 states have internal predecessors, (2376), 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)
[2024-03-12 00:30:25,196 INFO  L175             Difference]: Start difference. First operand has 257 places, 352 transitions, 2039 flow. Second operand 11 states and 1942 transitions.
[2024-03-12 00:30:25,196 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 375 transitions, 2292 flow
[2024-03-12 00:30:25,209 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 375 transitions, 2220 flow, removed 36 selfloop flow, removed 0 redundant places.
[2024-03-12 00:30:25,213 INFO  L231             Difference]: Finished difference. Result has 271 places, 361 transitions, 2119 flow
[2024-03-12 00:30:25,214 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=1967, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=326, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2119, PETRI_PLACES=271, PETRI_TRANSITIONS=361}
[2024-03-12 00:30:25,214 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 81 predicate places.
[2024-03-12 00:30:25,214 INFO  L495      AbstractCegarLoop]: Abstraction has has 271 places, 361 transitions, 2119 flow
[2024-03-12 00:30:25,214 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 174.85714285714286) internal successors, (1224), 7 states have internal predecessors, (1224), 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)
[2024-03-12 00:30:25,214 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:30:25,215 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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]
[2024-03-12 00:30:25,224 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2024-03-12 00:30:25,415 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 00:30:25,416 INFO  L420      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:30:25,416 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:30:25,416 INFO  L85        PathProgramCache]: Analyzing trace with hash -253745276, now seen corresponding path program 1 times
[2024-03-12 00:30:25,416 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:30:25,416 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589228834]
[2024-03-12 00:30:25,416 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:30:25,416 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:30:25,451 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-12 00:30:25,451 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-03-12 00:30:25,467 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-12 00:30:25,493 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-03-12 00:30:25,493 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-03-12 00:30:25,494 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 18 remaining)
[2024-03-12 00:30:25,495 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (16 of 18 remaining)
[2024-03-12 00:30:25,496 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (15 of 18 remaining)
[2024-03-12 00:30:25,496 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (14 of 18 remaining)
[2024-03-12 00:30:25,496 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (13 of 18 remaining)
[2024-03-12 00:30:25,496 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (12 of 18 remaining)
[2024-03-12 00:30:25,496 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (11 of 18 remaining)
[2024-03-12 00:30:25,496 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (10 of 18 remaining)
[2024-03-12 00:30:25,496 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (9 of 18 remaining)
[2024-03-12 00:30:25,496 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (8 of 18 remaining)
[2024-03-12 00:30:25,496 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (7 of 18 remaining)
[2024-03-12 00:30:25,496 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (6 of 18 remaining)
[2024-03-12 00:30:25,496 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (5 of 18 remaining)
[2024-03-12 00:30:25,496 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (4 of 18 remaining)
[2024-03-12 00:30:25,497 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 18 remaining)
[2024-03-12 00:30:25,497 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 18 remaining)
[2024-03-12 00:30:25,497 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (1 of 18 remaining)
[2024-03-12 00:30:25,497 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (0 of 18 remaining)
[2024-03-12 00:30:25,497 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2024-03-12 00:30:25,497 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:30:25,499 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-03-12 00:30:25,499 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2024-03-12 00:30:25,528 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2024-03-12 00:30:25,531 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 239 places, 249 transitions, 514 flow
[2024-03-12 00:30:25,577 INFO  L124   PetriNetUnfolderBase]: 27/482 cut-off events.
[2024-03-12 00:30:25,577 INFO  L125   PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES.
[2024-03-12 00:30:25,578 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 494 conditions, 482 events. 27/482 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1191 event pairs, 0 based on Foata normal form. 0/414 useless extension candidates. Maximal degree in co-relation 289. Up to 9 conditions per place. 
[2024-03-12 00:30:25,578 INFO  L82        GeneralOperation]: Start removeDead. Operand has 239 places, 249 transitions, 514 flow
[2024-03-12 00:30:25,581 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 239 places, 249 transitions, 514 flow
[2024-03-12 00:30:25,582 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-12 00:30:25,582 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=LoopHeads, 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;@49b92709, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-03-12 00:30:25,582 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 22 error locations.
[2024-03-12 00:30:25,584 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-03-12 00:30:25,584 INFO  L124   PetriNetUnfolderBase]: 2/41 cut-off events.
[2024-03-12 00:30:25,584 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-03-12 00:30:25,584 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:30:25,584 INFO  L208   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]
[2024-03-12 00:30:25,584 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)] ===
[2024-03-12 00:30:25,584 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:30:25,584 INFO  L85        PathProgramCache]: Analyzing trace with hash -374805103, now seen corresponding path program 1 times
[2024-03-12 00:30:25,584 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:30:25,584 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836964500]
[2024-03-12 00:30:25,584 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:30:25,584 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:30:25,590 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:30:25,599 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:30:25,599 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:30:25,599 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836964500]
[2024-03-12 00:30:25,599 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836964500] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:30:25,599 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:30:25,599 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 00:30:25,599 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581869582]
[2024-03-12 00:30:25,599 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:30:25,600 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 00:30:25,600 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:30:25,600 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 00:30:25,600 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 00:30:25,614 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 225 out of 249
[2024-03-12 00:30:25,615 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 249 transitions, 514 flow. Second operand  has 3 states, 3 states have (on average 226.33333333333334) internal successors, (679), 3 states have internal predecessors, (679), 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)
[2024-03-12 00:30:25,615 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:30:25,615 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 249
[2024-03-12 00:30:25,615 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:30:25,813 INFO  L124   PetriNetUnfolderBase]: 237/2093 cut-off events.
[2024-03-12 00:30:25,813 INFO  L125   PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES.
[2024-03-12 00:30:25,819 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2380 conditions, 2093 events. 237/2093 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 14968 event pairs, 132 based on Foata normal form. 41/1828 useless extension candidates. Maximal degree in co-relation 1763. Up to 258 conditions per place. 
[2024-03-12 00:30:25,825 INFO  L140   encePairwiseOnDemand]: 242/249 looper letters, 17 selfloop transitions, 2 changer transitions 2/244 dead transitions.
[2024-03-12 00:30:25,825 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 244 transitions, 542 flow
[2024-03-12 00:30:25,826 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 00:30:25,826 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 00:30:25,826 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 699 transitions.
[2024-03-12 00:30:25,827 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9357429718875502
[2024-03-12 00:30:25,827 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 699 transitions.
[2024-03-12 00:30:25,827 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 699 transitions.
[2024-03-12 00:30:25,827 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:30:25,827 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 699 transitions.
[2024-03-12 00:30:25,828 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 233.0) internal successors, (699), 3 states have internal predecessors, (699), 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)
[2024-03-12 00:30:25,829 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 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)
[2024-03-12 00:30:25,829 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 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)
[2024-03-12 00:30:25,829 INFO  L175             Difference]: Start difference. First operand has 239 places, 249 transitions, 514 flow. Second operand 3 states and 699 transitions.
[2024-03-12 00:30:25,829 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 244 transitions, 542 flow
[2024-03-12 00:30:25,830 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 244 transitions, 542 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-12 00:30:25,832 INFO  L231             Difference]: Finished difference. Result has 240 places, 242 transitions, 504 flow
[2024-03-12 00:30:25,832 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=504, PETRI_PLACES=240, PETRI_TRANSITIONS=242}
[2024-03-12 00:30:25,833 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 1 predicate places.
[2024-03-12 00:30:25,833 INFO  L495      AbstractCegarLoop]: Abstraction has has 240 places, 242 transitions, 504 flow
[2024-03-12 00:30:25,833 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 226.33333333333334) internal successors, (679), 3 states have internal predecessors, (679), 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)
[2024-03-12 00:30:25,833 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:30:25,833 INFO  L208   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, 1, 1]
[2024-03-12 00:30:25,833 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-03-12 00:30:25,833 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)] ===
[2024-03-12 00:30:25,833 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:30:25,833 INFO  L85        PathProgramCache]: Analyzing trace with hash -142666101, now seen corresponding path program 1 times
[2024-03-12 00:30:25,834 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:30:25,834 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975267275]
[2024-03-12 00:30:25,834 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:30:25,834 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:30:25,840 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:30:25,850 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:30:25,850 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:30:25,850 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975267275]
[2024-03-12 00:30:25,851 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975267275] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:30:25,851 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:30:25,851 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 00:30:25,851 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830130713]
[2024-03-12 00:30:25,851 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:30:25,851 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 00:30:25,851 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:30:25,852 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 00:30:25,852 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 00:30:25,867 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 220 out of 249
[2024-03-12 00:30:25,867 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 242 transitions, 504 flow. Second operand  has 3 states, 3 states have (on average 221.0) internal successors, (663), 3 states have internal predecessors, (663), 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)
[2024-03-12 00:30:25,867 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:30:25,867 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 220 of 249
[2024-03-12 00:30:25,867 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:30:26,442 INFO  L124   PetriNetUnfolderBase]: 1304/6602 cut-off events.
[2024-03-12 00:30:26,443 INFO  L125   PetriNetUnfolderBase]: For 129/157 co-relation queries the response was YES.
[2024-03-12 00:30:26,455 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8251 conditions, 6602 events. 1304/6602 cut-off events. For 129/157 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 64672 event pairs, 333 based on Foata normal form. 3/5617 useless extension candidates. Maximal degree in co-relation 8204. Up to 850 conditions per place. 
[2024-03-12 00:30:26,470 INFO  L140   encePairwiseOnDemand]: 234/249 looper letters, 34 selfloop transitions, 11 changer transitions 0/262 dead transitions.
[2024-03-12 00:30:26,470 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 262 transitions, 645 flow
[2024-03-12 00:30:26,470 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 00:30:26,471 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 00:30:26,471 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 709 transitions.
[2024-03-12 00:30:26,471 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9491298527443106
[2024-03-12 00:30:26,471 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 709 transitions.
[2024-03-12 00:30:26,471 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 709 transitions.
[2024-03-12 00:30:26,472 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:30:26,472 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 709 transitions.
[2024-03-12 00:30:26,472 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 236.33333333333334) internal successors, (709), 3 states have internal predecessors, (709), 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)
[2024-03-12 00:30:26,473 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 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)
[2024-03-12 00:30:26,473 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 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)
[2024-03-12 00:30:26,473 INFO  L175             Difference]: Start difference. First operand has 240 places, 242 transitions, 504 flow. Second operand 3 states and 709 transitions.
[2024-03-12 00:30:26,474 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 262 transitions, 645 flow
[2024-03-12 00:30:26,475 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 262 transitions, 641 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-12 00:30:26,477 INFO  L231             Difference]: Finished difference. Result has 240 places, 253 transitions, 596 flow
[2024-03-12 00:30:26,477 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=500, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=596, PETRI_PLACES=240, PETRI_TRANSITIONS=253}
[2024-03-12 00:30:26,478 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 1 predicate places.
[2024-03-12 00:30:26,478 INFO  L495      AbstractCegarLoop]: Abstraction has has 240 places, 253 transitions, 596 flow
[2024-03-12 00:30:26,478 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 221.0) internal successors, (663), 3 states have internal predecessors, (663), 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)
[2024-03-12 00:30:26,478 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:30:26,478 INFO  L208   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, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:30:26,478 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-03-12 00:30:26,478 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)] ===
[2024-03-12 00:30:26,478 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:30:26,478 INFO  L85        PathProgramCache]: Analyzing trace with hash -1327929248, now seen corresponding path program 1 times
[2024-03-12 00:30:26,479 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:30:26,479 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573050384]
[2024-03-12 00:30:26,479 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:30:26,479 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:30:26,486 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:30:26,518 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:30:26,518 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:30:26,518 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573050384]
[2024-03-12 00:30:26,519 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573050384] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:30:26,519 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:30:26,519 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 00:30:26,519 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270897716]
[2024-03-12 00:30:26,519 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:30:26,519 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-03-12 00:30:26,519 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:30:26,519 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-03-12 00:30:26,520 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-03-12 00:30:26,558 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 224 out of 249
[2024-03-12 00:30:26,559 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 253 transitions, 596 flow. Second operand  has 5 states, 5 states have (on average 225.4) internal successors, (1127), 5 states have internal predecessors, (1127), 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)
[2024-03-12 00:30:26,559 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:30:26,559 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 249
[2024-03-12 00:30:26,559 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:30:27,374 INFO  L124   PetriNetUnfolderBase]: 1130/8214 cut-off events.
[2024-03-12 00:30:27,374 INFO  L125   PetriNetUnfolderBase]: For 387/407 co-relation queries the response was YES.
[2024-03-12 00:30:27,391 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10175 conditions, 8214 events. 1130/8214 cut-off events. For 387/407 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 90789 event pairs, 272 based on Foata normal form. 1/7119 useless extension candidates. Maximal degree in co-relation 6038. Up to 613 conditions per place. 
[2024-03-12 00:30:27,409 INFO  L140   encePairwiseOnDemand]: 241/249 looper letters, 24 selfloop transitions, 6 changer transitions 1/263 dead transitions.
[2024-03-12 00:30:27,409 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 263 transitions, 678 flow
[2024-03-12 00:30:27,410 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 00:30:27,410 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 00:30:27,410 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1376 transitions.
[2024-03-12 00:30:27,411 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9210174029451138
[2024-03-12 00:30:27,411 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 1376 transitions.
[2024-03-12 00:30:27,411 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 1376 transitions.
[2024-03-12 00:30:27,411 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:30:27,411 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1376 transitions.
[2024-03-12 00:30:27,413 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 229.33333333333334) internal successors, (1376), 6 states have internal predecessors, (1376), 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)
[2024-03-12 00:30:27,414 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 249.0) internal successors, (1743), 7 states have internal predecessors, (1743), 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)
[2024-03-12 00:30:27,414 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 249.0) internal successors, (1743), 7 states have internal predecessors, (1743), 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)
[2024-03-12 00:30:27,414 INFO  L175             Difference]: Start difference. First operand has 240 places, 253 transitions, 596 flow. Second operand 6 states and 1376 transitions.
[2024-03-12 00:30:27,415 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 263 transitions, 678 flow
[2024-03-12 00:30:27,418 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 263 transitions, 656 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-12 00:30:27,420 INFO  L231             Difference]: Finished difference. Result has 247 places, 258 transitions, 620 flow
[2024-03-12 00:30:27,420 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=574, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=620, PETRI_PLACES=247, PETRI_TRANSITIONS=258}
[2024-03-12 00:30:27,420 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 8 predicate places.
[2024-03-12 00:30:27,420 INFO  L495      AbstractCegarLoop]: Abstraction has has 247 places, 258 transitions, 620 flow
[2024-03-12 00:30:27,421 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 225.4) internal successors, (1127), 5 states have internal predecessors, (1127), 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)
[2024-03-12 00:30:27,421 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:30:27,421 INFO  L208   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, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:30:27,421 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2024-03-12 00:30:27,421 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)] ===
[2024-03-12 00:30:27,421 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:30:27,421 INFO  L85        PathProgramCache]: Analyzing trace with hash 1301098499, now seen corresponding path program 1 times
[2024-03-12 00:30:27,421 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:30:27,421 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208658725]
[2024-03-12 00:30:27,421 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:30:27,421 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:30:27,430 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:30:27,609 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:30:27,609 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:30:27,610 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208658725]
[2024-03-12 00:30:27,610 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208658725] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:30:27,610 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:30:27,610 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 00:30:27,610 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668704592]
[2024-03-12 00:30:27,610 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:30:27,610 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-12 00:30:27,610 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:30:27,610 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-12 00:30:27,611 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-12 00:30:27,752 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 205 out of 249
[2024-03-12 00:30:27,753 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 258 transitions, 620 flow. Second operand  has 6 states, 6 states have (on average 206.16666666666666) internal successors, (1237), 6 states have internal predecessors, (1237), 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)
[2024-03-12 00:30:27,753 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:30:27,753 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 249
[2024-03-12 00:30:27,753 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:30:30,545 INFO  L124   PetriNetUnfolderBase]: 6115/25294 cut-off events.
[2024-03-12 00:30:30,545 INFO  L125   PetriNetUnfolderBase]: For 330/330 co-relation queries the response was YES.
[2024-03-12 00:30:30,601 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 35483 conditions, 25294 events. 6115/25294 cut-off events. For 330/330 co-relation queries the response was YES. Maximal size of possible extension queue 704. Compared 314987 event pairs, 1333 based on Foata normal form. 0/22207 useless extension candidates. Maximal degree in co-relation 35326. Up to 5071 conditions per place. 
[2024-03-12 00:30:30,665 INFO  L140   encePairwiseOnDemand]: 222/249 looper letters, 70 selfloop transitions, 48 changer transitions 0/336 dead transitions.
[2024-03-12 00:30:30,665 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 336 transitions, 1023 flow
[2024-03-12 00:30:30,666 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 00:30:30,666 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 00:30:30,667 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1351 transitions.
[2024-03-12 00:30:30,667 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9042838018741634
[2024-03-12 00:30:30,667 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 1351 transitions.
[2024-03-12 00:30:30,667 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 1351 transitions.
[2024-03-12 00:30:30,668 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:30:30,668 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1351 transitions.
[2024-03-12 00:30:30,669 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 225.16666666666666) internal successors, (1351), 6 states have internal predecessors, (1351), 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)
[2024-03-12 00:30:30,671 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 249.0) internal successors, (1743), 7 states have internal predecessors, (1743), 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)
[2024-03-12 00:30:30,671 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 249.0) internal successors, (1743), 7 states have internal predecessors, (1743), 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)
[2024-03-12 00:30:30,671 INFO  L175             Difference]: Start difference. First operand has 247 places, 258 transitions, 620 flow. Second operand 6 states and 1351 transitions.
[2024-03-12 00:30:30,671 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 336 transitions, 1023 flow
[2024-03-12 00:30:30,674 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 336 transitions, 1021 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-12 00:30:30,676 INFO  L231             Difference]: Finished difference. Result has 256 places, 306 transitions, 960 flow
[2024-03-12 00:30:30,676 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=618, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=960, PETRI_PLACES=256, PETRI_TRANSITIONS=306}
[2024-03-12 00:30:30,677 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 17 predicate places.
[2024-03-12 00:30:30,677 INFO  L495      AbstractCegarLoop]: Abstraction has has 256 places, 306 transitions, 960 flow
[2024-03-12 00:30:30,677 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 206.16666666666666) internal successors, (1237), 6 states have internal predecessors, (1237), 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)
[2024-03-12 00:30:30,677 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:30:30,677 INFO  L208   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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:30:30,677 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2024-03-12 00:30:30,677 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-12 00:30:30,677 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:30:30,678 INFO  L85        PathProgramCache]: Analyzing trace with hash 1689398323, now seen corresponding path program 1 times
[2024-03-12 00:30:30,678 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:30:30,678 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751628889]
[2024-03-12 00:30:30,678 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:30:30,678 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:30:30,686 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:30:30,699 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:30:30,699 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:30:30,699 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751628889]
[2024-03-12 00:30:30,699 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751628889] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:30:30,699 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:30:30,700 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 00:30:30,700 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973247346]
[2024-03-12 00:30:30,700 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:30:30,700 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 00:30:30,700 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:30:30,700 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 00:30:30,700 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 00:30:30,716 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 225 out of 249
[2024-03-12 00:30:30,716 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 306 transitions, 960 flow. Second operand  has 3 states, 3 states have (on average 226.0) internal successors, (678), 3 states have internal predecessors, (678), 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)
[2024-03-12 00:30:30,716 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:30:30,716 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 249
[2024-03-12 00:30:30,716 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:30:32,232 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([605] L1061-5-->L1061-6: Formula: (let ((.cse0 (select |v_#race_30| |v_ULTIMATE.start_main_~#tids~0#1.base_17|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 1)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 3)) 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_17|))))  InVars {#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  OutVars{#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  AuxVars[]  AssignedVars[][206], [278#(= |#race~datas~0| 0), 120#L1044-9true, 24#L1061-6true, Black: 255#(<= |ULTIMATE.start_main_~breads_total~0#1| 0), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 258#(and (<= |ULTIMATE.start_main_~breads_total~0#1| 0) (= |ULTIMATE.start_main_~i~0#1| 0)), Black: 256#(and (<= |ULTIMATE.start_main_~breads_total~0#1| 0) (= |ULTIMATE.start_main_~i~1#1| 0)), 269#(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: 268#(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)), threadThread2of2ForFork0InUse, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 264#true, Black: 267#(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)), 135#L1044-8true, Black: 248#(= |#race~threads_mask~0| 0)])
[2024-03-12 00:30:32,232 INFO  L294   olderBase$Statistics]: this new event has 186 ancestors and is not cut-off event
[2024-03-12 00:30:32,232 INFO  L297   olderBase$Statistics]:   existing Event has 186 ancestors and is not cut-off event
[2024-03-12 00:30:32,232 INFO  L297   olderBase$Statistics]:   existing Event has 186 ancestors and is not cut-off event
[2024-03-12 00:30:32,232 INFO  L297   olderBase$Statistics]:   existing Event has 186 ancestors and is not cut-off event
[2024-03-12 00:30:32,271 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([605] L1061-5-->L1061-6: Formula: (let ((.cse0 (select |v_#race_30| |v_ULTIMATE.start_main_~#tids~0#1.base_17|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 1)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 3)) 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_17|))))  InVars {#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  OutVars{#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  AuxVars[]  AssignedVars[][206], [278#(= |#race~datas~0| 0), 24#L1061-6true, Black: 255#(<= |ULTIMATE.start_main_~breads_total~0#1| 0), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 258#(and (<= |ULTIMATE.start_main_~breads_total~0#1| 0) (= |ULTIMATE.start_main_~i~0#1| 0)), Black: 256#(and (<= |ULTIMATE.start_main_~breads_total~0#1| 0) (= |ULTIMATE.start_main_~i~1#1| 0)), 269#(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)), 100#L1044-10true, threadThread1of2ForFork0InUse, Black: 268#(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)), threadThread2of2ForFork0InUse, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 264#true, Black: 267#(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)), 135#L1044-8true, Black: 248#(= |#race~threads_mask~0| 0)])
[2024-03-12 00:30:32,271 INFO  L294   olderBase$Statistics]: this new event has 187 ancestors and is not cut-off event
[2024-03-12 00:30:32,271 INFO  L297   olderBase$Statistics]:   existing Event has 187 ancestors and is not cut-off event
[2024-03-12 00:30:32,271 INFO  L297   olderBase$Statistics]:   existing Event has 187 ancestors and is not cut-off event
[2024-03-12 00:30:32,271 INFO  L297   olderBase$Statistics]:   existing Event has 187 ancestors and is not cut-off event
[2024-03-12 00:30:32,657 INFO  L124   PetriNetUnfolderBase]: 3676/17009 cut-off events.
[2024-03-12 00:30:32,657 INFO  L125   PetriNetUnfolderBase]: For 1920/2089 co-relation queries the response was YES.
[2024-03-12 00:30:32,716 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28049 conditions, 17009 events. 3676/17009 cut-off events. For 1920/2089 co-relation queries the response was YES. Maximal size of possible extension queue 430. Compared 201442 event pairs, 696 based on Foata normal form. 0/15433 useless extension candidates. Maximal degree in co-relation 18452. Up to 3253 conditions per place. 
[2024-03-12 00:30:32,774 INFO  L140   encePairwiseOnDemand]: 243/249 looper letters, 24 selfloop transitions, 3 changer transitions 4/313 dead transitions.
[2024-03-12 00:30:32,775 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 313 transitions, 1033 flow
[2024-03-12 00:30:32,775 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 00:30:32,775 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 00:30:32,776 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 705 transitions.
[2024-03-12 00:30:32,776 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9437751004016064
[2024-03-12 00:30:32,776 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 705 transitions.
[2024-03-12 00:30:32,776 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 705 transitions.
[2024-03-12 00:30:32,777 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:30:32,777 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 705 transitions.
[2024-03-12 00:30:32,778 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 235.0) internal successors, (705), 3 states have internal predecessors, (705), 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)
[2024-03-12 00:30:32,778 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 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)
[2024-03-12 00:30:32,778 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 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)
[2024-03-12 00:30:32,778 INFO  L175             Difference]: Start difference. First operand has 256 places, 306 transitions, 960 flow. Second operand 3 states and 705 transitions.
[2024-03-12 00:30:32,779 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 313 transitions, 1033 flow
[2024-03-12 00:30:32,804 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 313 transitions, 1033 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-12 00:30:32,807 INFO  L231             Difference]: Finished difference. Result has 256 places, 302 transitions, 951 flow
[2024-03-12 00:30:32,807 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=954, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=951, PETRI_PLACES=256, PETRI_TRANSITIONS=302}
[2024-03-12 00:30:32,807 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 17 predicate places.
[2024-03-12 00:30:32,807 INFO  L495      AbstractCegarLoop]: Abstraction has has 256 places, 302 transitions, 951 flow
[2024-03-12 00:30:32,808 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 226.0) internal successors, (678), 3 states have internal predecessors, (678), 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)
[2024-03-12 00:30:32,808 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:30:32,808 INFO  L208   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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:30:32,808 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2024-03-12 00:30:32,808 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-12 00:30:32,808 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:30:32,809 INFO  L85        PathProgramCache]: Analyzing trace with hash -1442435521, now seen corresponding path program 1 times
[2024-03-12 00:30:32,809 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:30:32,809 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178561261]
[2024-03-12 00:30:32,809 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:30:32,809 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:30:32,818 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:30:32,860 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:30:32,860 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:30:32,861 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178561261]
[2024-03-12 00:30:32,861 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178561261] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:30:32,861 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:30:32,861 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-03-12 00:30:32,861 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088143370]
[2024-03-12 00:30:32,861 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:30:32,862 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-03-12 00:30:32,862 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:30:32,862 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-03-12 00:30:32,863 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-03-12 00:30:32,919 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 225 out of 249
[2024-03-12 00:30:32,920 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 302 transitions, 951 flow. Second operand  has 4 states, 4 states have (on average 226.5) internal successors, (906), 4 states have internal predecessors, (906), 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)
[2024-03-12 00:30:32,920 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:30:32,920 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 249
[2024-03-12 00:30:32,920 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:30:34,884 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([605] L1061-5-->L1061-6: Formula: (let ((.cse0 (select |v_#race_30| |v_ULTIMATE.start_main_~#tids~0#1.base_17|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 1)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 3)) 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_17|))))  InVars {#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  OutVars{#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  AuxVars[]  AssignedVars[][202], [120#L1044-9true, 278#(= |#race~datas~0| 0), 281#true, 24#L1061-6true, Black: 255#(<= |ULTIMATE.start_main_~breads_total~0#1| 0), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 258#(and (<= |ULTIMATE.start_main_~breads_total~0#1| 0) (= |ULTIMATE.start_main_~i~0#1| 0)), Black: 256#(and (<= |ULTIMATE.start_main_~breads_total~0#1| 0) (= |ULTIMATE.start_main_~i~1#1| 0)), 269#(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: 268#(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)), threadThread2of2ForFork0InUse, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 264#true, Black: 267#(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: 276#true, 135#L1044-8true, Black: 248#(= |#race~threads_mask~0| 0)])
[2024-03-12 00:30:34,884 INFO  L294   olderBase$Statistics]: this new event has 186 ancestors and is not cut-off event
[2024-03-12 00:30:34,884 INFO  L297   olderBase$Statistics]:   existing Event has 186 ancestors and is not cut-off event
[2024-03-12 00:30:34,884 INFO  L297   olderBase$Statistics]:   existing Event has 186 ancestors and is not cut-off event
[2024-03-12 00:30:34,884 INFO  L297   olderBase$Statistics]:   existing Event has 186 ancestors and is not cut-off event
[2024-03-12 00:30:34,925 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([605] L1061-5-->L1061-6: Formula: (let ((.cse0 (select |v_#race_30| |v_ULTIMATE.start_main_~#tids~0#1.base_17|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 1)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 3)) 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_17|))))  InVars {#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  OutVars{#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  AuxVars[]  AssignedVars[][202], [278#(= |#race~datas~0| 0), 281#true, 24#L1061-6true, Black: 255#(<= |ULTIMATE.start_main_~breads_total~0#1| 0), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 258#(and (<= |ULTIMATE.start_main_~breads_total~0#1| 0) (= |ULTIMATE.start_main_~i~0#1| 0)), Black: 256#(and (<= |ULTIMATE.start_main_~breads_total~0#1| 0) (= |ULTIMATE.start_main_~i~1#1| 0)), 269#(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)), 100#L1044-10true, threadThread1of2ForFork0InUse, Black: 268#(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)), threadThread2of2ForFork0InUse, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 264#true, Black: 267#(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: 276#true, 135#L1044-8true, Black: 248#(= |#race~threads_mask~0| 0)])
[2024-03-12 00:30:34,925 INFO  L294   olderBase$Statistics]: this new event has 187 ancestors and is not cut-off event
[2024-03-12 00:30:34,925 INFO  L297   olderBase$Statistics]:   existing Event has 187 ancestors and is not cut-off event
[2024-03-12 00:30:34,926 INFO  L297   olderBase$Statistics]:   existing Event has 187 ancestors and is not cut-off event
[2024-03-12 00:30:34,926 INFO  L297   olderBase$Statistics]:   existing Event has 187 ancestors and is not cut-off event
[2024-03-12 00:30:34,931 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([531] L1063-5-->L1063-6: Formula: (let ((.cse0 (select |v_#race_50| |v_ULTIMATE.start_main_~#tids~0#1.base_24|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 1)) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_24|) 0)))  InVars {#race=|v_#race_50|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  OutVars{#race=|v_#race_50|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  AuxVars[]  AssignedVars[][209], [278#(= |#race~datas~0| 0), 120#L1044-9true, 281#true, Black: 255#(<= |ULTIMATE.start_main_~breads_total~0#1| 0), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 258#(and (<= |ULTIMATE.start_main_~breads_total~0#1| 0) (= |ULTIMATE.start_main_~i~0#1| 0)), Black: 256#(and (<= |ULTIMATE.start_main_~breads_total~0#1| 0) (= |ULTIMATE.start_main_~i~1#1| 0)), 269#(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: 268#(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)), threadThread2of2ForFork0InUse, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 264#true, Black: 267#(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: 276#true, 135#L1044-8true, Black: 248#(= |#race~threads_mask~0| 0), 22#L1063-6true])
[2024-03-12 00:30:34,932 INFO  L294   olderBase$Statistics]: this new event has 187 ancestors and is not cut-off event
[2024-03-12 00:30:34,932 INFO  L297   olderBase$Statistics]:   existing Event has 187 ancestors and is not cut-off event
[2024-03-12 00:30:34,932 INFO  L297   olderBase$Statistics]:   existing Event has 187 ancestors and is not cut-off event
[2024-03-12 00:30:34,932 INFO  L297   olderBase$Statistics]:   existing Event has 187 ancestors and is not cut-off event
[2024-03-12 00:30:34,969 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([531] L1063-5-->L1063-6: Formula: (let ((.cse0 (select |v_#race_50| |v_ULTIMATE.start_main_~#tids~0#1.base_24|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 1)) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_24|) 0)))  InVars {#race=|v_#race_50|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  OutVars{#race=|v_#race_50|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  AuxVars[]  AssignedVars[][209], [278#(= |#race~datas~0| 0), 281#true, Black: 255#(<= |ULTIMATE.start_main_~breads_total~0#1| 0), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 258#(and (<= |ULTIMATE.start_main_~breads_total~0#1| 0) (= |ULTIMATE.start_main_~i~0#1| 0)), Black: 256#(and (<= |ULTIMATE.start_main_~breads_total~0#1| 0) (= |ULTIMATE.start_main_~i~1#1| 0)), 269#(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)), 100#L1044-10true, threadThread1of2ForFork0InUse, Black: 268#(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)), threadThread2of2ForFork0InUse, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 264#true, Black: 267#(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: 276#true, 135#L1044-8true, Black: 248#(= |#race~threads_mask~0| 0), 22#L1063-6true])
[2024-03-12 00:30:34,969 INFO  L294   olderBase$Statistics]: this new event has 188 ancestors and is not cut-off event
[2024-03-12 00:30:34,969 INFO  L297   olderBase$Statistics]:   existing Event has 188 ancestors and is not cut-off event
[2024-03-12 00:30:34,969 INFO  L297   olderBase$Statistics]:   existing Event has 188 ancestors and is not cut-off event
[2024-03-12 00:30:34,969 INFO  L297   olderBase$Statistics]:   existing Event has 188 ancestors and is not cut-off event
[2024-03-12 00:30:35,396 INFO  L124   PetriNetUnfolderBase]: 4343/21480 cut-off events.
[2024-03-12 00:30:35,396 INFO  L125   PetriNetUnfolderBase]: For 2133/2329 co-relation queries the response was YES.
[2024-03-12 00:30:35,452 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 34638 conditions, 21480 events. 4343/21480 cut-off events. For 2133/2329 co-relation queries the response was YES. Maximal size of possible extension queue 516. Compared 270826 event pairs, 1203 based on Foata normal form. 1/19428 useless extension candidates. Maximal degree in co-relation 21579. Up to 3810 conditions per place. 
[2024-03-12 00:30:35,497 INFO  L140   encePairwiseOnDemand]: 245/249 looper letters, 22 selfloop transitions, 4 changer transitions 0/308 dead transitions.
[2024-03-12 00:30:35,497 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 308 transitions, 1015 flow
[2024-03-12 00:30:35,498 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-12 00:30:35,498 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-12 00:30:35,499 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 927 transitions.
[2024-03-12 00:30:35,499 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9307228915662651
[2024-03-12 00:30:35,499 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 927 transitions.
[2024-03-12 00:30:35,499 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 927 transitions.
[2024-03-12 00:30:35,499 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:30:35,499 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 927 transitions.
[2024-03-12 00:30:35,500 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 231.75) internal successors, (927), 4 states have internal predecessors, (927), 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)
[2024-03-12 00:30:35,501 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 249.0) internal successors, (1245), 5 states have internal predecessors, (1245), 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)
[2024-03-12 00:30:35,501 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 249.0) internal successors, (1245), 5 states have internal predecessors, (1245), 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)
[2024-03-12 00:30:35,501 INFO  L175             Difference]: Start difference. First operand has 256 places, 302 transitions, 951 flow. Second operand 4 states and 927 transitions.
[2024-03-12 00:30:35,501 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 308 transitions, 1015 flow
[2024-03-12 00:30:35,521 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 308 transitions, 1005 flow, removed 5 selfloop flow, removed 3 redundant places.
[2024-03-12 00:30:35,523 INFO  L231             Difference]: Finished difference. Result has 255 places, 305 transitions, 966 flow
[2024-03-12 00:30:35,523 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=941, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=966, PETRI_PLACES=255, PETRI_TRANSITIONS=305}
[2024-03-12 00:30:35,524 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 16 predicate places.
[2024-03-12 00:30:35,524 INFO  L495      AbstractCegarLoop]: Abstraction has has 255 places, 305 transitions, 966 flow
[2024-03-12 00:30:35,524 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 226.5) internal successors, (906), 4 states have internal predecessors, (906), 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)
[2024-03-12 00:30:35,524 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:30:35,524 INFO  L208   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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:30:35,524 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2024-03-12 00:30:35,524 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-12 00:30:35,524 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:30:35,525 INFO  L85        PathProgramCache]: Analyzing trace with hash -872231085, now seen corresponding path program 1 times
[2024-03-12 00:30:35,525 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:30:35,525 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217202]
[2024-03-12 00:30:35,525 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:30:35,525 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:30:35,536 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:30:35,572 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:30:35,573 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:30:35,573 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217202]
[2024-03-12 00:30:35,573 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217202] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:30:35,573 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:30:35,573 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-03-12 00:30:35,573 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823716631]
[2024-03-12 00:30:35,573 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:30:35,574 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-03-12 00:30:35,574 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:30:35,574 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-03-12 00:30:35,574 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-03-12 00:30:35,653 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 225 out of 249
[2024-03-12 00:30:35,654 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 305 transitions, 966 flow. Second operand  has 4 states, 4 states have (on average 226.5) internal successors, (906), 4 states have internal predecessors, (906), 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)
[2024-03-12 00:30:35,654 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:30:35,654 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 249
[2024-03-12 00:30:35,654 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:30:37,755 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([605] L1061-5-->L1061-6: Formula: (let ((.cse0 (select |v_#race_30| |v_ULTIMATE.start_main_~#tids~0#1.base_17|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 1)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 3)) 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_17|))))  InVars {#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  OutVars{#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  AuxVars[]  AssignedVars[][201], [120#L1044-9true, 278#(= |#race~datas~0| 0), 281#true, 24#L1061-6true, 288#true, Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), 269#(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: 268#(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)), threadThread2of2ForFork0InUse, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 264#true, Black: 267#(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: 276#true, 135#L1044-8true, Black: 248#(= |#race~threads_mask~0| 0), Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0))])
[2024-03-12 00:30:37,755 INFO  L294   olderBase$Statistics]: this new event has 187 ancestors and is not cut-off event
[2024-03-12 00:30:37,755 INFO  L297   olderBase$Statistics]:   existing Event has 187 ancestors and is not cut-off event
[2024-03-12 00:30:37,755 INFO  L297   olderBase$Statistics]:   existing Event has 187 ancestors and is not cut-off event
[2024-03-12 00:30:37,755 INFO  L297   olderBase$Statistics]:   existing Event has 187 ancestors and is not cut-off event
[2024-03-12 00:30:37,787 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([531] L1063-5-->L1063-6: Formula: (let ((.cse0 (select |v_#race_50| |v_ULTIMATE.start_main_~#tids~0#1.base_24|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 1)) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_24|) 0)))  InVars {#race=|v_#race_50|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  OutVars{#race=|v_#race_50|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  AuxVars[]  AssignedVars[][205], [120#L1044-9true, 278#(= |#race~datas~0| 0), 281#true, 288#true, Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), 269#(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: 268#(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)), threadThread2of2ForFork0InUse, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 264#true, Black: 267#(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: 276#true, 135#L1044-8true, Black: 248#(= |#race~threads_mask~0| 0), 22#L1063-6true, Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0))])
[2024-03-12 00:30:37,787 INFO  L294   olderBase$Statistics]: this new event has 188 ancestors and is not cut-off event
[2024-03-12 00:30:37,787 INFO  L297   olderBase$Statistics]:   existing Event has 188 ancestors and is not cut-off event
[2024-03-12 00:30:37,787 INFO  L297   olderBase$Statistics]:   existing Event has 188 ancestors and is not cut-off event
[2024-03-12 00:30:37,787 INFO  L297   olderBase$Statistics]:   existing Event has 188 ancestors and is not cut-off event
[2024-03-12 00:30:37,794 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([605] L1061-5-->L1061-6: Formula: (let ((.cse0 (select |v_#race_30| |v_ULTIMATE.start_main_~#tids~0#1.base_17|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 1)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 3)) 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_17|))))  InVars {#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  OutVars{#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  AuxVars[]  AssignedVars[][201], [278#(= |#race~datas~0| 0), 281#true, 24#L1061-6true, 288#true, Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), 269#(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)), 100#L1044-10true, threadThread1of2ForFork0InUse, Black: 268#(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)), threadThread2of2ForFork0InUse, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 264#true, Black: 267#(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: 276#true, 135#L1044-8true, Black: 248#(= |#race~threads_mask~0| 0), Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0))])
[2024-03-12 00:30:37,794 INFO  L294   olderBase$Statistics]: this new event has 188 ancestors and is not cut-off event
[2024-03-12 00:30:37,794 INFO  L297   olderBase$Statistics]:   existing Event has 188 ancestors and is not cut-off event
[2024-03-12 00:30:37,794 INFO  L297   olderBase$Statistics]:   existing Event has 188 ancestors and is not cut-off event
[2024-03-12 00:30:37,794 INFO  L297   olderBase$Statistics]:   existing Event has 188 ancestors and is not cut-off event
[2024-03-12 00:30:37,824 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([531] L1063-5-->L1063-6: Formula: (let ((.cse0 (select |v_#race_50| |v_ULTIMATE.start_main_~#tids~0#1.base_24|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 1)) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_24|) 0)))  InVars {#race=|v_#race_50|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  OutVars{#race=|v_#race_50|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  AuxVars[]  AssignedVars[][205], [278#(= |#race~datas~0| 0), 281#true, 288#true, Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), 269#(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)), 100#L1044-10true, threadThread1of2ForFork0InUse, Black: 268#(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)), threadThread2of2ForFork0InUse, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 264#true, Black: 267#(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: 276#true, 135#L1044-8true, Black: 248#(= |#race~threads_mask~0| 0), 22#L1063-6true, Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0))])
[2024-03-12 00:30:37,824 INFO  L294   olderBase$Statistics]: this new event has 189 ancestors and is not cut-off event
[2024-03-12 00:30:37,824 INFO  L297   olderBase$Statistics]:   existing Event has 189 ancestors and is not cut-off event
[2024-03-12 00:30:37,824 INFO  L297   olderBase$Statistics]:   existing Event has 189 ancestors and is not cut-off event
[2024-03-12 00:30:37,824 INFO  L297   olderBase$Statistics]:   existing Event has 189 ancestors and is not cut-off event
[2024-03-12 00:30:38,185 INFO  L124   PetriNetUnfolderBase]: 4342/21478 cut-off events.
[2024-03-12 00:30:38,185 INFO  L125   PetriNetUnfolderBase]: For 2294/2485 co-relation queries the response was YES.
[2024-03-12 00:30:38,255 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 34698 conditions, 21478 events. 4342/21478 cut-off events. For 2294/2485 co-relation queries the response was YES. Maximal size of possible extension queue 517. Compared 270714 event pairs, 1203 based on Foata normal form. 1/19377 useless extension candidates. Maximal degree in co-relation 20165. Up to 3810 conditions per place. 
[2024-03-12 00:30:38,313 INFO  L140   encePairwiseOnDemand]: 245/249 looper letters, 21 selfloop transitions, 4 changer transitions 0/307 dead transitions.
[2024-03-12 00:30:38,314 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 307 transitions, 1020 flow
[2024-03-12 00:30:38,314 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-12 00:30:38,315 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-12 00:30:38,315 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 926 transitions.
[2024-03-12 00:30:38,315 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.929718875502008
[2024-03-12 00:30:38,316 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 926 transitions.
[2024-03-12 00:30:38,316 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 926 transitions.
[2024-03-12 00:30:38,316 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:30:38,316 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 926 transitions.
[2024-03-12 00:30:38,317 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 231.5) internal successors, (926), 4 states have internal predecessors, (926), 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)
[2024-03-12 00:30:38,318 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 249.0) internal successors, (1245), 5 states have internal predecessors, (1245), 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)
[2024-03-12 00:30:38,318 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 249.0) internal successors, (1245), 5 states have internal predecessors, (1245), 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)
[2024-03-12 00:30:38,318 INFO  L175             Difference]: Start difference. First operand has 255 places, 305 transitions, 966 flow. Second operand 4 states and 926 transitions.
[2024-03-12 00:30:38,318 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 307 transitions, 1020 flow
[2024-03-12 00:30:38,343 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 307 transitions, 1020 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-12 00:30:38,345 INFO  L231             Difference]: Finished difference. Result has 260 places, 306 transitions, 985 flow
[2024-03-12 00:30:38,346 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=966, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=985, PETRI_PLACES=260, PETRI_TRANSITIONS=306}
[2024-03-12 00:30:38,346 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 21 predicate places.
[2024-03-12 00:30:38,346 INFO  L495      AbstractCegarLoop]: Abstraction has has 260 places, 306 transitions, 985 flow
[2024-03-12 00:30:38,346 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 226.5) internal successors, (906), 4 states have internal predecessors, (906), 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)
[2024-03-12 00:30:38,346 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:30:38,346 INFO  L208   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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:30:38,346 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2024-03-12 00:30:38,347 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-12 00:30:38,347 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:30:38,347 INFO  L85        PathProgramCache]: Analyzing trace with hash -1747450549, now seen corresponding path program 1 times
[2024-03-12 00:30:38,347 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:30:38,347 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473585589]
[2024-03-12 00:30:38,347 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:30:38,347 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:30:38,355 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:30:38,402 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:30:38,402 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:30:38,402 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473585589]
[2024-03-12 00:30:38,402 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473585589] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:30:38,402 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:30:38,403 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-03-12 00:30:38,403 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129331251]
[2024-03-12 00:30:38,403 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:30:38,403 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-03-12 00:30:38,403 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:30:38,404 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-03-12 00:30:38,404 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-03-12 00:30:38,461 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 225 out of 249
[2024-03-12 00:30:38,462 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 306 transitions, 985 flow. Second operand  has 4 states, 4 states have (on average 226.5) internal successors, (906), 4 states have internal predecessors, (906), 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)
[2024-03-12 00:30:38,462 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:30:38,462 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 249
[2024-03-12 00:30:38,462 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:30:40,441 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([605] L1061-5-->L1061-6: Formula: (let ((.cse0 (select |v_#race_30| |v_ULTIMATE.start_main_~#tids~0#1.base_17|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 1)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 3)) 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_17|))))  InVars {#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  OutVars{#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  AuxVars[]  AssignedVars[][202], [120#L1044-9true, 281#true, 278#(= |#race~datas~0| 0), 24#L1061-6true, 288#true, Black: 291#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 290#(<= (+ ~threads_mask~0 1) 0), 269#(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)), 295#true, threadThread1of2ForFork0InUse, Black: 268#(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)), threadThread2of2ForFork0InUse, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 264#true, Black: 267#(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: 276#true, 135#L1044-8true, Black: 248#(= |#race~threads_mask~0| 0), Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0))])
[2024-03-12 00:30:40,441 INFO  L294   olderBase$Statistics]: this new event has 187 ancestors and is not cut-off event
[2024-03-12 00:30:40,441 INFO  L297   olderBase$Statistics]:   existing Event has 187 ancestors and is not cut-off event
[2024-03-12 00:30:40,441 INFO  L297   olderBase$Statistics]:   existing Event has 187 ancestors and is not cut-off event
[2024-03-12 00:30:40,441 INFO  L297   olderBase$Statistics]:   existing Event has 187 ancestors and is not cut-off event
[2024-03-12 00:30:40,472 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([531] L1063-5-->L1063-6: Formula: (let ((.cse0 (select |v_#race_50| |v_ULTIMATE.start_main_~#tids~0#1.base_24|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 1)) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_24|) 0)))  InVars {#race=|v_#race_50|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  OutVars{#race=|v_#race_50|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  AuxVars[]  AssignedVars[][206], [281#true, 278#(= |#race~datas~0| 0), 120#L1044-9true, 288#true, Black: 291#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 290#(<= (+ ~threads_mask~0 1) 0), 269#(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)), 295#true, threadThread1of2ForFork0InUse, Black: 268#(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)), threadThread2of2ForFork0InUse, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 264#true, Black: 267#(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: 276#true, 135#L1044-8true, 22#L1063-6true, Black: 248#(= |#race~threads_mask~0| 0), Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0))])
[2024-03-12 00:30:40,472 INFO  L294   olderBase$Statistics]: this new event has 188 ancestors and is not cut-off event
[2024-03-12 00:30:40,472 INFO  L297   olderBase$Statistics]:   existing Event has 188 ancestors and is not cut-off event
[2024-03-12 00:30:40,472 INFO  L297   olderBase$Statistics]:   existing Event has 188 ancestors and is not cut-off event
[2024-03-12 00:30:40,472 INFO  L297   olderBase$Statistics]:   existing Event has 188 ancestors and is not cut-off event
[2024-03-12 00:30:40,479 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([605] L1061-5-->L1061-6: Formula: (let ((.cse0 (select |v_#race_30| |v_ULTIMATE.start_main_~#tids~0#1.base_17|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 1)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 3)) 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_17|))))  InVars {#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  OutVars{#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  AuxVars[]  AssignedVars[][202], [281#true, 278#(= |#race~datas~0| 0), 24#L1061-6true, 288#true, Black: 291#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 290#(<= (+ ~threads_mask~0 1) 0), 269#(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)), 100#L1044-10true, 295#true, threadThread1of2ForFork0InUse, Black: 268#(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)), threadThread2of2ForFork0InUse, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 264#true, Black: 267#(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: 276#true, 135#L1044-8true, Black: 248#(= |#race~threads_mask~0| 0), Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0))])
[2024-03-12 00:30:40,479 INFO  L294   olderBase$Statistics]: this new event has 188 ancestors and is not cut-off event
[2024-03-12 00:30:40,479 INFO  L297   olderBase$Statistics]:   existing Event has 188 ancestors and is not cut-off event
[2024-03-12 00:30:40,479 INFO  L297   olderBase$Statistics]:   existing Event has 188 ancestors and is not cut-off event
[2024-03-12 00:30:40,480 INFO  L297   olderBase$Statistics]:   existing Event has 188 ancestors and is not cut-off event
[2024-03-12 00:30:40,506 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([531] L1063-5-->L1063-6: Formula: (let ((.cse0 (select |v_#race_50| |v_ULTIMATE.start_main_~#tids~0#1.base_24|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 1)) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_24|) 0)))  InVars {#race=|v_#race_50|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  OutVars{#race=|v_#race_50|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  AuxVars[]  AssignedVars[][206], [281#true, 278#(= |#race~datas~0| 0), 288#true, Black: 291#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 290#(<= (+ ~threads_mask~0 1) 0), 269#(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)), 100#L1044-10true, 295#true, threadThread1of2ForFork0InUse, Black: 268#(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)), threadThread2of2ForFork0InUse, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 264#true, Black: 267#(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: 276#true, 135#L1044-8true, 22#L1063-6true, Black: 248#(= |#race~threads_mask~0| 0), Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0))])
[2024-03-12 00:30:40,506 INFO  L294   olderBase$Statistics]: this new event has 189 ancestors and is not cut-off event
[2024-03-12 00:30:40,506 INFO  L297   olderBase$Statistics]:   existing Event has 189 ancestors and is not cut-off event
[2024-03-12 00:30:40,506 INFO  L297   olderBase$Statistics]:   existing Event has 189 ancestors and is not cut-off event
[2024-03-12 00:30:40,506 INFO  L297   olderBase$Statistics]:   existing Event has 189 ancestors and is not cut-off event
[2024-03-12 00:30:40,840 INFO  L124   PetriNetUnfolderBase]: 4254/21149 cut-off events.
[2024-03-12 00:30:40,840 INFO  L125   PetriNetUnfolderBase]: For 2330/2525 co-relation queries the response was YES.
[2024-03-12 00:30:40,907 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 34062 conditions, 21149 events. 4254/21149 cut-off events. For 2330/2525 co-relation queries the response was YES. Maximal size of possible extension queue 521. Compared 265717 event pairs, 1150 based on Foata normal form. 2/19073 useless extension candidates. Maximal degree in co-relation 33943. Up to 3687 conditions per place. 
[2024-03-12 00:30:40,957 INFO  L140   encePairwiseOnDemand]: 245/249 looper letters, 22 selfloop transitions, 4 changer transitions 0/308 dead transitions.
[2024-03-12 00:30:40,957 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 308 transitions, 1041 flow
[2024-03-12 00:30:40,958 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-12 00:30:40,958 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-12 00:30:40,959 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 927 transitions.
[2024-03-12 00:30:40,959 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9307228915662651
[2024-03-12 00:30:40,959 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 927 transitions.
[2024-03-12 00:30:40,959 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 927 transitions.
[2024-03-12 00:30:40,960 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:30:40,960 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 927 transitions.
[2024-03-12 00:30:40,960 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 231.75) internal successors, (927), 4 states have internal predecessors, (927), 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)
[2024-03-12 00:30:40,961 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 249.0) internal successors, (1245), 5 states have internal predecessors, (1245), 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)
[2024-03-12 00:30:40,961 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 249.0) internal successors, (1245), 5 states have internal predecessors, (1245), 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)
[2024-03-12 00:30:40,961 INFO  L175             Difference]: Start difference. First operand has 260 places, 306 transitions, 985 flow. Second operand 4 states and 927 transitions.
[2024-03-12 00:30:40,961 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 308 transitions, 1041 flow
[2024-03-12 00:30:40,983 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 308 transitions, 1038 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-12 00:30:40,985 INFO  L231             Difference]: Finished difference. Result has 263 places, 306 transitions, 994 flow
[2024-03-12 00:30:40,986 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=982, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=994, PETRI_PLACES=263, PETRI_TRANSITIONS=306}
[2024-03-12 00:30:40,986 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 24 predicate places.
[2024-03-12 00:30:40,986 INFO  L495      AbstractCegarLoop]: Abstraction has has 263 places, 306 transitions, 994 flow
[2024-03-12 00:30:40,986 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 226.5) internal successors, (906), 4 states have internal predecessors, (906), 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)
[2024-03-12 00:30:40,986 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:30:40,986 INFO  L208   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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:30:40,986 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2024-03-12 00:30:40,987 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-12 00:30:40,987 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:30:40,987 INFO  L85        PathProgramCache]: Analyzing trace with hash -1250982217, now seen corresponding path program 1 times
[2024-03-12 00:30:40,987 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:30:40,987 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267865833]
[2024-03-12 00:30:40,987 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:30:40,987 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:30:40,994 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:30:41,021 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:30:41,021 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:30:41,021 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267865833]
[2024-03-12 00:30:41,021 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267865833] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:30:41,021 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:30:41,021 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-03-12 00:30:41,021 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76497597]
[2024-03-12 00:30:41,021 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:30:41,021 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-03-12 00:30:41,022 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:30:41,022 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-03-12 00:30:41,022 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-03-12 00:30:41,083 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 224 out of 249
[2024-03-12 00:30:41,084 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 306 transitions, 994 flow. Second operand  has 4 states, 4 states have (on average 225.5) internal successors, (902), 4 states have internal predecessors, (902), 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)
[2024-03-12 00:30:41,084 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:30:41,084 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 249
[2024-03-12 00:30:41,084 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:30:43,378 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([605] L1061-5-->L1061-6: Formula: (let ((.cse0 (select |v_#race_30| |v_ULTIMATE.start_main_~#tids~0#1.base_17|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 1)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 3)) 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_17|))))  InVars {#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  OutVars{#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  AuxVars[]  AssignedVars[][201], [281#true, 120#L1044-9true, 278#(= |#race~datas~0| 0), 24#L1061-6true, Black: 291#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 290#(<= (+ ~threads_mask~0 1) 0), 269#(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: 298#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= 0 (+ ~threads_mask~0 1))), threadThread1of2ForFork0InUse, 295#true, Black: 268#(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)), threadThread2of2ForFork0InUse, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 264#true, Black: 267#(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)), 301#true, Black: 276#true, 135#L1044-8true, Black: 248#(= |#race~threads_mask~0| 0), Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0))])
[2024-03-12 00:30:43,378 INFO  L294   olderBase$Statistics]: this new event has 191 ancestors and is not cut-off event
[2024-03-12 00:30:43,378 INFO  L297   olderBase$Statistics]:   existing Event has 191 ancestors and is not cut-off event
[2024-03-12 00:30:43,378 INFO  L297   olderBase$Statistics]:   existing Event has 191 ancestors and is not cut-off event
[2024-03-12 00:30:43,378 INFO  L297   olderBase$Statistics]:   existing Event has 191 ancestors and is not cut-off event
[2024-03-12 00:30:43,424 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([531] L1063-5-->L1063-6: Formula: (let ((.cse0 (select |v_#race_50| |v_ULTIMATE.start_main_~#tids~0#1.base_24|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 1)) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_24|) 0)))  InVars {#race=|v_#race_50|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  OutVars{#race=|v_#race_50|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  AuxVars[]  AssignedVars[][205], [281#true, 120#L1044-9true, 278#(= |#race~datas~0| 0), Black: 291#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 290#(<= (+ ~threads_mask~0 1) 0), 269#(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: 298#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= 0 (+ ~threads_mask~0 1))), threadThread1of2ForFork0InUse, 295#true, Black: 268#(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)), threadThread2of2ForFork0InUse, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 264#true, Black: 267#(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)), 301#true, Black: 276#true, 135#L1044-8true, 22#L1063-6true, Black: 248#(= |#race~threads_mask~0| 0), Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0))])
[2024-03-12 00:30:43,424 INFO  L294   olderBase$Statistics]: this new event has 192 ancestors and is not cut-off event
[2024-03-12 00:30:43,424 INFO  L297   olderBase$Statistics]:   existing Event has 192 ancestors and is not cut-off event
[2024-03-12 00:30:43,424 INFO  L297   olderBase$Statistics]:   existing Event has 192 ancestors and is not cut-off event
[2024-03-12 00:30:43,424 INFO  L297   olderBase$Statistics]:   existing Event has 192 ancestors and is not cut-off event
[2024-03-12 00:30:43,434 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([605] L1061-5-->L1061-6: Formula: (let ((.cse0 (select |v_#race_30| |v_ULTIMATE.start_main_~#tids~0#1.base_17|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 1)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 3)) 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_17|))))  InVars {#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  OutVars{#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  AuxVars[]  AssignedVars[][201], [281#true, 278#(= |#race~datas~0| 0), 24#L1061-6true, Black: 291#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 290#(<= (+ ~threads_mask~0 1) 0), 269#(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)), 100#L1044-10true, Black: 298#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= 0 (+ ~threads_mask~0 1))), threadThread1of2ForFork0InUse, 295#true, Black: 268#(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)), threadThread2of2ForFork0InUse, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 264#true, Black: 267#(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)), 301#true, Black: 276#true, 135#L1044-8true, Black: 248#(= |#race~threads_mask~0| 0), Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0))])
[2024-03-12 00:30:43,434 INFO  L294   olderBase$Statistics]: this new event has 192 ancestors and is not cut-off event
[2024-03-12 00:30:43,434 INFO  L297   olderBase$Statistics]:   existing Event has 192 ancestors and is not cut-off event
[2024-03-12 00:30:43,434 INFO  L297   olderBase$Statistics]:   existing Event has 192 ancestors and is not cut-off event
[2024-03-12 00:30:43,434 INFO  L297   olderBase$Statistics]:   existing Event has 192 ancestors and is not cut-off event
[2024-03-12 00:30:43,609 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([531] L1063-5-->L1063-6: Formula: (let ((.cse0 (select |v_#race_50| |v_ULTIMATE.start_main_~#tids~0#1.base_24|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 1)) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_24|) 0)))  InVars {#race=|v_#race_50|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  OutVars{#race=|v_#race_50|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  AuxVars[]  AssignedVars[][205], [281#true, 278#(= |#race~datas~0| 0), Black: 291#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 290#(<= (+ ~threads_mask~0 1) 0), 269#(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)), 100#L1044-10true, Black: 298#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= 0 (+ ~threads_mask~0 1))), threadThread1of2ForFork0InUse, 295#true, Black: 268#(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)), threadThread2of2ForFork0InUse, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 264#true, Black: 267#(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)), 301#true, Black: 276#true, 135#L1044-8true, Black: 248#(= |#race~threads_mask~0| 0), 22#L1063-6true, Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0))])
[2024-03-12 00:30:43,609 INFO  L294   olderBase$Statistics]: this new event has 193 ancestors and is not cut-off event
[2024-03-12 00:30:43,609 INFO  L297   olderBase$Statistics]:   existing Event has 193 ancestors and is not cut-off event
[2024-03-12 00:30:43,609 INFO  L297   olderBase$Statistics]:   existing Event has 193 ancestors and is not cut-off event
[2024-03-12 00:30:43,609 INFO  L297   olderBase$Statistics]:   existing Event has 193 ancestors and is not cut-off event
[2024-03-12 00:30:43,990 INFO  L124   PetriNetUnfolderBase]: 4520/22525 cut-off events.
[2024-03-12 00:30:43,991 INFO  L125   PetriNetUnfolderBase]: For 2642/2833 co-relation queries the response was YES.
[2024-03-12 00:30:44,062 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 36452 conditions, 22525 events. 4520/22525 cut-off events. For 2642/2833 co-relation queries the response was YES. Maximal size of possible extension queue 538. Compared 286597 event pairs, 1309 based on Foata normal form. 1/20346 useless extension candidates. Maximal degree in co-relation 36332. Up to 3976 conditions per place. 
[2024-03-12 00:30:44,115 INFO  L140   encePairwiseOnDemand]: 245/249 looper letters, 22 selfloop transitions, 4 changer transitions 0/307 dead transitions.
[2024-03-12 00:30:44,115 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 307 transitions, 1048 flow
[2024-03-12 00:30:44,116 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-12 00:30:44,116 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-12 00:30:44,116 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 923 transitions.
[2024-03-12 00:30:44,117 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9267068273092369
[2024-03-12 00:30:44,117 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 923 transitions.
[2024-03-12 00:30:44,117 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 923 transitions.
[2024-03-12 00:30:44,117 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:30:44,117 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 923 transitions.
[2024-03-12 00:30:44,118 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 230.75) internal successors, (923), 4 states have internal predecessors, (923), 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)
[2024-03-12 00:30:44,119 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 249.0) internal successors, (1245), 5 states have internal predecessors, (1245), 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)
[2024-03-12 00:30:44,119 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 249.0) internal successors, (1245), 5 states have internal predecessors, (1245), 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)
[2024-03-12 00:30:44,119 INFO  L175             Difference]: Start difference. First operand has 263 places, 306 transitions, 994 flow. Second operand 4 states and 923 transitions.
[2024-03-12 00:30:44,119 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 307 transitions, 1048 flow
[2024-03-12 00:30:44,139 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 307 transitions, 1040 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-03-12 00:30:44,142 INFO  L231             Difference]: Finished difference. Result has 264 places, 306 transitions, 998 flow
[2024-03-12 00:30:44,142 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=986, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=998, PETRI_PLACES=264, PETRI_TRANSITIONS=306}
[2024-03-12 00:30:44,143 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 25 predicate places.
[2024-03-12 00:30:44,143 INFO  L495      AbstractCegarLoop]: Abstraction has has 264 places, 306 transitions, 998 flow
[2024-03-12 00:30:44,143 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 225.5) internal successors, (902), 4 states have internal predecessors, (902), 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)
[2024-03-12 00:30:44,143 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:30:44,143 INFO  L208   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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:30:44,143 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2024-03-12 00:30:44,143 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-12 00:30:44,144 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:30:44,144 INFO  L85        PathProgramCache]: Analyzing trace with hash -784688474, now seen corresponding path program 1 times
[2024-03-12 00:30:44,144 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:30:44,144 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685329765]
[2024-03-12 00:30:44,144 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:30:44,144 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:30:44,152 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:30:44,163 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:30:44,163 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:30:44,163 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685329765]
[2024-03-12 00:30:44,163 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685329765] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:30:44,163 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:30:44,163 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 00:30:44,163 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946021544]
[2024-03-12 00:30:44,163 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:30:44,164 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 00:30:44,164 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:30:44,164 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 00:30:44,164 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 00:30:44,201 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 222 out of 249
[2024-03-12 00:30:44,201 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 306 transitions, 998 flow. Second operand  has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 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)
[2024-03-12 00:30:44,202 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:30:44,202 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 249
[2024-03-12 00:30:44,202 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:30:46,179 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([605] L1061-5-->L1061-6: Formula: (let ((.cse0 (select |v_#race_30| |v_ULTIMATE.start_main_~#tids~0#1.base_17|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 1)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 3)) 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_17|))))  InVars {#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  OutVars{#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  AuxVars[]  AssignedVars[][207], [281#true, 120#L1044-9true, 278#(= |#race~datas~0| 0), 24#L1061-6true, Black: 291#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 290#(<= (+ ~threads_mask~0 1) 0), 269#(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: 298#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= 0 (+ ~threads_mask~0 1))), threadThread1of2ForFork0InUse, Black: 268#(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)), threadThread2of2ForFork0InUse, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 264#true, Black: 267#(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: 306#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet17#1|)) (<= 0 (+ ~threads_mask~0 1))), 309#true, 301#true, Black: 276#true, 135#L1044-8true, Black: 248#(= |#race~threads_mask~0| 0), Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0))])
[2024-03-12 00:30:46,179 INFO  L294   olderBase$Statistics]: this new event has 191 ancestors and is not cut-off event
[2024-03-12 00:30:46,179 INFO  L297   olderBase$Statistics]:   existing Event has 191 ancestors and is not cut-off event
[2024-03-12 00:30:46,179 INFO  L297   olderBase$Statistics]:   existing Event has 191 ancestors and is not cut-off event
[2024-03-12 00:30:46,180 INFO  L297   olderBase$Statistics]:   existing Event has 191 ancestors and is not cut-off event
[2024-03-12 00:30:46,208 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([531] L1063-5-->L1063-6: Formula: (let ((.cse0 (select |v_#race_50| |v_ULTIMATE.start_main_~#tids~0#1.base_24|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 1)) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_24|) 0)))  InVars {#race=|v_#race_50|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  OutVars{#race=|v_#race_50|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  AuxVars[]  AssignedVars[][211], [281#true, 278#(= |#race~datas~0| 0), 120#L1044-9true, Black: 291#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 290#(<= (+ ~threads_mask~0 1) 0), 269#(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: 298#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= 0 (+ ~threads_mask~0 1))), threadThread1of2ForFork0InUse, Black: 268#(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)), threadThread2of2ForFork0InUse, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 264#true, Black: 267#(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: 306#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet17#1|)) (<= 0 (+ ~threads_mask~0 1))), 309#true, 301#true, Black: 276#true, 135#L1044-8true, 22#L1063-6true, Black: 248#(= |#race~threads_mask~0| 0), Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0))])
[2024-03-12 00:30:46,208 INFO  L294   olderBase$Statistics]: this new event has 192 ancestors and is not cut-off event
[2024-03-12 00:30:46,208 INFO  L297   olderBase$Statistics]:   existing Event has 192 ancestors and is not cut-off event
[2024-03-12 00:30:46,208 INFO  L297   olderBase$Statistics]:   existing Event has 192 ancestors and is not cut-off event
[2024-03-12 00:30:46,208 INFO  L297   olderBase$Statistics]:   existing Event has 192 ancestors and is not cut-off event
[2024-03-12 00:30:46,216 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([605] L1061-5-->L1061-6: Formula: (let ((.cse0 (select |v_#race_30| |v_ULTIMATE.start_main_~#tids~0#1.base_17|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 1)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 3)) 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_17|))))  InVars {#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  OutVars{#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  AuxVars[]  AssignedVars[][207], [281#true, 278#(= |#race~datas~0| 0), 24#L1061-6true, Black: 291#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 290#(<= (+ ~threads_mask~0 1) 0), 269#(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)), 100#L1044-10true, Black: 298#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= 0 (+ ~threads_mask~0 1))), threadThread1of2ForFork0InUse, Black: 268#(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)), threadThread2of2ForFork0InUse, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 264#true, Black: 267#(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: 306#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet17#1|)) (<= 0 (+ ~threads_mask~0 1))), 309#true, 301#true, Black: 276#true, 135#L1044-8true, Black: 248#(= |#race~threads_mask~0| 0), Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0))])
[2024-03-12 00:30:46,216 INFO  L294   olderBase$Statistics]: this new event has 192 ancestors and is not cut-off event
[2024-03-12 00:30:46,216 INFO  L297   olderBase$Statistics]:   existing Event has 192 ancestors and is not cut-off event
[2024-03-12 00:30:46,216 INFO  L297   olderBase$Statistics]:   existing Event has 192 ancestors and is not cut-off event
[2024-03-12 00:30:46,216 INFO  L297   olderBase$Statistics]:   existing Event has 192 ancestors and is not cut-off event
[2024-03-12 00:30:46,239 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([531] L1063-5-->L1063-6: Formula: (let ((.cse0 (select |v_#race_50| |v_ULTIMATE.start_main_~#tids~0#1.base_24|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 1)) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_24|) 0)))  InVars {#race=|v_#race_50|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  OutVars{#race=|v_#race_50|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  AuxVars[]  AssignedVars[][211], [281#true, 278#(= |#race~datas~0| 0), Black: 291#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 290#(<= (+ ~threads_mask~0 1) 0), 269#(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)), 100#L1044-10true, Black: 298#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= 0 (+ ~threads_mask~0 1))), threadThread1of2ForFork0InUse, Black: 268#(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)), threadThread2of2ForFork0InUse, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 264#true, Black: 267#(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: 306#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet17#1|)) (<= 0 (+ ~threads_mask~0 1))), 309#true, 301#true, Black: 276#true, 135#L1044-8true, 22#L1063-6true, Black: 248#(= |#race~threads_mask~0| 0), Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0))])
[2024-03-12 00:30:46,239 INFO  L294   olderBase$Statistics]: this new event has 193 ancestors and is not cut-off event
[2024-03-12 00:30:46,240 INFO  L297   olderBase$Statistics]:   existing Event has 193 ancestors and is not cut-off event
[2024-03-12 00:30:46,240 INFO  L297   olderBase$Statistics]:   existing Event has 193 ancestors and is not cut-off event
[2024-03-12 00:30:46,240 INFO  L297   olderBase$Statistics]:   existing Event has 193 ancestors and is not cut-off event
[2024-03-12 00:30:46,551 INFO  L124   PetriNetUnfolderBase]: 4409/19923 cut-off events.
[2024-03-12 00:30:46,552 INFO  L125   PetriNetUnfolderBase]: For 2842/3186 co-relation queries the response was YES.
[2024-03-12 00:30:46,624 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 32679 conditions, 19923 events. 4409/19923 cut-off events. For 2842/3186 co-relation queries the response was YES. Maximal size of possible extension queue 479. Compared 240685 event pairs, 1065 based on Foata normal form. 49/17845 useless extension candidates. Maximal degree in co-relation 32560. Up to 3166 conditions per place. 
[2024-03-12 00:30:46,672 INFO  L140   encePairwiseOnDemand]: 241/249 looper letters, 32 selfloop transitions, 12 changer transitions 0/320 dead transitions.
[2024-03-12 00:30:46,673 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 320 transitions, 1130 flow
[2024-03-12 00:30:46,674 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 00:30:46,674 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 00:30:46,674 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 700 transitions.
[2024-03-12 00:30:46,674 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9370816599732262
[2024-03-12 00:30:46,674 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 700 transitions.
[2024-03-12 00:30:46,674 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 700 transitions.
[2024-03-12 00:30:46,674 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:30:46,674 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 700 transitions.
[2024-03-12 00:30:46,675 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 233.33333333333334) internal successors, (700), 3 states have internal predecessors, (700), 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)
[2024-03-12 00:30:46,676 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 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)
[2024-03-12 00:30:46,676 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 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)
[2024-03-12 00:30:46,676 INFO  L175             Difference]: Start difference. First operand has 264 places, 306 transitions, 998 flow. Second operand 3 states and 700 transitions.
[2024-03-12 00:30:46,676 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 320 transitions, 1130 flow
[2024-03-12 00:30:46,692 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 320 transitions, 1122 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-03-12 00:30:46,694 INFO  L231             Difference]: Finished difference. Result has 265 places, 316 transitions, 1096 flow
[2024-03-12 00:30:46,695 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=990, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1096, PETRI_PLACES=265, PETRI_TRANSITIONS=316}
[2024-03-12 00:30:46,695 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 26 predicate places.
[2024-03-12 00:30:46,695 INFO  L495      AbstractCegarLoop]: Abstraction has has 265 places, 316 transitions, 1096 flow
[2024-03-12 00:30:46,695 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 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)
[2024-03-12 00:30:46,695 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:30:46,695 INFO  L208   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, 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, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:30:46,695 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2024-03-12 00:30:46,696 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-12 00:30:46,696 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:30:46,696 INFO  L85        PathProgramCache]: Analyzing trace with hash -1396861458, now seen corresponding path program 1 times
[2024-03-12 00:30:46,696 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:30:46,696 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148941694]
[2024-03-12 00:30:46,696 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:30:46,696 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:30:46,707 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:30:46,722 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:30:46,722 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:30:46,722 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148941694]
[2024-03-12 00:30:46,722 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148941694] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:30:46,722 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:30:46,722 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 00:30:46,722 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507243216]
[2024-03-12 00:30:46,722 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:30:46,722 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 00:30:46,723 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:30:46,723 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 00:30:46,723 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 00:30:46,750 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 224 out of 249
[2024-03-12 00:30:46,751 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 316 transitions, 1096 flow. Second operand  has 3 states, 3 states have (on average 227.66666666666666) internal successors, (683), 3 states have internal predecessors, (683), 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)
[2024-03-12 00:30:46,751 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:30:46,751 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 249
[2024-03-12 00:30:46,751 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:30:48,869 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([605] L1061-5-->L1061-6: Formula: (let ((.cse0 (select |v_#race_30| |v_ULTIMATE.start_main_~#tids~0#1.base_17|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 1)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 3)) 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_17|))))  InVars {#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  OutVars{#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  AuxVars[]  AssignedVars[][213], [278#(= |#race~datas~0| 0), 120#L1044-9true, 281#true, 24#L1061-6true, Black: 291#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 290#(<= (+ ~threads_mask~0 1) 0), 269#(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: 298#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= 0 (+ ~threads_mask~0 1))), threadThread1of2ForFork0InUse, Black: 268#(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)), threadThread2of2ForFork0InUse, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 264#true, Black: 267#(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: 306#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet17#1|)) (<= 0 (+ ~threads_mask~0 1))), 315#true, 309#true, Black: 276#true, 135#L1044-8true, Black: 248#(= |#race~threads_mask~0| 0), Black: 311#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet19#1|), Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0))])
[2024-03-12 00:30:48,869 INFO  L294   olderBase$Statistics]: this new event has 191 ancestors and is not cut-off event
[2024-03-12 00:30:48,869 INFO  L297   olderBase$Statistics]:   existing Event has 191 ancestors and is not cut-off event
[2024-03-12 00:30:48,869 INFO  L297   olderBase$Statistics]:   existing Event has 191 ancestors and is not cut-off event
[2024-03-12 00:30:48,869 INFO  L297   olderBase$Statistics]:   existing Event has 191 ancestors and is not cut-off event
[2024-03-12 00:30:48,901 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([531] L1063-5-->L1063-6: Formula: (let ((.cse0 (select |v_#race_50| |v_ULTIMATE.start_main_~#tids~0#1.base_24|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 1)) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_24|) 0)))  InVars {#race=|v_#race_50|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  OutVars{#race=|v_#race_50|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  AuxVars[]  AssignedVars[][217], [278#(= |#race~datas~0| 0), 281#true, 120#L1044-9true, Black: 291#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 290#(<= (+ ~threads_mask~0 1) 0), 269#(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: 298#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= 0 (+ ~threads_mask~0 1))), threadThread1of2ForFork0InUse, Black: 268#(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)), threadThread2of2ForFork0InUse, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 264#true, Black: 267#(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: 306#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet17#1|)) (<= 0 (+ ~threads_mask~0 1))), 315#true, 309#true, Black: 276#true, 135#L1044-8true, 22#L1063-6true, Black: 248#(= |#race~threads_mask~0| 0), Black: 311#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet19#1|), Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0))])
[2024-03-12 00:30:48,901 INFO  L294   olderBase$Statistics]: this new event has 192 ancestors and is not cut-off event
[2024-03-12 00:30:48,901 INFO  L297   olderBase$Statistics]:   existing Event has 192 ancestors and is not cut-off event
[2024-03-12 00:30:48,902 INFO  L297   olderBase$Statistics]:   existing Event has 192 ancestors and is not cut-off event
[2024-03-12 00:30:48,902 INFO  L297   olderBase$Statistics]:   existing Event has 192 ancestors and is not cut-off event
[2024-03-12 00:30:48,910 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([605] L1061-5-->L1061-6: Formula: (let ((.cse0 (select |v_#race_30| |v_ULTIMATE.start_main_~#tids~0#1.base_17|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 1)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 3)) 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_17|))))  InVars {#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  OutVars{#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  AuxVars[]  AssignedVars[][213], [278#(= |#race~datas~0| 0), 281#true, 24#L1061-6true, Black: 291#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 290#(<= (+ ~threads_mask~0 1) 0), 269#(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)), 100#L1044-10true, Black: 298#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= 0 (+ ~threads_mask~0 1))), threadThread1of2ForFork0InUse, Black: 268#(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)), threadThread2of2ForFork0InUse, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 264#true, Black: 267#(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: 306#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet17#1|)) (<= 0 (+ ~threads_mask~0 1))), 315#true, 309#true, Black: 276#true, 135#L1044-8true, Black: 248#(= |#race~threads_mask~0| 0), Black: 311#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet19#1|), Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0))])
[2024-03-12 00:30:48,910 INFO  L294   olderBase$Statistics]: this new event has 192 ancestors and is not cut-off event
[2024-03-12 00:30:48,910 INFO  L297   olderBase$Statistics]:   existing Event has 192 ancestors and is not cut-off event
[2024-03-12 00:30:48,910 INFO  L297   olderBase$Statistics]:   existing Event has 192 ancestors and is not cut-off event
[2024-03-12 00:30:48,910 INFO  L297   olderBase$Statistics]:   existing Event has 192 ancestors and is not cut-off event
[2024-03-12 00:30:48,936 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([531] L1063-5-->L1063-6: Formula: (let ((.cse0 (select |v_#race_50| |v_ULTIMATE.start_main_~#tids~0#1.base_24|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 1)) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_24|) 0)))  InVars {#race=|v_#race_50|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  OutVars{#race=|v_#race_50|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  AuxVars[]  AssignedVars[][217], [278#(= |#race~datas~0| 0), 281#true, Black: 291#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 290#(<= (+ ~threads_mask~0 1) 0), 269#(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)), 100#L1044-10true, Black: 298#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= 0 (+ ~threads_mask~0 1))), threadThread1of2ForFork0InUse, Black: 268#(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)), threadThread2of2ForFork0InUse, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 264#true, Black: 267#(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: 306#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet17#1|)) (<= 0 (+ ~threads_mask~0 1))), 315#true, 309#true, Black: 276#true, 135#L1044-8true, 22#L1063-6true, Black: 248#(= |#race~threads_mask~0| 0), Black: 311#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet19#1|), Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0))])
[2024-03-12 00:30:48,937 INFO  L294   olderBase$Statistics]: this new event has 193 ancestors and is not cut-off event
[2024-03-12 00:30:48,937 INFO  L297   olderBase$Statistics]:   existing Event has 193 ancestors and is not cut-off event
[2024-03-12 00:30:48,937 INFO  L297   olderBase$Statistics]:   existing Event has 193 ancestors and is not cut-off event
[2024-03-12 00:30:48,937 INFO  L297   olderBase$Statistics]:   existing Event has 193 ancestors and is not cut-off event
[2024-03-12 00:30:49,299 INFO  L124   PetriNetUnfolderBase]: 5236/23269 cut-off events.
[2024-03-12 00:30:49,300 INFO  L125   PetriNetUnfolderBase]: For 6687/7085 co-relation queries the response was YES.
[2024-03-12 00:30:49,407 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 40624 conditions, 23269 events. 5236/23269 cut-off events. For 6687/7085 co-relation queries the response was YES. Maximal size of possible extension queue 576. Compared 288434 event pairs, 1130 based on Foata normal form. 42/20917 useless extension candidates. Maximal degree in co-relation 40393. Up to 3504 conditions per place. 
[2024-03-12 00:30:49,482 INFO  L140   encePairwiseOnDemand]: 240/249 looper letters, 38 selfloop transitions, 19 changer transitions 0/337 dead transitions.
[2024-03-12 00:30:49,482 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 337 transitions, 1314 flow
[2024-03-12 00:30:49,483 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 00:30:49,483 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 00:30:49,484 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 707 transitions.
[2024-03-12 00:30:49,485 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9464524765729585
[2024-03-12 00:30:49,485 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 707 transitions.
[2024-03-12 00:30:49,486 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 707 transitions.
[2024-03-12 00:30:49,486 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:30:49,486 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 707 transitions.
[2024-03-12 00:30:49,488 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 235.66666666666666) internal successors, (707), 3 states have internal predecessors, (707), 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)
[2024-03-12 00:30:49,489 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 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)
[2024-03-12 00:30:49,489 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 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)
[2024-03-12 00:30:49,489 INFO  L175             Difference]: Start difference. First operand has 265 places, 316 transitions, 1096 flow. Second operand 3 states and 707 transitions.
[2024-03-12 00:30:49,489 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 337 transitions, 1314 flow
[2024-03-12 00:30:49,532 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 337 transitions, 1280 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-12 00:30:49,535 INFO  L231             Difference]: Finished difference. Result has 267 places, 331 transitions, 1254 flow
[2024-03-12 00:30:49,536 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=1072, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1254, PETRI_PLACES=267, PETRI_TRANSITIONS=331}
[2024-03-12 00:30:49,536 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 28 predicate places.
[2024-03-12 00:30:49,536 INFO  L495      AbstractCegarLoop]: Abstraction has has 267 places, 331 transitions, 1254 flow
[2024-03-12 00:30:49,537 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 227.66666666666666) internal successors, (683), 3 states have internal predecessors, (683), 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)
[2024-03-12 00:30:49,537 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:30:49,537 INFO  L208   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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:30:49,537 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2024-03-12 00:30:49,538 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-12 00:30:49,538 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:30:49,538 INFO  L85        PathProgramCache]: Analyzing trace with hash -184053767, now seen corresponding path program 1 times
[2024-03-12 00:30:49,539 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:30:49,539 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137832402]
[2024-03-12 00:30:49,539 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:30:49,539 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:30:49,569 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:30:49,782 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-12 00:30:49,782 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:30:49,782 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137832402]
[2024-03-12 00:30:49,782 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137832402] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:30:49,782 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:30:49,782 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 00:30:49,783 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926375531]
[2024-03-12 00:30:49,783 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:30:49,783 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-12 00:30:49,783 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:30:49,784 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-12 00:30:49,784 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-12 00:30:50,062 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 214 out of 249
[2024-03-12 00:30:50,064 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 331 transitions, 1254 flow. Second operand  has 6 states, 6 states have (on average 215.83333333333334) internal successors, (1295), 6 states have internal predecessors, (1295), 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)
[2024-03-12 00:30:50,064 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:30:50,064 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 249
[2024-03-12 00:30:50,064 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:30:54,595 INFO  L124   PetriNetUnfolderBase]: 7901/31619 cut-off events.
[2024-03-12 00:30:54,595 INFO  L125   PetriNetUnfolderBase]: For 12164/12644 co-relation queries the response was YES.
[2024-03-12 00:30:54,700 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 59354 conditions, 31619 events. 7901/31619 cut-off events. For 12164/12644 co-relation queries the response was YES. Maximal size of possible extension queue 825. Compared 405401 event pairs, 1929 based on Foata normal form. 8/28488 useless extension candidates. Maximal degree in co-relation 59151. Up to 7293 conditions per place. 
[2024-03-12 00:30:54,779 INFO  L140   encePairwiseOnDemand]: 234/249 looper letters, 80 selfloop transitions, 70 changer transitions 0/418 dead transitions.
[2024-03-12 00:30:54,779 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 418 transitions, 1926 flow
[2024-03-12 00:30:54,780 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 00:30:54,780 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 00:30:54,781 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1371 transitions.
[2024-03-12 00:30:54,781 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9176706827309237
[2024-03-12 00:30:54,781 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 1371 transitions.
[2024-03-12 00:30:54,781 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 1371 transitions.
[2024-03-12 00:30:54,782 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:30:54,782 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1371 transitions.
[2024-03-12 00:30:54,783 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 228.5) internal successors, (1371), 6 states have internal predecessors, (1371), 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)
[2024-03-12 00:30:54,784 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 249.0) internal successors, (1743), 7 states have internal predecessors, (1743), 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)
[2024-03-12 00:30:54,784 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 249.0) internal successors, (1743), 7 states have internal predecessors, (1743), 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)
[2024-03-12 00:30:54,785 INFO  L175             Difference]: Start difference. First operand has 267 places, 331 transitions, 1254 flow. Second operand 6 states and 1371 transitions.
[2024-03-12 00:30:54,785 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 418 transitions, 1926 flow
[2024-03-12 00:30:54,813 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 418 transitions, 1888 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-12 00:30:54,816 INFO  L231             Difference]: Finished difference. Result has 275 places, 400 transitions, 1870 flow
[2024-03-12 00:30:54,817 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=1216, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1870, PETRI_PLACES=275, PETRI_TRANSITIONS=400}
[2024-03-12 00:30:54,817 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 36 predicate places.
[2024-03-12 00:30:54,817 INFO  L495      AbstractCegarLoop]: Abstraction has has 275 places, 400 transitions, 1870 flow
[2024-03-12 00:30:54,818 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 215.83333333333334) internal successors, (1295), 6 states have internal predecessors, (1295), 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)
[2024-03-12 00:30:54,818 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:30:54,818 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 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, 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, 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]
[2024-03-12 00:30:54,818 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2024-03-12 00:30:54,818 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-12 00:30:54,818 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:30:54,819 INFO  L85        PathProgramCache]: Analyzing trace with hash -1031079142, now seen corresponding path program 1 times
[2024-03-12 00:30:54,819 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:30:54,819 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911446715]
[2024-03-12 00:30:54,819 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:30:54,819 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:30:54,831 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:30:54,873 INFO  L134       CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2024-03-12 00:30:54,873 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:30:54,873 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911446715]
[2024-03-12 00:30:54,874 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911446715] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:30:54,874 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:30:54,874 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-03-12 00:30:54,874 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076636149]
[2024-03-12 00:30:54,874 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:30:54,874 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 00:30:54,874 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:30:54,875 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 00:30:54,875 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 00:30:54,885 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 234 out of 249
[2024-03-12 00:30:54,885 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 400 transitions, 1870 flow. Second operand  has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 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)
[2024-03-12 00:30:54,885 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:30:54,886 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 249
[2024-03-12 00:30:54,886 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:30:55,483 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([605] L1061-5-->L1061-6: Formula: (let ((.cse0 (select |v_#race_30| |v_ULTIMATE.start_main_~#tids~0#1.base_17|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 1)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 3)) 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_17|))))  InVars {#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  OutVars{#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  AuxVars[]  AssignedVars[][190], [278#(= |#race~datas~0| 0), 24#L1061-6true, Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 326#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 323#(= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0), Black: 324#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 325#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|)))), 321#true, Black: 268#(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: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 264#true, Black: 267#(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: 276#true, Black: 283#(<= (+ ~threads_mask~0 1) 0), 333#true, Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0)), 120#L1044-9true, 281#true, Black: 291#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 290#(<= (+ ~threads_mask~0 1) 0), 269#(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: 298#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= 0 (+ ~threads_mask~0 1))), threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, Black: 306#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet17#1|)) (<= 0 (+ ~threads_mask~0 1))), 135#L1044-8true, Black: 248#(= |#race~threads_mask~0| 0), Black: 311#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet19#1|), Black: 317#(= |threadThread1of2ForFork0_#t~nondet6| |#race~threads_mask~0|)])
[2024-03-12 00:30:55,484 INFO  L294   olderBase$Statistics]: this new event has 191 ancestors and is not cut-off event
[2024-03-12 00:30:55,484 INFO  L297   olderBase$Statistics]:   existing Event has 191 ancestors and is not cut-off event
[2024-03-12 00:30:55,484 INFO  L297   olderBase$Statistics]:   existing Event has 191 ancestors and is not cut-off event
[2024-03-12 00:30:55,484 INFO  L297   olderBase$Statistics]:   existing Event has 191 ancestors and is not cut-off event
[2024-03-12 00:30:55,499 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([531] L1063-5-->L1063-6: Formula: (let ((.cse0 (select |v_#race_50| |v_ULTIMATE.start_main_~#tids~0#1.base_24|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 1)) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_24|) 0)))  InVars {#race=|v_#race_50|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  OutVars{#race=|v_#race_50|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  AuxVars[]  AssignedVars[][195], [278#(= |#race~datas~0| 0), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 326#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 323#(= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0), Black: 324#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 325#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|)))), 321#true, Black: 268#(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: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 264#true, Black: 267#(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: 276#true, 22#L1063-6true, Black: 283#(<= (+ ~threads_mask~0 1) 0), 333#true, Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0)), 281#true, 120#L1044-9true, Black: 291#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 290#(<= (+ ~threads_mask~0 1) 0), 269#(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: 298#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= 0 (+ ~threads_mask~0 1))), threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, Black: 306#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet17#1|)) (<= 0 (+ ~threads_mask~0 1))), 135#L1044-8true, Black: 248#(= |#race~threads_mask~0| 0), Black: 311#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet19#1|), Black: 317#(= |threadThread1of2ForFork0_#t~nondet6| |#race~threads_mask~0|)])
[2024-03-12 00:30:55,500 INFO  L294   olderBase$Statistics]: this new event has 192 ancestors and is not cut-off event
[2024-03-12 00:30:55,500 INFO  L297   olderBase$Statistics]:   existing Event has 192 ancestors and is not cut-off event
[2024-03-12 00:30:55,500 INFO  L297   olderBase$Statistics]:   existing Event has 192 ancestors and is not cut-off event
[2024-03-12 00:30:55,500 INFO  L297   olderBase$Statistics]:   existing Event has 192 ancestors and is not cut-off event
[2024-03-12 00:30:55,514 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([605] L1061-5-->L1061-6: Formula: (let ((.cse0 (select |v_#race_30| |v_ULTIMATE.start_main_~#tids~0#1.base_17|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 1)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 3)) 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_17|))))  InVars {#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  OutVars{#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  AuxVars[]  AssignedVars[][190], [278#(= |#race~datas~0| 0), 24#L1061-6true, Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 326#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 323#(= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0), Black: 324#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 325#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|)))), 321#true, Black: 268#(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: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 264#true, Black: 267#(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: 276#true, Black: 283#(<= (+ ~threads_mask~0 1) 0), 333#true, Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0)), 281#true, Black: 291#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 290#(<= (+ ~threads_mask~0 1) 0), 269#(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)), 100#L1044-10true, Black: 298#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= 0 (+ ~threads_mask~0 1))), threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, Black: 306#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet17#1|)) (<= 0 (+ ~threads_mask~0 1))), 135#L1044-8true, Black: 248#(= |#race~threads_mask~0| 0), Black: 311#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet19#1|), Black: 317#(= |threadThread1of2ForFork0_#t~nondet6| |#race~threads_mask~0|)])
[2024-03-12 00:30:55,514 INFO  L294   olderBase$Statistics]: this new event has 192 ancestors and is not cut-off event
[2024-03-12 00:30:55,514 INFO  L297   olderBase$Statistics]:   existing Event has 192 ancestors and is not cut-off event
[2024-03-12 00:30:55,514 INFO  L297   olderBase$Statistics]:   existing Event has 192 ancestors and is not cut-off event
[2024-03-12 00:30:55,515 INFO  L297   olderBase$Statistics]:   existing Event has 192 ancestors and is not cut-off event
[2024-03-12 00:30:55,527 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([531] L1063-5-->L1063-6: Formula: (let ((.cse0 (select |v_#race_50| |v_ULTIMATE.start_main_~#tids~0#1.base_24|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 1)) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_24|) 0)))  InVars {#race=|v_#race_50|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  OutVars{#race=|v_#race_50|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  AuxVars[]  AssignedVars[][195], [278#(= |#race~datas~0| 0), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 326#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 323#(= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0), Black: 324#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 325#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|)))), 321#true, Black: 268#(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: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 264#true, Black: 267#(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: 276#true, 22#L1063-6true, Black: 283#(<= (+ ~threads_mask~0 1) 0), 333#true, Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0)), 281#true, Black: 291#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 290#(<= (+ ~threads_mask~0 1) 0), 269#(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)), 100#L1044-10true, Black: 298#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= 0 (+ ~threads_mask~0 1))), threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, Black: 306#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet17#1|)) (<= 0 (+ ~threads_mask~0 1))), 135#L1044-8true, Black: 248#(= |#race~threads_mask~0| 0), Black: 311#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet19#1|), Black: 317#(= |threadThread1of2ForFork0_#t~nondet6| |#race~threads_mask~0|)])
[2024-03-12 00:30:55,527 INFO  L294   olderBase$Statistics]: this new event has 193 ancestors and is not cut-off event
[2024-03-12 00:30:55,527 INFO  L297   olderBase$Statistics]:   existing Event has 193 ancestors and is not cut-off event
[2024-03-12 00:30:55,527 INFO  L297   olderBase$Statistics]:   existing Event has 193 ancestors and is not cut-off event
[2024-03-12 00:30:55,528 INFO  L297   olderBase$Statistics]:   existing Event has 193 ancestors and is not cut-off event
[2024-03-12 00:30:55,887 INFO  L124   PetriNetUnfolderBase]: 2286/8069 cut-off events.
[2024-03-12 00:30:55,887 INFO  L125   PetriNetUnfolderBase]: For 4572/6539 co-relation queries the response was YES.
[2024-03-12 00:30:55,923 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18073 conditions, 8069 events. 2286/8069 cut-off events. For 4572/6539 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 73899 event pairs, 267 based on Foata normal form. 25/7571 useless extension candidates. Maximal degree in co-relation 17976. Up to 2409 conditions per place. 
[2024-03-12 00:30:55,948 INFO  L140   encePairwiseOnDemand]: 243/249 looper letters, 8 selfloop transitions, 6 changer transitions 0/361 dead transitions.
[2024-03-12 00:30:55,948 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 361 transitions, 1655 flow
[2024-03-12 00:30:55,949 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 00:30:55,949 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 00:30:55,950 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 719 transitions.
[2024-03-12 00:30:55,950 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9625167336010709
[2024-03-12 00:30:55,950 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 719 transitions.
[2024-03-12 00:30:55,950 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 719 transitions.
[2024-03-12 00:30:55,950 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:30:55,951 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 719 transitions.
[2024-03-12 00:30:55,951 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 239.66666666666666) internal successors, (719), 3 states have internal predecessors, (719), 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)
[2024-03-12 00:30:55,952 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 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)
[2024-03-12 00:30:55,952 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 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)
[2024-03-12 00:30:55,952 INFO  L175             Difference]: Start difference. First operand has 275 places, 400 transitions, 1870 flow. Second operand 3 states and 719 transitions.
[2024-03-12 00:30:55,952 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 361 transitions, 1655 flow
[2024-03-12 00:30:55,969 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 361 transitions, 1603 flow, removed 16 selfloop flow, removed 6 redundant places.
[2024-03-12 00:30:55,972 INFO  L231             Difference]: Finished difference. Result has 265 places, 358 transitions, 1570 flow
[2024-03-12 00:30:55,973 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=1558, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1570, PETRI_PLACES=265, PETRI_TRANSITIONS=358}
[2024-03-12 00:30:55,973 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 26 predicate places.
[2024-03-12 00:30:55,973 INFO  L495      AbstractCegarLoop]: Abstraction has has 265 places, 358 transitions, 1570 flow
[2024-03-12 00:30:55,973 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 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)
[2024-03-12 00:30:55,973 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:30:55,974 INFO  L208   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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:30:55,974 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2024-03-12 00:30:55,974 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting threadErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-12 00:30:55,974 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:30:55,974 INFO  L85        PathProgramCache]: Analyzing trace with hash 1905785528, now seen corresponding path program 1 times
[2024-03-12 00:30:55,974 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:30:55,974 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300418181]
[2024-03-12 00:30:55,975 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:30:55,975 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:30:55,991 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:30:56,106 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:30:56,107 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:30:56,107 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300418181]
[2024-03-12 00:30:56,107 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300418181] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:30:56,107 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:30:56,107 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-03-12 00:30:56,107 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207800847]
[2024-03-12 00:30:56,107 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:30:56,108 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-03-12 00:30:56,108 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:30:56,108 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-03-12 00:30:56,108 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-03-12 00:30:56,341 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 213 out of 249
[2024-03-12 00:30:56,342 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 358 transitions, 1570 flow. Second operand  has 8 states, 8 states have (on average 215.25) internal successors, (1722), 8 states have internal predecessors, (1722), 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)
[2024-03-12 00:30:56,342 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:30:56,342 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 249
[2024-03-12 00:30:56,342 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:30:57,184 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([605] L1061-5-->L1061-6: Formula: (let ((.cse0 (select |v_#race_30| |v_ULTIMATE.start_main_~#tids~0#1.base_17|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 1)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 3)) 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_17|))))  InVars {#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  OutVars{#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  AuxVars[]  AssignedVars[][229], [278#(= |#race~datas~0| 0), 24#L1061-6true, Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 326#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 323#(= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0), Black: 324#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 325#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|)))), 321#true, Black: 268#(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: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 337#true, Black: 264#true, Black: 267#(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: 276#true, 333#true, Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0)), 281#true, 120#L1044-9true, Black: 291#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 290#(<= (+ ~threads_mask~0 1) 0), 269#(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: 298#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= 0 (+ ~threads_mask~0 1))), threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, Black: 306#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet17#1|)) (<= 0 (+ ~threads_mask~0 1))), 135#L1044-8true])
[2024-03-12 00:30:57,185 INFO  L294   olderBase$Statistics]: this new event has 191 ancestors and is not cut-off event
[2024-03-12 00:30:57,185 INFO  L297   olderBase$Statistics]:   existing Event has 191 ancestors and is not cut-off event
[2024-03-12 00:30:57,185 INFO  L297   olderBase$Statistics]:   existing Event has 191 ancestors and is not cut-off event
[2024-03-12 00:30:57,185 INFO  L297   olderBase$Statistics]:   existing Event has 191 ancestors and is not cut-off event
[2024-03-12 00:30:57,202 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([531] L1063-5-->L1063-6: Formula: (let ((.cse0 (select |v_#race_50| |v_ULTIMATE.start_main_~#tids~0#1.base_24|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 1)) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_24|) 0)))  InVars {#race=|v_#race_50|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  OutVars{#race=|v_#race_50|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  AuxVars[]  AssignedVars[][233], [278#(= |#race~datas~0| 0), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 326#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 323#(= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0), Black: 324#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 325#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|)))), 321#true, Black: 268#(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)), 337#true, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 264#true, Black: 267#(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: 276#true, 22#L1063-6true, 333#true, Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0)), 281#true, 120#L1044-9true, Black: 291#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 290#(<= (+ ~threads_mask~0 1) 0), 269#(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: 298#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= 0 (+ ~threads_mask~0 1))), threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, Black: 306#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet17#1|)) (<= 0 (+ ~threads_mask~0 1))), 135#L1044-8true])
[2024-03-12 00:30:57,203 INFO  L294   olderBase$Statistics]: this new event has 192 ancestors and is not cut-off event
[2024-03-12 00:30:57,203 INFO  L297   olderBase$Statistics]:   existing Event has 192 ancestors and is not cut-off event
[2024-03-12 00:30:57,203 INFO  L297   olderBase$Statistics]:   existing Event has 192 ancestors and is not cut-off event
[2024-03-12 00:30:57,203 INFO  L297   olderBase$Statistics]:   existing Event has 192 ancestors and is not cut-off event
[2024-03-12 00:30:57,218 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([605] L1061-5-->L1061-6: Formula: (let ((.cse0 (select |v_#race_30| |v_ULTIMATE.start_main_~#tids~0#1.base_17|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 1)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 3)) 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_17|))))  InVars {#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  OutVars{#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  AuxVars[]  AssignedVars[][229], [278#(= |#race~datas~0| 0), 24#L1061-6true, Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 326#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 323#(= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0), Black: 324#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 325#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|)))), 321#true, Black: 268#(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: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 337#true, Black: 264#true, Black: 267#(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: 276#true, 333#true, Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0)), 281#true, Black: 291#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 290#(<= (+ ~threads_mask~0 1) 0), 269#(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)), 100#L1044-10true, Black: 298#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= 0 (+ ~threads_mask~0 1))), threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, Black: 306#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet17#1|)) (<= 0 (+ ~threads_mask~0 1))), 135#L1044-8true])
[2024-03-12 00:30:57,219 INFO  L294   olderBase$Statistics]: this new event has 192 ancestors and is not cut-off event
[2024-03-12 00:30:57,219 INFO  L297   olderBase$Statistics]:   existing Event has 192 ancestors and is not cut-off event
[2024-03-12 00:30:57,219 INFO  L297   olderBase$Statistics]:   existing Event has 192 ancestors and is not cut-off event
[2024-03-12 00:30:57,219 INFO  L297   olderBase$Statistics]:   existing Event has 192 ancestors and is not cut-off event
[2024-03-12 00:30:57,232 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([531] L1063-5-->L1063-6: Formula: (let ((.cse0 (select |v_#race_50| |v_ULTIMATE.start_main_~#tids~0#1.base_24|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 1)) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_24|) 0)))  InVars {#race=|v_#race_50|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  OutVars{#race=|v_#race_50|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  AuxVars[]  AssignedVars[][233], [278#(= |#race~datas~0| 0), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 326#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 323#(= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0), Black: 324#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 325#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|)))), 321#true, Black: 268#(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)), 337#true, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 264#true, Black: 267#(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: 276#true, 22#L1063-6true, 333#true, Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0)), 281#true, Black: 291#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 290#(<= (+ ~threads_mask~0 1) 0), 269#(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)), 100#L1044-10true, Black: 298#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= 0 (+ ~threads_mask~0 1))), threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, Black: 306#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet17#1|)) (<= 0 (+ ~threads_mask~0 1))), 135#L1044-8true])
[2024-03-12 00:30:57,233 INFO  L294   olderBase$Statistics]: this new event has 193 ancestors and is not cut-off event
[2024-03-12 00:30:57,233 INFO  L297   olderBase$Statistics]:   existing Event has 193 ancestors and is not cut-off event
[2024-03-12 00:30:57,233 INFO  L297   olderBase$Statistics]:   existing Event has 193 ancestors and is not cut-off event
[2024-03-12 00:30:57,233 INFO  L297   olderBase$Statistics]:   existing Event has 193 ancestors and is not cut-off event
[2024-03-12 00:30:57,638 INFO  L124   PetriNetUnfolderBase]: 2429/8933 cut-off events.
[2024-03-12 00:30:57,638 INFO  L125   PetriNetUnfolderBase]: For 4640/6482 co-relation queries the response was YES.
[2024-03-12 00:30:57,670 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19356 conditions, 8933 events. 2429/8933 cut-off events. For 4640/6482 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 83048 event pairs, 351 based on Foata normal form. 16/8332 useless extension candidates. Maximal degree in co-relation 18496. Up to 2435 conditions per place. 
[2024-03-12 00:30:57,699 INFO  L140   encePairwiseOnDemand]: 236/249 looper letters, 63 selfloop transitions, 16 changer transitions 0/401 dead transitions.
[2024-03-12 00:30:57,699 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 401 transitions, 1859 flow
[2024-03-12 00:30:57,700 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-03-12 00:30:57,700 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-03-12 00:30:57,702 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2212 transitions.
[2024-03-12 00:30:57,703 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8883534136546185
[2024-03-12 00:30:57,703 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 2212 transitions.
[2024-03-12 00:30:57,703 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 2212 transitions.
[2024-03-12 00:30:57,703 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:30:57,704 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2212 transitions.
[2024-03-12 00:30:57,706 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 11 states, 10 states have (on average 221.2) internal successors, (2212), 10 states have internal predecessors, (2212), 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)
[2024-03-12 00:30:57,708 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 11 states, 11 states have (on average 249.0) internal successors, (2739), 11 states have internal predecessors, (2739), 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)
[2024-03-12 00:30:57,708 INFO  L81            ComplementDD]: Finished complementDD. Result  has 11 states, 11 states have (on average 249.0) internal successors, (2739), 11 states have internal predecessors, (2739), 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)
[2024-03-12 00:30:57,708 INFO  L175             Difference]: Start difference. First operand has 265 places, 358 transitions, 1570 flow. Second operand 10 states and 2212 transitions.
[2024-03-12 00:30:57,708 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 401 transitions, 1859 flow
[2024-03-12 00:30:57,725 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 401 transitions, 1848 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-12 00:30:57,729 INFO  L231             Difference]: Finished difference. Result has 279 places, 370 transitions, 1671 flow
[2024-03-12 00:30:57,729 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=1564, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=345, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1671, PETRI_PLACES=279, PETRI_TRANSITIONS=370}
[2024-03-12 00:30:57,729 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 40 predicate places.
[2024-03-12 00:30:57,729 INFO  L495      AbstractCegarLoop]: Abstraction has has 279 places, 370 transitions, 1671 flow
[2024-03-12 00:30:57,730 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 215.25) internal successors, (1722), 8 states have internal predecessors, (1722), 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)
[2024-03-12 00:30:57,730 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:30:57,730 INFO  L208   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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:30:57,730 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2024-03-12 00:30:57,730 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting threadErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-12 00:30:57,731 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:30:57,731 INFO  L85        PathProgramCache]: Analyzing trace with hash -1211424040, now seen corresponding path program 1 times
[2024-03-12 00:30:57,731 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:30:57,731 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009388116]
[2024-03-12 00:30:57,731 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:30:57,731 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:30:57,752 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:30:57,867 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:30:57,867 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:30:57,867 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009388116]
[2024-03-12 00:30:57,868 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009388116] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:30:57,868 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:30:57,868 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-03-12 00:30:57,868 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940328577]
[2024-03-12 00:30:57,868 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:30:57,869 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-03-12 00:30:57,869 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:30:57,869 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-03-12 00:30:57,869 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-03-12 00:30:58,052 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 214 out of 249
[2024-03-12 00:30:58,053 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 370 transitions, 1671 flow. Second operand  has 8 states, 8 states have (on average 216.25) internal successors, (1730), 8 states have internal predecessors, (1730), 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)
[2024-03-12 00:30:58,054 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:30:58,054 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 249
[2024-03-12 00:30:58,054 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:30:59,030 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([605] L1061-5-->L1061-6: Formula: (let ((.cse0 (select |v_#race_30| |v_ULTIMATE.start_main_~#tids~0#1.base_17|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 1)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 3)) 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_17|))))  InVars {#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  OutVars{#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  AuxVars[]  AssignedVars[][227], [278#(= |#race~datas~0| 0), 24#L1061-6true, Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 326#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 323#(= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0), Black: 324#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 325#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|)))), 321#true, Black: 268#(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)), 337#true, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 264#true, Black: 267#(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: 276#true, 333#true, Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0)), 120#L1044-9true, 281#true, Black: 350#(and (<= (+ 2 |ULTIMATE.start_main_#t~nondet18#1|) 0) (<= (+ 2 ~threads_mask~0) 0)), Black: 352#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ 2 ~threads_mask~0) 0)), Black: 344#(and (<= (+ 2 ~threads_mask~0) 0) (= |threadThread1of2ForFork0_#t~nondet4| 1)), Black: 291#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 340#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0)), Black: 290#(<= (+ ~threads_mask~0 1) 0), Black: 348#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ 2 |ULTIMATE.start_main_#t~nondet18#1|) 0) (<= (+ 2 ~threads_mask~0) 0)), Black: 343#(<= (+ 2 ~threads_mask~0) 0), 269#(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: 298#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= 0 (+ ~threads_mask~0 1))), threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, Black: 306#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet17#1|)) (<= 0 (+ ~threads_mask~0 1))), 135#L1044-8true, 360#true])
[2024-03-12 00:30:59,031 INFO  L294   olderBase$Statistics]: this new event has 191 ancestors and is not cut-off event
[2024-03-12 00:30:59,031 INFO  L297   olderBase$Statistics]:   existing Event has 191 ancestors and is not cut-off event
[2024-03-12 00:30:59,031 INFO  L297   olderBase$Statistics]:   existing Event has 191 ancestors and is not cut-off event
[2024-03-12 00:30:59,031 INFO  L297   olderBase$Statistics]:   existing Event has 191 ancestors and is not cut-off event
[2024-03-12 00:30:59,052 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([531] L1063-5-->L1063-6: Formula: (let ((.cse0 (select |v_#race_50| |v_ULTIMATE.start_main_~#tids~0#1.base_24|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 1)) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_24|) 0)))  InVars {#race=|v_#race_50|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  OutVars{#race=|v_#race_50|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  AuxVars[]  AssignedVars[][231], [278#(= |#race~datas~0| 0), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 326#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 323#(= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0), Black: 324#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 325#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|)))), 321#true, Black: 268#(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)), 337#true, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 264#true, Black: 267#(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: 276#true, 22#L1063-6true, 333#true, Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0)), 120#L1044-9true, 281#true, Black: 350#(and (<= (+ 2 |ULTIMATE.start_main_#t~nondet18#1|) 0) (<= (+ 2 ~threads_mask~0) 0)), Black: 352#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ 2 ~threads_mask~0) 0)), Black: 344#(and (<= (+ 2 ~threads_mask~0) 0) (= |threadThread1of2ForFork0_#t~nondet4| 1)), Black: 291#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 340#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0)), Black: 290#(<= (+ ~threads_mask~0 1) 0), Black: 348#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ 2 |ULTIMATE.start_main_#t~nondet18#1|) 0) (<= (+ 2 ~threads_mask~0) 0)), Black: 343#(<= (+ 2 ~threads_mask~0) 0), 269#(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: 298#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= 0 (+ ~threads_mask~0 1))), threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, Black: 306#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet17#1|)) (<= 0 (+ ~threads_mask~0 1))), 135#L1044-8true, 360#true])
[2024-03-12 00:30:59,052 INFO  L294   olderBase$Statistics]: this new event has 192 ancestors and is not cut-off event
[2024-03-12 00:30:59,052 INFO  L297   olderBase$Statistics]:   existing Event has 192 ancestors and is not cut-off event
[2024-03-12 00:30:59,053 INFO  L297   olderBase$Statistics]:   existing Event has 192 ancestors and is not cut-off event
[2024-03-12 00:30:59,053 INFO  L297   olderBase$Statistics]:   existing Event has 192 ancestors and is not cut-off event
[2024-03-12 00:30:59,070 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([605] L1061-5-->L1061-6: Formula: (let ((.cse0 (select |v_#race_30| |v_ULTIMATE.start_main_~#tids~0#1.base_17|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 1)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 3)) 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_17|))))  InVars {#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  OutVars{#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  AuxVars[]  AssignedVars[][227], [278#(= |#race~datas~0| 0), 24#L1061-6true, Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 326#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 323#(= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0), Black: 324#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 325#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|)))), 321#true, Black: 268#(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)), 337#true, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 264#true, Black: 267#(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: 276#true, 333#true, Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0)), 281#true, Black: 350#(and (<= (+ 2 |ULTIMATE.start_main_#t~nondet18#1|) 0) (<= (+ 2 ~threads_mask~0) 0)), Black: 352#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ 2 ~threads_mask~0) 0)), Black: 344#(and (<= (+ 2 ~threads_mask~0) 0) (= |threadThread1of2ForFork0_#t~nondet4| 1)), Black: 291#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 340#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0)), Black: 290#(<= (+ ~threads_mask~0 1) 0), Black: 348#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ 2 |ULTIMATE.start_main_#t~nondet18#1|) 0) (<= (+ 2 ~threads_mask~0) 0)), Black: 343#(<= (+ 2 ~threads_mask~0) 0), 269#(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)), 100#L1044-10true, Black: 298#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= 0 (+ ~threads_mask~0 1))), threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, Black: 306#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet17#1|)) (<= 0 (+ ~threads_mask~0 1))), 135#L1044-8true, 360#true])
[2024-03-12 00:30:59,070 INFO  L294   olderBase$Statistics]: this new event has 192 ancestors and is not cut-off event
[2024-03-12 00:30:59,070 INFO  L297   olderBase$Statistics]:   existing Event has 192 ancestors and is not cut-off event
[2024-03-12 00:30:59,070 INFO  L297   olderBase$Statistics]:   existing Event has 192 ancestors and is not cut-off event
[2024-03-12 00:30:59,071 INFO  L297   olderBase$Statistics]:   existing Event has 192 ancestors and is not cut-off event
[2024-03-12 00:30:59,086 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([531] L1063-5-->L1063-6: Formula: (let ((.cse0 (select |v_#race_50| |v_ULTIMATE.start_main_~#tids~0#1.base_24|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 1)) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_24|) 0)))  InVars {#race=|v_#race_50|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  OutVars{#race=|v_#race_50|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  AuxVars[]  AssignedVars[][231], [278#(= |#race~datas~0| 0), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 326#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 323#(= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0), Black: 324#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 325#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|)))), 321#true, Black: 268#(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)), 337#true, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 264#true, Black: 267#(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: 276#true, 22#L1063-6true, 333#true, Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0)), 281#true, Black: 350#(and (<= (+ 2 |ULTIMATE.start_main_#t~nondet18#1|) 0) (<= (+ 2 ~threads_mask~0) 0)), Black: 352#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ 2 ~threads_mask~0) 0)), Black: 344#(and (<= (+ 2 ~threads_mask~0) 0) (= |threadThread1of2ForFork0_#t~nondet4| 1)), Black: 291#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 340#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0)), Black: 290#(<= (+ ~threads_mask~0 1) 0), Black: 348#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ 2 |ULTIMATE.start_main_#t~nondet18#1|) 0) (<= (+ 2 ~threads_mask~0) 0)), Black: 343#(<= (+ 2 ~threads_mask~0) 0), 269#(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)), 100#L1044-10true, Black: 298#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= 0 (+ ~threads_mask~0 1))), threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, Black: 306#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet17#1|)) (<= 0 (+ ~threads_mask~0 1))), 135#L1044-8true, 360#true])
[2024-03-12 00:30:59,087 INFO  L294   olderBase$Statistics]: this new event has 193 ancestors and is not cut-off event
[2024-03-12 00:30:59,087 INFO  L297   olderBase$Statistics]:   existing Event has 193 ancestors and is not cut-off event
[2024-03-12 00:30:59,087 INFO  L297   olderBase$Statistics]:   existing Event has 193 ancestors and is not cut-off event
[2024-03-12 00:30:59,087 INFO  L297   olderBase$Statistics]:   existing Event has 193 ancestors and is not cut-off event
[2024-03-12 00:30:59,545 INFO  L124   PetriNetUnfolderBase]: 2539/8962 cut-off events.
[2024-03-12 00:30:59,546 INFO  L125   PetriNetUnfolderBase]: For 5042/6730 co-relation queries the response was YES.
[2024-03-12 00:30:59,596 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19824 conditions, 8962 events. 2539/8962 cut-off events. For 5042/6730 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 82485 event pairs, 350 based on Foata normal form. 11/8362 useless extension candidates. Maximal degree in co-relation 18222. Up to 2555 conditions per place. 
[2024-03-12 00:30:59,627 INFO  L140   encePairwiseOnDemand]: 238/249 looper letters, 60 selfloop transitions, 16 changer transitions 0/399 dead transitions.
[2024-03-12 00:30:59,627 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 399 transitions, 1933 flow
[2024-03-12 00:30:59,628 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-03-12 00:30:59,628 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-03-12 00:30:59,630 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2217 transitions.
[2024-03-12 00:30:59,630 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8903614457831325
[2024-03-12 00:30:59,630 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 2217 transitions.
[2024-03-12 00:30:59,631 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 2217 transitions.
[2024-03-12 00:30:59,631 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:30:59,631 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2217 transitions.
[2024-03-12 00:30:59,633 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 11 states, 10 states have (on average 221.7) internal successors, (2217), 10 states have internal predecessors, (2217), 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)
[2024-03-12 00:30:59,635 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 11 states, 11 states have (on average 249.0) internal successors, (2739), 11 states have internal predecessors, (2739), 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)
[2024-03-12 00:30:59,636 INFO  L81            ComplementDD]: Finished complementDD. Result  has 11 states, 11 states have (on average 249.0) internal successors, (2739), 11 states have internal predecessors, (2739), 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)
[2024-03-12 00:30:59,636 INFO  L175             Difference]: Start difference. First operand has 279 places, 370 transitions, 1671 flow. Second operand 10 states and 2217 transitions.
[2024-03-12 00:30:59,636 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 399 transitions, 1933 flow
[2024-03-12 00:30:59,656 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 399 transitions, 1924 flow, removed 2 selfloop flow, removed 2 redundant places.
[2024-03-12 00:30:59,659 INFO  L231             Difference]: Finished difference. Result has 288 places, 371 transitions, 1709 flow
[2024-03-12 00:30:59,660 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=1662, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1709, PETRI_PLACES=288, PETRI_TRANSITIONS=371}
[2024-03-12 00:30:59,660 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 49 predicate places.
[2024-03-12 00:30:59,660 INFO  L495      AbstractCegarLoop]: Abstraction has has 288 places, 371 transitions, 1709 flow
[2024-03-12 00:30:59,661 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 216.25) internal successors, (1730), 8 states have internal predecessors, (1730), 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)
[2024-03-12 00:30:59,661 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:30:59,661 INFO  L208   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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:30:59,661 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2024-03-12 00:30:59,661 INFO  L420      AbstractCegarLoop]: === Iteration 16 === Targeting threadErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-12 00:30:59,661 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:30:59,662 INFO  L85        PathProgramCache]: Analyzing trace with hash 1630056140, now seen corresponding path program 1 times
[2024-03-12 00:30:59,662 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:30:59,662 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325755242]
[2024-03-12 00:30:59,662 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:30:59,662 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:30:59,678 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:30:59,779 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:30:59,780 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:30:59,780 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325755242]
[2024-03-12 00:30:59,780 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325755242] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:30:59,780 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:30:59,780 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-03-12 00:30:59,780 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13400936]
[2024-03-12 00:30:59,780 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:30:59,781 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-03-12 00:30:59,781 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:30:59,781 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-03-12 00:30:59,781 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-03-12 00:30:59,939 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 214 out of 249
[2024-03-12 00:30:59,940 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 371 transitions, 1709 flow. Second operand  has 7 states, 7 states have (on average 216.42857142857142) internal successors, (1515), 7 states have internal predecessors, (1515), 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)
[2024-03-12 00:30:59,941 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:30:59,941 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 249
[2024-03-12 00:30:59,941 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:31:00,807 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([605] L1061-5-->L1061-6: Formula: (let ((.cse0 (select |v_#race_30| |v_ULTIMATE.start_main_~#tids~0#1.base_17|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 1)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 3)) 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_17|))))  InVars {#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  OutVars{#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  AuxVars[]  AssignedVars[][231], [278#(= |#race~datas~0| 0), 24#L1061-6true, Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 326#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 323#(= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0), Black: 324#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 325#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|)))), 321#true, Black: 268#(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: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 337#true, Black: 264#true, Black: 267#(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: 276#true, 379#true, 333#true, Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0)), 120#L1044-9true, 281#true, Black: 350#(and (<= (+ 2 |ULTIMATE.start_main_#t~nondet18#1|) 0) (<= (+ 2 ~threads_mask~0) 0)), Black: 352#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ 2 ~threads_mask~0) 0)), Black: 344#(and (<= (+ 2 ~threads_mask~0) 0) (= |threadThread1of2ForFork0_#t~nondet4| 1)), Black: 291#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 340#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0)), Black: 290#(<= (+ ~threads_mask~0 1) 0), Black: 348#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ 2 |ULTIMATE.start_main_#t~nondet18#1|) 0) (<= (+ 2 ~threads_mask~0) 0)), Black: 343#(<= (+ 2 ~threads_mask~0) 0), 269#(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: 298#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= 0 (+ ~threads_mask~0 1))), threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, Black: 306#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet17#1|)) (<= 0 (+ ~threads_mask~0 1))), Black: 366#(<= (+ 2 ~threads_mask~0) 0), 135#L1044-8true, Black: 367#(and (<= (+ ~threads_mask~0 4) |threadThread1of2ForFork0_#t~nondet4|) (<= (+ 2 ~threads_mask~0) 0)), 360#true])
[2024-03-12 00:31:00,808 INFO  L294   olderBase$Statistics]: this new event has 191 ancestors and is not cut-off event
[2024-03-12 00:31:00,808 INFO  L297   olderBase$Statistics]:   existing Event has 191 ancestors and is not cut-off event
[2024-03-12 00:31:00,808 INFO  L297   olderBase$Statistics]:   existing Event has 191 ancestors and is not cut-off event
[2024-03-12 00:31:00,808 INFO  L297   olderBase$Statistics]:   existing Event has 191 ancestors and is not cut-off event
[2024-03-12 00:31:00,826 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([531] L1063-5-->L1063-6: Formula: (let ((.cse0 (select |v_#race_50| |v_ULTIMATE.start_main_~#tids~0#1.base_24|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 1)) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_24|) 0)))  InVars {#race=|v_#race_50|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  OutVars{#race=|v_#race_50|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  AuxVars[]  AssignedVars[][237], [278#(= |#race~datas~0| 0), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 326#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 323#(= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0), Black: 324#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 325#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|)))), 321#true, Black: 268#(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)), 337#true, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 264#true, Black: 267#(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: 276#true, 22#L1063-6true, 379#true, 333#true, Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0)), 120#L1044-9true, 281#true, Black: 350#(and (<= (+ 2 |ULTIMATE.start_main_#t~nondet18#1|) 0) (<= (+ 2 ~threads_mask~0) 0)), Black: 352#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ 2 ~threads_mask~0) 0)), Black: 344#(and (<= (+ 2 ~threads_mask~0) 0) (= |threadThread1of2ForFork0_#t~nondet4| 1)), Black: 291#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 340#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0)), Black: 290#(<= (+ ~threads_mask~0 1) 0), Black: 348#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ 2 |ULTIMATE.start_main_#t~nondet18#1|) 0) (<= (+ 2 ~threads_mask~0) 0)), Black: 343#(<= (+ 2 ~threads_mask~0) 0), 269#(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: 298#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= 0 (+ ~threads_mask~0 1))), threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, Black: 306#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet17#1|)) (<= 0 (+ ~threads_mask~0 1))), Black: 366#(<= (+ 2 ~threads_mask~0) 0), 135#L1044-8true, Black: 367#(and (<= (+ ~threads_mask~0 4) |threadThread1of2ForFork0_#t~nondet4|) (<= (+ 2 ~threads_mask~0) 0)), 360#true])
[2024-03-12 00:31:00,826 INFO  L294   olderBase$Statistics]: this new event has 192 ancestors and is not cut-off event
[2024-03-12 00:31:00,826 INFO  L297   olderBase$Statistics]:   existing Event has 192 ancestors and is not cut-off event
[2024-03-12 00:31:00,826 INFO  L297   olderBase$Statistics]:   existing Event has 192 ancestors and is not cut-off event
[2024-03-12 00:31:00,826 INFO  L297   olderBase$Statistics]:   existing Event has 192 ancestors and is not cut-off event
[2024-03-12 00:31:00,841 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([605] L1061-5-->L1061-6: Formula: (let ((.cse0 (select |v_#race_30| |v_ULTIMATE.start_main_~#tids~0#1.base_17|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 1)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 3)) 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_17|))))  InVars {#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  OutVars{#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  AuxVars[]  AssignedVars[][231], [278#(= |#race~datas~0| 0), 24#L1061-6true, Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 326#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 323#(= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0), Black: 324#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 325#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|)))), 321#true, Black: 268#(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: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 337#true, Black: 264#true, Black: 267#(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: 276#true, 379#true, 333#true, Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0)), 281#true, Black: 350#(and (<= (+ 2 |ULTIMATE.start_main_#t~nondet18#1|) 0) (<= (+ 2 ~threads_mask~0) 0)), Black: 352#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ 2 ~threads_mask~0) 0)), Black: 344#(and (<= (+ 2 ~threads_mask~0) 0) (= |threadThread1of2ForFork0_#t~nondet4| 1)), Black: 291#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 340#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0)), Black: 290#(<= (+ ~threads_mask~0 1) 0), Black: 348#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ 2 |ULTIMATE.start_main_#t~nondet18#1|) 0) (<= (+ 2 ~threads_mask~0) 0)), Black: 343#(<= (+ 2 ~threads_mask~0) 0), 269#(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)), 100#L1044-10true, Black: 298#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= 0 (+ ~threads_mask~0 1))), threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, Black: 306#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet17#1|)) (<= 0 (+ ~threads_mask~0 1))), 135#L1044-8true, Black: 366#(<= (+ 2 ~threads_mask~0) 0), Black: 367#(and (<= (+ ~threads_mask~0 4) |threadThread1of2ForFork0_#t~nondet4|) (<= (+ 2 ~threads_mask~0) 0)), 360#true])
[2024-03-12 00:31:00,841 INFO  L294   olderBase$Statistics]: this new event has 192 ancestors and is not cut-off event
[2024-03-12 00:31:00,841 INFO  L297   olderBase$Statistics]:   existing Event has 192 ancestors and is not cut-off event
[2024-03-12 00:31:00,841 INFO  L297   olderBase$Statistics]:   existing Event has 192 ancestors and is not cut-off event
[2024-03-12 00:31:00,842 INFO  L297   olderBase$Statistics]:   existing Event has 192 ancestors and is not cut-off event
[2024-03-12 00:31:00,855 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([531] L1063-5-->L1063-6: Formula: (let ((.cse0 (select |v_#race_50| |v_ULTIMATE.start_main_~#tids~0#1.base_24|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 1)) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_24|) 0)))  InVars {#race=|v_#race_50|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  OutVars{#race=|v_#race_50|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  AuxVars[]  AssignedVars[][237], [278#(= |#race~datas~0| 0), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 326#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 323#(= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0), Black: 324#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 325#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|)))), 321#true, Black: 268#(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)), 337#true, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 264#true, Black: 267#(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: 276#true, 22#L1063-6true, 379#true, 333#true, Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0)), 281#true, Black: 350#(and (<= (+ 2 |ULTIMATE.start_main_#t~nondet18#1|) 0) (<= (+ 2 ~threads_mask~0) 0)), Black: 352#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ 2 ~threads_mask~0) 0)), Black: 344#(and (<= (+ 2 ~threads_mask~0) 0) (= |threadThread1of2ForFork0_#t~nondet4| 1)), Black: 291#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 340#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0)), Black: 290#(<= (+ ~threads_mask~0 1) 0), Black: 348#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ 2 |ULTIMATE.start_main_#t~nondet18#1|) 0) (<= (+ 2 ~threads_mask~0) 0)), Black: 343#(<= (+ 2 ~threads_mask~0) 0), 269#(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)), 100#L1044-10true, Black: 298#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= 0 (+ ~threads_mask~0 1))), threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, Black: 306#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet17#1|)) (<= 0 (+ ~threads_mask~0 1))), Black: 366#(<= (+ 2 ~threads_mask~0) 0), 135#L1044-8true, Black: 367#(and (<= (+ ~threads_mask~0 4) |threadThread1of2ForFork0_#t~nondet4|) (<= (+ 2 ~threads_mask~0) 0)), 360#true])
[2024-03-12 00:31:00,856 INFO  L294   olderBase$Statistics]: this new event has 193 ancestors and is not cut-off event
[2024-03-12 00:31:00,856 INFO  L297   olderBase$Statistics]:   existing Event has 193 ancestors and is not cut-off event
[2024-03-12 00:31:00,856 INFO  L297   olderBase$Statistics]:   existing Event has 193 ancestors and is not cut-off event
[2024-03-12 00:31:00,856 INFO  L297   olderBase$Statistics]:   existing Event has 193 ancestors and is not cut-off event
[2024-03-12 00:31:01,242 INFO  L124   PetriNetUnfolderBase]: 2604/9353 cut-off events.
[2024-03-12 00:31:01,242 INFO  L125   PetriNetUnfolderBase]: For 5298/6988 co-relation queries the response was YES.
[2024-03-12 00:31:01,291 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20561 conditions, 9353 events. 2604/9353 cut-off events. For 5298/6988 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 86906 event pairs, 375 based on Foata normal form. 19/8719 useless extension candidates. Maximal degree in co-relation 18402. Up to 2558 conditions per place. 
[2024-03-12 00:31:01,319 INFO  L140   encePairwiseOnDemand]: 235/249 looper letters, 67 selfloop transitions, 16 changer transitions 0/406 dead transitions.
[2024-03-12 00:31:01,319 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 406 transitions, 2025 flow
[2024-03-12 00:31:01,320 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-03-12 00:31:01,320 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-03-12 00:31:01,321 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2214 transitions.
[2024-03-12 00:31:01,322 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8891566265060241
[2024-03-12 00:31:01,322 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 2214 transitions.
[2024-03-12 00:31:01,322 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 2214 transitions.
[2024-03-12 00:31:01,322 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:31:01,322 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2214 transitions.
[2024-03-12 00:31:01,324 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 11 states, 10 states have (on average 221.4) internal successors, (2214), 10 states have internal predecessors, (2214), 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)
[2024-03-12 00:31:01,326 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 11 states, 11 states have (on average 249.0) internal successors, (2739), 11 states have internal predecessors, (2739), 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)
[2024-03-12 00:31:01,326 INFO  L81            ComplementDD]: Finished complementDD. Result  has 11 states, 11 states have (on average 249.0) internal successors, (2739), 11 states have internal predecessors, (2739), 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)
[2024-03-12 00:31:01,326 INFO  L175             Difference]: Start difference. First operand has 288 places, 371 transitions, 1709 flow. Second operand 10 states and 2214 transitions.
[2024-03-12 00:31:01,327 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 406 transitions, 2025 flow
[2024-03-12 00:31:01,346 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 406 transitions, 2002 flow, removed 0 selfloop flow, removed 7 redundant places.
[2024-03-12 00:31:01,350 INFO  L231             Difference]: Finished difference. Result has 296 places, 383 transitions, 1823 flow
[2024-03-12 00:31:01,350 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=1686, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=357, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1823, PETRI_PLACES=296, PETRI_TRANSITIONS=383}
[2024-03-12 00:31:01,351 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 57 predicate places.
[2024-03-12 00:31:01,351 INFO  L495      AbstractCegarLoop]: Abstraction has has 296 places, 383 transitions, 1823 flow
[2024-03-12 00:31:01,351 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 216.42857142857142) internal successors, (1515), 7 states have internal predecessors, (1515), 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)
[2024-03-12 00:31:01,351 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:31:01,351 INFO  L208   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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:31:01,351 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36
[2024-03-12 00:31:01,352 INFO  L420      AbstractCegarLoop]: === Iteration 17 === Targeting threadErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-12 00:31:01,352 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:31:01,352 INFO  L85        PathProgramCache]: Analyzing trace with hash -1487153428, now seen corresponding path program 1 times
[2024-03-12 00:31:01,352 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:31:01,352 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848059192]
[2024-03-12 00:31:01,352 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:31:01,352 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:31:01,367 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:31:01,450 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:31:01,450 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:31:01,450 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848059192]
[2024-03-12 00:31:01,450 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848059192] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:31:01,450 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:31:01,451 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-03-12 00:31:01,451 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865566594]
[2024-03-12 00:31:01,451 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:31:01,451 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-03-12 00:31:01,452 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:31:01,452 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-03-12 00:31:01,452 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-03-12 00:31:01,584 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 215 out of 249
[2024-03-12 00:31:01,585 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 383 transitions, 1823 flow. Second operand  has 7 states, 7 states have (on average 217.42857142857142) internal successors, (1522), 7 states have internal predecessors, (1522), 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)
[2024-03-12 00:31:01,585 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:31:01,585 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 249
[2024-03-12 00:31:01,585 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:31:02,500 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([605] L1061-5-->L1061-6: Formula: (let ((.cse0 (select |v_#race_30| |v_ULTIMATE.start_main_~#tids~0#1.base_17|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 1)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 3)) 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_17|))))  InVars {#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  OutVars{#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  AuxVars[]  AssignedVars[][231], [278#(= |#race~datas~0| 0), 24#L1061-6true, Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 326#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 323#(= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0), Black: 324#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 325#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|)))), Black: 382#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 391#(and (<= (+ 3 |ULTIMATE.start_main_#t~nondet18#1|) 0) (<= (+ 3 ~threads_mask~0) 0)), 321#true, Black: 389#(and (<= (+ 3 |ULTIMATE.start_main_#t~nondet18#1|) 0) (<= (+ 3 ~threads_mask~0) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 385#(and (<= (+ 3 ~threads_mask~0) 0) (= |threadThread1of2ForFork0_#t~nondet4| 1)), Black: 268#(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: 384#(<= (+ 3 ~threads_mask~0) 0), Black: 393#(and (<= (+ 3 ~threads_mask~0) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 337#true, Black: 264#true, Black: 267#(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: 276#true, 379#true, 333#true, Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0)), 120#L1044-9true, 281#true, Black: 350#(and (<= (+ 2 |ULTIMATE.start_main_#t~nondet18#1|) 0) (<= (+ 2 ~threads_mask~0) 0)), Black: 352#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ 2 ~threads_mask~0) 0)), Black: 344#(and (<= (+ 2 ~threads_mask~0) 0) (= |threadThread1of2ForFork0_#t~nondet4| 1)), Black: 291#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 340#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0)), Black: 348#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ 2 |ULTIMATE.start_main_#t~nondet18#1|) 0) (<= (+ 2 ~threads_mask~0) 0)), Black: 290#(<= (+ ~threads_mask~0 1) 0), Black: 343#(<= (+ 2 ~threads_mask~0) 0), 269#(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: 298#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= 0 (+ ~threads_mask~0 1))), threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, Black: 306#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet17#1|)) (<= 0 (+ ~threads_mask~0 1))), Black: 366#(<= (+ 2 ~threads_mask~0) 0), 135#L1044-8true, Black: 367#(and (<= (+ ~threads_mask~0 4) |threadThread1of2ForFork0_#t~nondet4|) (<= (+ 2 ~threads_mask~0) 0)), 401#true])
[2024-03-12 00:31:02,501 INFO  L294   olderBase$Statistics]: this new event has 191 ancestors and is not cut-off event
[2024-03-12 00:31:02,501 INFO  L297   olderBase$Statistics]:   existing Event has 191 ancestors and is not cut-off event
[2024-03-12 00:31:02,501 INFO  L297   olderBase$Statistics]:   existing Event has 191 ancestors and is not cut-off event
[2024-03-12 00:31:02,501 INFO  L297   olderBase$Statistics]:   existing Event has 191 ancestors and is not cut-off event
[2024-03-12 00:31:02,519 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([531] L1063-5-->L1063-6: Formula: (let ((.cse0 (select |v_#race_50| |v_ULTIMATE.start_main_~#tids~0#1.base_24|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 1)) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_24|) 0)))  InVars {#race=|v_#race_50|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  OutVars{#race=|v_#race_50|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  AuxVars[]  AssignedVars[][238], [278#(= |#race~datas~0| 0), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 326#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 323#(= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0), Black: 324#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 325#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|)))), Black: 382#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 391#(and (<= (+ 3 |ULTIMATE.start_main_#t~nondet18#1|) 0) (<= (+ 3 ~threads_mask~0) 0)), 321#true, Black: 389#(and (<= (+ 3 |ULTIMATE.start_main_#t~nondet18#1|) 0) (<= (+ 3 ~threads_mask~0) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 385#(and (<= (+ 3 ~threads_mask~0) 0) (= |threadThread1of2ForFork0_#t~nondet4| 1)), Black: 384#(<= (+ 3 ~threads_mask~0) 0), Black: 268#(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: 393#(and (<= (+ 3 ~threads_mask~0) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), 337#true, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 264#true, Black: 267#(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: 276#true, 22#L1063-6true, 379#true, 333#true, Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0)), 281#true, 120#L1044-9true, Black: 350#(and (<= (+ 2 |ULTIMATE.start_main_#t~nondet18#1|) 0) (<= (+ 2 ~threads_mask~0) 0)), Black: 352#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ 2 ~threads_mask~0) 0)), Black: 344#(and (<= (+ 2 ~threads_mask~0) 0) (= |threadThread1of2ForFork0_#t~nondet4| 1)), Black: 291#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 340#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0)), Black: 348#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ 2 |ULTIMATE.start_main_#t~nondet18#1|) 0) (<= (+ 2 ~threads_mask~0) 0)), Black: 290#(<= (+ ~threads_mask~0 1) 0), Black: 343#(<= (+ 2 ~threads_mask~0) 0), 269#(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: 298#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= 0 (+ ~threads_mask~0 1))), threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, Black: 306#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet17#1|)) (<= 0 (+ ~threads_mask~0 1))), Black: 366#(<= (+ 2 ~threads_mask~0) 0), 135#L1044-8true, Black: 367#(and (<= (+ ~threads_mask~0 4) |threadThread1of2ForFork0_#t~nondet4|) (<= (+ 2 ~threads_mask~0) 0)), 401#true])
[2024-03-12 00:31:02,520 INFO  L294   olderBase$Statistics]: this new event has 192 ancestors and is not cut-off event
[2024-03-12 00:31:02,520 INFO  L297   olderBase$Statistics]:   existing Event has 192 ancestors and is not cut-off event
[2024-03-12 00:31:02,520 INFO  L297   olderBase$Statistics]:   existing Event has 192 ancestors and is not cut-off event
[2024-03-12 00:31:02,520 INFO  L297   olderBase$Statistics]:   existing Event has 192 ancestors and is not cut-off event
[2024-03-12 00:31:02,535 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([605] L1061-5-->L1061-6: Formula: (let ((.cse0 (select |v_#race_30| |v_ULTIMATE.start_main_~#tids~0#1.base_17|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 1)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 3)) 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_17|))))  InVars {#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  OutVars{#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  AuxVars[]  AssignedVars[][231], [278#(= |#race~datas~0| 0), 24#L1061-6true, Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 326#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 323#(= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0), Black: 324#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 325#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|)))), Black: 382#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 391#(and (<= (+ 3 |ULTIMATE.start_main_#t~nondet18#1|) 0) (<= (+ 3 ~threads_mask~0) 0)), 321#true, Black: 389#(and (<= (+ 3 |ULTIMATE.start_main_#t~nondet18#1|) 0) (<= (+ 3 ~threads_mask~0) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 385#(and (<= (+ 3 ~threads_mask~0) 0) (= |threadThread1of2ForFork0_#t~nondet4| 1)), Black: 268#(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: 384#(<= (+ 3 ~threads_mask~0) 0), Black: 393#(and (<= (+ 3 ~threads_mask~0) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 337#true, Black: 264#true, Black: 267#(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: 276#true, 379#true, 333#true, Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0)), 281#true, Black: 350#(and (<= (+ 2 |ULTIMATE.start_main_#t~nondet18#1|) 0) (<= (+ 2 ~threads_mask~0) 0)), Black: 352#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ 2 ~threads_mask~0) 0)), Black: 344#(and (<= (+ 2 ~threads_mask~0) 0) (= |threadThread1of2ForFork0_#t~nondet4| 1)), Black: 291#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 340#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0)), Black: 348#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ 2 |ULTIMATE.start_main_#t~nondet18#1|) 0) (<= (+ 2 ~threads_mask~0) 0)), Black: 290#(<= (+ ~threads_mask~0 1) 0), Black: 343#(<= (+ 2 ~threads_mask~0) 0), 269#(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)), 100#L1044-10true, Black: 298#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= 0 (+ ~threads_mask~0 1))), threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, Black: 306#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet17#1|)) (<= 0 (+ ~threads_mask~0 1))), Black: 366#(<= (+ 2 ~threads_mask~0) 0), 135#L1044-8true, Black: 367#(and (<= (+ ~threads_mask~0 4) |threadThread1of2ForFork0_#t~nondet4|) (<= (+ 2 ~threads_mask~0) 0)), 401#true])
[2024-03-12 00:31:02,536 INFO  L294   olderBase$Statistics]: this new event has 192 ancestors and is not cut-off event
[2024-03-12 00:31:02,536 INFO  L297   olderBase$Statistics]:   existing Event has 192 ancestors and is not cut-off event
[2024-03-12 00:31:02,536 INFO  L297   olderBase$Statistics]:   existing Event has 192 ancestors and is not cut-off event
[2024-03-12 00:31:02,536 INFO  L297   olderBase$Statistics]:   existing Event has 192 ancestors and is not cut-off event
[2024-03-12 00:31:02,550 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([531] L1063-5-->L1063-6: Formula: (let ((.cse0 (select |v_#race_50| |v_ULTIMATE.start_main_~#tids~0#1.base_24|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 1)) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_24|) 0)))  InVars {#race=|v_#race_50|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  OutVars{#race=|v_#race_50|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  AuxVars[]  AssignedVars[][238], [278#(= |#race~datas~0| 0), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 326#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 323#(= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0), Black: 324#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 325#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|)))), Black: 382#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 391#(and (<= (+ 3 |ULTIMATE.start_main_#t~nondet18#1|) 0) (<= (+ 3 ~threads_mask~0) 0)), 321#true, Black: 389#(and (<= (+ 3 |ULTIMATE.start_main_#t~nondet18#1|) 0) (<= (+ 3 ~threads_mask~0) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 385#(and (<= (+ 3 ~threads_mask~0) 0) (= |threadThread1of2ForFork0_#t~nondet4| 1)), Black: 384#(<= (+ 3 ~threads_mask~0) 0), Black: 268#(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: 393#(and (<= (+ 3 ~threads_mask~0) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), 337#true, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 264#true, Black: 267#(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: 276#true, 22#L1063-6true, 379#true, 333#true, Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0)), 281#true, Black: 350#(and (<= (+ 2 |ULTIMATE.start_main_#t~nondet18#1|) 0) (<= (+ 2 ~threads_mask~0) 0)), Black: 352#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ 2 ~threads_mask~0) 0)), Black: 344#(and (<= (+ 2 ~threads_mask~0) 0) (= |threadThread1of2ForFork0_#t~nondet4| 1)), Black: 291#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 340#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0)), Black: 348#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ 2 |ULTIMATE.start_main_#t~nondet18#1|) 0) (<= (+ 2 ~threads_mask~0) 0)), Black: 290#(<= (+ ~threads_mask~0 1) 0), Black: 343#(<= (+ 2 ~threads_mask~0) 0), 269#(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)), 100#L1044-10true, Black: 298#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= 0 (+ ~threads_mask~0 1))), threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, Black: 306#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet17#1|)) (<= 0 (+ ~threads_mask~0 1))), Black: 366#(<= (+ 2 ~threads_mask~0) 0), 135#L1044-8true, Black: 367#(and (<= (+ ~threads_mask~0 4) |threadThread1of2ForFork0_#t~nondet4|) (<= (+ 2 ~threads_mask~0) 0)), 401#true])
[2024-03-12 00:31:02,550 INFO  L294   olderBase$Statistics]: this new event has 193 ancestors and is not cut-off event
[2024-03-12 00:31:02,550 INFO  L297   olderBase$Statistics]:   existing Event has 193 ancestors and is not cut-off event
[2024-03-12 00:31:02,550 INFO  L297   olderBase$Statistics]:   existing Event has 193 ancestors and is not cut-off event
[2024-03-12 00:31:02,550 INFO  L297   olderBase$Statistics]:   existing Event has 193 ancestors and is not cut-off event
[2024-03-12 00:31:02,959 INFO  L124   PetriNetUnfolderBase]: 2608/9301 cut-off events.
[2024-03-12 00:31:02,959 INFO  L125   PetriNetUnfolderBase]: For 5937/10430 co-relation queries the response was YES.
[2024-03-12 00:31:03,014 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20714 conditions, 9301 events. 2608/9301 cut-off events. For 5937/10430 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 86874 event pairs, 364 based on Foata normal form. 9/8607 useless extension candidates. Maximal degree in co-relation 19720. Up to 2586 conditions per place. 
[2024-03-12 00:31:03,043 INFO  L140   encePairwiseOnDemand]: 237/249 looper letters, 64 selfloop transitions, 16 changer transitions 0/404 dead transitions.
[2024-03-12 00:31:03,043 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 404 transitions, 2077 flow
[2024-03-12 00:31:03,044 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-03-12 00:31:03,044 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-03-12 00:31:03,045 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2219 transitions.
[2024-03-12 00:31:03,046 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8911646586345382
[2024-03-12 00:31:03,046 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 2219 transitions.
[2024-03-12 00:31:03,046 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 2219 transitions.
[2024-03-12 00:31:03,046 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:31:03,046 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2219 transitions.
[2024-03-12 00:31:03,048 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 11 states, 10 states have (on average 221.9) internal successors, (2219), 10 states have internal predecessors, (2219), 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)
[2024-03-12 00:31:03,050 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 11 states, 11 states have (on average 249.0) internal successors, (2739), 11 states have internal predecessors, (2739), 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)
[2024-03-12 00:31:03,050 INFO  L81            ComplementDD]: Finished complementDD. Result  has 11 states, 11 states have (on average 249.0) internal successors, (2739), 11 states have internal predecessors, (2739), 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)
[2024-03-12 00:31:03,050 INFO  L175             Difference]: Start difference. First operand has 296 places, 383 transitions, 1823 flow. Second operand 10 states and 2219 transitions.
[2024-03-12 00:31:03,051 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 404 transitions, 2077 flow
[2024-03-12 00:31:03,072 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 404 transitions, 2046 flow, removed 13 selfloop flow, removed 2 redundant places.
[2024-03-12 00:31:03,075 INFO  L231             Difference]: Finished difference. Result has 305 places, 384 transitions, 1841 flow
[2024-03-12 00:31:03,075 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=1792, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=383, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1841, PETRI_PLACES=305, PETRI_TRANSITIONS=384}
[2024-03-12 00:31:03,076 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 66 predicate places.
[2024-03-12 00:31:03,076 INFO  L495      AbstractCegarLoop]: Abstraction has has 305 places, 384 transitions, 1841 flow
[2024-03-12 00:31:03,076 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 217.42857142857142) internal successors, (1522), 7 states have internal predecessors, (1522), 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)
[2024-03-12 00:31:03,076 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:31:03,076 INFO  L208   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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:31:03,076 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37
[2024-03-12 00:31:03,077 INFO  L420      AbstractCegarLoop]: === Iteration 18 === Targeting threadErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-12 00:31:03,077 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:31:03,077 INFO  L85        PathProgramCache]: Analyzing trace with hash -1749931556, now seen corresponding path program 1 times
[2024-03-12 00:31:03,077 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:31:03,077 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004768036]
[2024-03-12 00:31:03,077 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:31:03,078 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:31:03,091 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:31:03,110 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:31:03,110 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:31:03,111 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004768036]
[2024-03-12 00:31:03,111 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004768036] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:31:03,111 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:31:03,111 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-03-12 00:31:03,111 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719293730]
[2024-03-12 00:31:03,111 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:31:03,112 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 00:31:03,112 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:31:03,112 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 00:31:03,112 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 00:31:03,130 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 231 out of 249
[2024-03-12 00:31:03,130 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 384 transitions, 1841 flow. Second operand  has 3 states, 3 states have (on average 233.66666666666666) internal successors, (701), 3 states have internal predecessors, (701), 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)
[2024-03-12 00:31:03,130 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:31:03,130 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 249
[2024-03-12 00:31:03,130 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:31:03,926 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([605] L1061-5-->L1061-6: Formula: (let ((.cse0 (select |v_#race_30| |v_ULTIMATE.start_main_~#tids~0#1.base_17|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 1)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 3)) 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_17|))))  InVars {#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  OutVars{#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  AuxVars[]  AssignedVars[][220], [278#(= |#race~datas~0| 0), 24#L1061-6true, Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 326#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 323#(= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0), Black: 324#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 325#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|)))), Black: 382#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), 321#true, Black: 391#(and (<= (+ 3 |ULTIMATE.start_main_#t~nondet18#1|) 0) (<= (+ 3 ~threads_mask~0) 0)), 419#true, Black: 389#(and (<= (+ 3 |ULTIMATE.start_main_#t~nondet18#1|) 0) (<= (+ 3 ~threads_mask~0) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 385#(and (<= (+ 3 ~threads_mask~0) 0) (= |threadThread1of2ForFork0_#t~nondet4| 1)), Black: 384#(<= (+ 3 ~threads_mask~0) 0), Black: 268#(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: 393#(and (<= (+ 3 ~threads_mask~0) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 337#true, Black: 264#true, Black: 267#(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: 276#true, 379#true, Black: 283#(<= (+ ~threads_mask~0 1) 0), 333#true, Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0)), 281#true, 120#L1044-9true, Black: 406#(<= (+ 3 ~threads_mask~0) 0), Black: 407#(and (<= (+ 5 ~threads_mask~0) |threadThread1of2ForFork0_#t~nondet4|) (<= (+ 3 ~threads_mask~0) 0)), Black: 350#(and (<= (+ 2 |ULTIMATE.start_main_#t~nondet18#1|) 0) (<= (+ 2 ~threads_mask~0) 0)), Black: 352#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ 2 ~threads_mask~0) 0)), Black: 344#(and (<= (+ 2 ~threads_mask~0) 0) (= |threadThread1of2ForFork0_#t~nondet4| 1)), Black: 291#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 340#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0)), Black: 290#(<= (+ ~threads_mask~0 1) 0), Black: 348#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ 2 |ULTIMATE.start_main_#t~nondet18#1|) 0) (<= (+ 2 ~threads_mask~0) 0)), Black: 343#(<= (+ 2 ~threads_mask~0) 0), 269#(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: 298#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= 0 (+ ~threads_mask~0 1))), threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, Black: 306#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet17#1|)) (<= 0 (+ ~threads_mask~0 1))), Black: 366#(<= (+ 2 ~threads_mask~0) 0), 135#L1044-8true, Black: 367#(and (<= (+ ~threads_mask~0 4) |threadThread1of2ForFork0_#t~nondet4|) (<= (+ 2 ~threads_mask~0) 0)), 401#true])
[2024-03-12 00:31:03,926 INFO  L294   olderBase$Statistics]: this new event has 191 ancestors and is not cut-off event
[2024-03-12 00:31:03,926 INFO  L297   olderBase$Statistics]:   existing Event has 191 ancestors and is not cut-off event
[2024-03-12 00:31:03,926 INFO  L297   olderBase$Statistics]:   existing Event has 191 ancestors and is not cut-off event
[2024-03-12 00:31:03,927 INFO  L297   olderBase$Statistics]:   existing Event has 191 ancestors and is not cut-off event
[2024-03-12 00:31:03,946 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([531] L1063-5-->L1063-6: Formula: (let ((.cse0 (select |v_#race_50| |v_ULTIMATE.start_main_~#tids~0#1.base_24|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 1)) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_24|) 0)))  InVars {#race=|v_#race_50|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  OutVars{#race=|v_#race_50|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  AuxVars[]  AssignedVars[][226], [278#(= |#race~datas~0| 0), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 326#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 323#(= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0), Black: 324#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 325#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|)))), Black: 382#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), 321#true, Black: 391#(and (<= (+ 3 |ULTIMATE.start_main_#t~nondet18#1|) 0) (<= (+ 3 ~threads_mask~0) 0)), 419#true, Black: 389#(and (<= (+ 3 |ULTIMATE.start_main_#t~nondet18#1|) 0) (<= (+ 3 ~threads_mask~0) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 385#(and (<= (+ 3 ~threads_mask~0) 0) (= |threadThread1of2ForFork0_#t~nondet4| 1)), Black: 384#(<= (+ 3 ~threads_mask~0) 0), Black: 268#(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: 393#(and (<= (+ 3 ~threads_mask~0) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 337#true, Black: 264#true, Black: 267#(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: 276#true, 22#L1063-6true, 379#true, Black: 283#(<= (+ ~threads_mask~0 1) 0), 333#true, Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0)), 281#true, 120#L1044-9true, Black: 406#(<= (+ 3 ~threads_mask~0) 0), Black: 407#(and (<= (+ 5 ~threads_mask~0) |threadThread1of2ForFork0_#t~nondet4|) (<= (+ 3 ~threads_mask~0) 0)), Black: 350#(and (<= (+ 2 |ULTIMATE.start_main_#t~nondet18#1|) 0) (<= (+ 2 ~threads_mask~0) 0)), Black: 352#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ 2 ~threads_mask~0) 0)), Black: 344#(and (<= (+ 2 ~threads_mask~0) 0) (= |threadThread1of2ForFork0_#t~nondet4| 1)), Black: 291#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 340#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0)), Black: 290#(<= (+ ~threads_mask~0 1) 0), Black: 348#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ 2 |ULTIMATE.start_main_#t~nondet18#1|) 0) (<= (+ 2 ~threads_mask~0) 0)), Black: 343#(<= (+ 2 ~threads_mask~0) 0), 269#(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: 298#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= 0 (+ ~threads_mask~0 1))), threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, Black: 306#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet17#1|)) (<= 0 (+ ~threads_mask~0 1))), Black: 366#(<= (+ 2 ~threads_mask~0) 0), 135#L1044-8true, Black: 367#(and (<= (+ ~threads_mask~0 4) |threadThread1of2ForFork0_#t~nondet4|) (<= (+ 2 ~threads_mask~0) 0)), 401#true])
[2024-03-12 00:31:03,946 INFO  L294   olderBase$Statistics]: this new event has 192 ancestors and is not cut-off event
[2024-03-12 00:31:03,946 INFO  L297   olderBase$Statistics]:   existing Event has 192 ancestors and is not cut-off event
[2024-03-12 00:31:03,946 INFO  L297   olderBase$Statistics]:   existing Event has 192 ancestors and is not cut-off event
[2024-03-12 00:31:03,946 INFO  L297   olderBase$Statistics]:   existing Event has 192 ancestors and is not cut-off event
[2024-03-12 00:31:03,962 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([605] L1061-5-->L1061-6: Formula: (let ((.cse0 (select |v_#race_30| |v_ULTIMATE.start_main_~#tids~0#1.base_17|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 1)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 3)) 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_17|))))  InVars {#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  OutVars{#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  AuxVars[]  AssignedVars[][220], [278#(= |#race~datas~0| 0), 24#L1061-6true, Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 326#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 323#(= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0), Black: 324#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 325#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|)))), Black: 382#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), 321#true, Black: 391#(and (<= (+ 3 |ULTIMATE.start_main_#t~nondet18#1|) 0) (<= (+ 3 ~threads_mask~0) 0)), 419#true, Black: 389#(and (<= (+ 3 |ULTIMATE.start_main_#t~nondet18#1|) 0) (<= (+ 3 ~threads_mask~0) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 385#(and (<= (+ 3 ~threads_mask~0) 0) (= |threadThread1of2ForFork0_#t~nondet4| 1)), Black: 384#(<= (+ 3 ~threads_mask~0) 0), Black: 268#(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: 393#(and (<= (+ 3 ~threads_mask~0) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 337#true, Black: 264#true, Black: 267#(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: 276#true, 379#true, Black: 283#(<= (+ ~threads_mask~0 1) 0), 333#true, Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0)), 281#true, Black: 406#(<= (+ 3 ~threads_mask~0) 0), Black: 407#(and (<= (+ 5 ~threads_mask~0) |threadThread1of2ForFork0_#t~nondet4|) (<= (+ 3 ~threads_mask~0) 0)), Black: 350#(and (<= (+ 2 |ULTIMATE.start_main_#t~nondet18#1|) 0) (<= (+ 2 ~threads_mask~0) 0)), Black: 352#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ 2 ~threads_mask~0) 0)), Black: 344#(and (<= (+ 2 ~threads_mask~0) 0) (= |threadThread1of2ForFork0_#t~nondet4| 1)), Black: 291#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 340#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0)), Black: 290#(<= (+ ~threads_mask~0 1) 0), Black: 348#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ 2 |ULTIMATE.start_main_#t~nondet18#1|) 0) (<= (+ 2 ~threads_mask~0) 0)), Black: 343#(<= (+ 2 ~threads_mask~0) 0), 269#(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)), 100#L1044-10true, Black: 298#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= 0 (+ ~threads_mask~0 1))), threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, Black: 306#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet17#1|)) (<= 0 (+ ~threads_mask~0 1))), Black: 366#(<= (+ 2 ~threads_mask~0) 0), 135#L1044-8true, Black: 367#(and (<= (+ ~threads_mask~0 4) |threadThread1of2ForFork0_#t~nondet4|) (<= (+ 2 ~threads_mask~0) 0)), 401#true])
[2024-03-12 00:31:03,963 INFO  L294   olderBase$Statistics]: this new event has 192 ancestors and is not cut-off event
[2024-03-12 00:31:03,963 INFO  L297   olderBase$Statistics]:   existing Event has 192 ancestors and is not cut-off event
[2024-03-12 00:31:03,963 INFO  L297   olderBase$Statistics]:   existing Event has 192 ancestors and is not cut-off event
[2024-03-12 00:31:03,963 INFO  L297   olderBase$Statistics]:   existing Event has 192 ancestors and is not cut-off event
[2024-03-12 00:31:03,977 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([531] L1063-5-->L1063-6: Formula: (let ((.cse0 (select |v_#race_50| |v_ULTIMATE.start_main_~#tids~0#1.base_24|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 1)) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_24|) 0)))  InVars {#race=|v_#race_50|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  OutVars{#race=|v_#race_50|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  AuxVars[]  AssignedVars[][226], [278#(= |#race~datas~0| 0), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 326#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 323#(= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0), Black: 324#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 325#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|)))), Black: 382#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), 321#true, Black: 391#(and (<= (+ 3 |ULTIMATE.start_main_#t~nondet18#1|) 0) (<= (+ 3 ~threads_mask~0) 0)), 419#true, Black: 389#(and (<= (+ 3 |ULTIMATE.start_main_#t~nondet18#1|) 0) (<= (+ 3 ~threads_mask~0) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 385#(and (<= (+ 3 ~threads_mask~0) 0) (= |threadThread1of2ForFork0_#t~nondet4| 1)), Black: 384#(<= (+ 3 ~threads_mask~0) 0), Black: 268#(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: 393#(and (<= (+ 3 ~threads_mask~0) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 337#true, Black: 264#true, Black: 267#(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: 276#true, 22#L1063-6true, 379#true, Black: 283#(<= (+ ~threads_mask~0 1) 0), 333#true, Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0)), 281#true, Black: 406#(<= (+ 3 ~threads_mask~0) 0), Black: 407#(and (<= (+ 5 ~threads_mask~0) |threadThread1of2ForFork0_#t~nondet4|) (<= (+ 3 ~threads_mask~0) 0)), Black: 350#(and (<= (+ 2 |ULTIMATE.start_main_#t~nondet18#1|) 0) (<= (+ 2 ~threads_mask~0) 0)), Black: 352#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ 2 ~threads_mask~0) 0)), Black: 344#(and (<= (+ 2 ~threads_mask~0) 0) (= |threadThread1of2ForFork0_#t~nondet4| 1)), Black: 291#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 340#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0)), Black: 290#(<= (+ ~threads_mask~0 1) 0), Black: 348#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ 2 |ULTIMATE.start_main_#t~nondet18#1|) 0) (<= (+ 2 ~threads_mask~0) 0)), Black: 343#(<= (+ 2 ~threads_mask~0) 0), 269#(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)), 100#L1044-10true, Black: 298#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= 0 (+ ~threads_mask~0 1))), threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, Black: 306#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet17#1|)) (<= 0 (+ ~threads_mask~0 1))), Black: 366#(<= (+ 2 ~threads_mask~0) 0), 135#L1044-8true, Black: 367#(and (<= (+ ~threads_mask~0 4) |threadThread1of2ForFork0_#t~nondet4|) (<= (+ 2 ~threads_mask~0) 0)), 401#true])
[2024-03-12 00:31:03,977 INFO  L294   olderBase$Statistics]: this new event has 193 ancestors and is not cut-off event
[2024-03-12 00:31:03,977 INFO  L297   olderBase$Statistics]:   existing Event has 193 ancestors and is not cut-off event
[2024-03-12 00:31:03,977 INFO  L297   olderBase$Statistics]:   existing Event has 193 ancestors and is not cut-off event
[2024-03-12 00:31:03,977 INFO  L297   olderBase$Statistics]:   existing Event has 193 ancestors and is not cut-off event
[2024-03-12 00:31:04,370 INFO  L124   PetriNetUnfolderBase]: 2494/8983 cut-off events.
[2024-03-12 00:31:04,371 INFO  L125   PetriNetUnfolderBase]: For 5554/10041 co-relation queries the response was YES.
[2024-03-12 00:31:04,426 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19972 conditions, 8983 events. 2494/8983 cut-off events. For 5554/10041 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 83146 event pairs, 300 based on Foata normal form. 19/8383 useless extension candidates. Maximal degree in co-relation 19156. Up to 2540 conditions per place. 
[2024-03-12 00:31:04,455 INFO  L140   encePairwiseOnDemand]: 246/249 looper letters, 17 selfloop transitions, 4 changer transitions 0/387 dead transitions.
[2024-03-12 00:31:04,455 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 387 transitions, 1897 flow
[2024-03-12 00:31:04,456 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 00:31:04,457 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 00:31:04,458 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 711 transitions.
[2024-03-12 00:31:04,458 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9518072289156626
[2024-03-12 00:31:04,458 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 711 transitions.
[2024-03-12 00:31:04,458 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 711 transitions.
[2024-03-12 00:31:04,459 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:31:04,459 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 711 transitions.
[2024-03-12 00:31:04,461 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 237.0) internal successors, (711), 3 states have internal predecessors, (711), 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)
[2024-03-12 00:31:04,462 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 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)
[2024-03-12 00:31:04,462 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 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)
[2024-03-12 00:31:04,463 INFO  L175             Difference]: Start difference. First operand has 305 places, 384 transitions, 1841 flow. Second operand 3 states and 711 transitions.
[2024-03-12 00:31:04,463 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 387 transitions, 1897 flow
[2024-03-12 00:31:04,489 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 387 transitions, 1872 flow, removed 1 selfloop flow, removed 7 redundant places.
[2024-03-12 00:31:04,492 INFO  L231             Difference]: Finished difference. Result has 301 places, 385 transitions, 1834 flow
[2024-03-12 00:31:04,493 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=1816, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=380, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1834, PETRI_PLACES=301, PETRI_TRANSITIONS=385}
[2024-03-12 00:31:04,493 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 62 predicate places.
[2024-03-12 00:31:04,493 INFO  L495      AbstractCegarLoop]: Abstraction has has 301 places, 385 transitions, 1834 flow
[2024-03-12 00:31:04,493 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 233.66666666666666) internal successors, (701), 3 states have internal predecessors, (701), 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)
[2024-03-12 00:31:04,494 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:31:04,494 INFO  L208   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, 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, 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]
[2024-03-12 00:31:04,494 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38
[2024-03-12 00:31:04,494 INFO  L420      AbstractCegarLoop]: === Iteration 19 === Targeting threadErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-12 00:31:04,494 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:31:04,494 INFO  L85        PathProgramCache]: Analyzing trace with hash 1543601152, now seen corresponding path program 1 times
[2024-03-12 00:31:04,494 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:31:04,495 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366293467]
[2024-03-12 00:31:04,495 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:31:04,495 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:31:04,511 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:31:04,720 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:31:04,720 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:31:04,720 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366293467]
[2024-03-12 00:31:04,720 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366293467] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:31:04,721 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:31:04,721 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 00:31:04,721 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497270021]
[2024-03-12 00:31:04,721 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:31:04,722 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-12 00:31:04,722 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:31:04,723 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-12 00:31:04,723 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-12 00:31:04,900 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 204 out of 249
[2024-03-12 00:31:04,902 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 385 transitions, 1834 flow. Second operand  has 6 states, 6 states have (on average 207.0) internal successors, (1242), 6 states have internal predecessors, (1242), 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)
[2024-03-12 00:31:04,903 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:31:04,903 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 249
[2024-03-12 00:31:04,903 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:31:10,420 INFO  L124   PetriNetUnfolderBase]: 11780/38022 cut-off events.
[2024-03-12 00:31:10,420 INFO  L125   PetriNetUnfolderBase]: For 23110/26561 co-relation queries the response was YES.
[2024-03-12 00:31:10,773 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 84656 conditions, 38022 events. 11780/38022 cut-off events. For 23110/26561 co-relation queries the response was YES. Maximal size of possible extension queue 785. Compared 448967 event pairs, 3156 based on Foata normal form. 187/34879 useless extension candidates. Maximal degree in co-relation 83032. Up to 12973 conditions per place. 
[2024-03-12 00:31:10,903 INFO  L140   encePairwiseOnDemand]: 222/249 looper letters, 193 selfloop transitions, 188 changer transitions 0/614 dead transitions.
[2024-03-12 00:31:10,904 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 614 transitions, 3934 flow
[2024-03-12 00:31:10,905 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 00:31:10,905 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 00:31:10,905 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1387 transitions.
[2024-03-12 00:31:10,906 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.928380187416332
[2024-03-12 00:31:10,906 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 1387 transitions.
[2024-03-12 00:31:10,906 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 1387 transitions.
[2024-03-12 00:31:10,906 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:31:10,907 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1387 transitions.
[2024-03-12 00:31:10,908 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 231.16666666666666) internal successors, (1387), 6 states have internal predecessors, (1387), 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)
[2024-03-12 00:31:10,909 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 249.0) internal successors, (1743), 7 states have internal predecessors, (1743), 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)
[2024-03-12 00:31:10,909 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 249.0) internal successors, (1743), 7 states have internal predecessors, (1743), 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)
[2024-03-12 00:31:10,909 INFO  L175             Difference]: Start difference. First operand has 301 places, 385 transitions, 1834 flow. Second operand 6 states and 1387 transitions.
[2024-03-12 00:31:10,909 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 614 transitions, 3934 flow
[2024-03-12 00:31:10,991 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 614 transitions, 3930 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-12 00:31:10,997 INFO  L231             Difference]: Finished difference. Result has 309 places, 563 transitions, 3716 flow
[2024-03-12 00:31:10,997 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=1830, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=385, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3716, PETRI_PLACES=309, PETRI_TRANSITIONS=563}
[2024-03-12 00:31:10,998 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 70 predicate places.
[2024-03-12 00:31:10,998 INFO  L495      AbstractCegarLoop]: Abstraction has has 309 places, 563 transitions, 3716 flow
[2024-03-12 00:31:10,998 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 207.0) internal successors, (1242), 6 states have internal predecessors, (1242), 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)
[2024-03-12 00:31:10,998 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:31:10,998 INFO  L208   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, 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, 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]
[2024-03-12 00:31:10,998 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39
[2024-03-12 00:31:10,999 INFO  L420      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-12 00:31:10,999 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:31:10,999 INFO  L85        PathProgramCache]: Analyzing trace with hash -699392585, now seen corresponding path program 1 times
[2024-03-12 00:31:10,999 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:31:10,999 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815545187]
[2024-03-12 00:31:10,999 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:31:11,000 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:31:11,017 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:31:11,401 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-12 00:31:11,401 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:31:11,401 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815545187]
[2024-03-12 00:31:11,402 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815545187] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:31:11,402 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:31:11,402 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2024-03-12 00:31:11,402 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755671293]
[2024-03-12 00:31:11,402 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:31:11,403 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-03-12 00:31:11,403 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:31:11,403 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-03-12 00:31:11,403 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110
[2024-03-12 00:31:12,090 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 193 out of 249
[2024-03-12 00:31:12,091 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 563 transitions, 3716 flow. Second operand  has 11 states, 11 states have (on average 195.27272727272728) internal successors, (2148), 11 states have internal predecessors, (2148), 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)
[2024-03-12 00:31:12,091 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:31:12,091 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 249
[2024-03-12 00:31:12,091 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:31:19,302 INFO  L124   PetriNetUnfolderBase]: 14378/45714 cut-off events.
[2024-03-12 00:31:19,302 INFO  L125   PetriNetUnfolderBase]: For 65583/69598 co-relation queries the response was YES.
[2024-03-12 00:31:19,783 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 123294 conditions, 45714 events. 14378/45714 cut-off events. For 65583/69598 co-relation queries the response was YES. Maximal size of possible extension queue 978. Compared 563566 event pairs, 4524 based on Foata normal form. 584/42785 useless extension candidates. Maximal degree in co-relation 119905. Up to 15306 conditions per place. 
[2024-03-12 00:31:19,952 INFO  L140   encePairwiseOnDemand]: 236/249 looper letters, 406 selfloop transitions, 11 changer transitions 0/660 dead transitions.
[2024-03-12 00:31:19,953 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 660 transitions, 5371 flow
[2024-03-12 00:31:19,954 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-03-12 00:31:19,954 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-03-12 00:31:19,955 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2215 transitions.
[2024-03-12 00:31:19,956 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8086893026652063
[2024-03-12 00:31:19,956 INFO  L72            ComplementDD]: Start complementDD. Operand 11 states and 2215 transitions.
[2024-03-12 00:31:19,956 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 11 states and 2215 transitions.
[2024-03-12 00:31:19,956 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:31:19,956 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2215 transitions.
[2024-03-12 00:31:19,958 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 12 states, 11 states have (on average 201.36363636363637) internal successors, (2215), 11 states have internal predecessors, (2215), 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)
[2024-03-12 00:31:19,960 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 12 states, 12 states have (on average 249.0) internal successors, (2988), 12 states have internal predecessors, (2988), 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)
[2024-03-12 00:31:19,960 INFO  L81            ComplementDD]: Finished complementDD. Result  has 12 states, 12 states have (on average 249.0) internal successors, (2988), 12 states have internal predecessors, (2988), 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)
[2024-03-12 00:31:19,961 INFO  L175             Difference]: Start difference. First operand has 309 places, 563 transitions, 3716 flow. Second operand 11 states and 2215 transitions.
[2024-03-12 00:31:19,961 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 660 transitions, 5371 flow
[2024-03-12 00:31:20,627 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 660 transitions, 5299 flow, removed 36 selfloop flow, removed 0 redundant places.
[2024-03-12 00:31:20,633 INFO  L231             Difference]: Finished difference. Result has 320 places, 564 transitions, 3702 flow
[2024-03-12 00:31:20,634 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=3632, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=560, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=549, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3702, PETRI_PLACES=320, PETRI_TRANSITIONS=564}
[2024-03-12 00:31:20,634 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 81 predicate places.
[2024-03-12 00:31:20,634 INFO  L495      AbstractCegarLoop]: Abstraction has has 320 places, 564 transitions, 3702 flow
[2024-03-12 00:31:20,635 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 195.27272727272728) internal successors, (2148), 11 states have internal predecessors, (2148), 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)
[2024-03-12 00:31:20,635 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:31:20,635 INFO  L208   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, 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, 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]
[2024-03-12 00:31:20,635 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40
[2024-03-12 00:31:20,635 INFO  L420      AbstractCegarLoop]: === Iteration 21 === Targeting threadErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-12 00:31:20,636 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:31:20,636 INFO  L85        PathProgramCache]: Analyzing trace with hash 198684139, now seen corresponding path program 1 times
[2024-03-12 00:31:20,636 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:31:20,636 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318655166]
[2024-03-12 00:31:20,636 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:31:20,636 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:31:20,663 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:31:21,018 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:31:21,018 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:31:21,019 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318655166]
[2024-03-12 00:31:21,019 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318655166] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:31:21,019 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:31:21,019 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2024-03-12 00:31:21,019 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322819786]
[2024-03-12 00:31:21,019 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:31:21,020 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2024-03-12 00:31:21,020 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:31:21,020 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2024-03-12 00:31:21,020 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132
[2024-03-12 00:31:21,545 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 188 out of 249
[2024-03-12 00:31:21,547 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 564 transitions, 3702 flow. Second operand  has 12 states, 12 states have (on average 190.41666666666666) internal successors, (2285), 12 states have internal predecessors, (2285), 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)
[2024-03-12 00:31:21,547 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:31:21,547 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 249
[2024-03-12 00:31:21,547 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:31:32,689 INFO  L124   PetriNetUnfolderBase]: 19790/54292 cut-off events.
[2024-03-12 00:31:32,689 INFO  L125   PetriNetUnfolderBase]: For 77043/106722 co-relation queries the response was YES.
[2024-03-12 00:31:33,072 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 158527 conditions, 54292 events. 19790/54292 cut-off events. For 77043/106722 co-relation queries the response was YES. Maximal size of possible extension queue 1219. Compared 634878 event pairs, 5170 based on Foata normal form. 1543/52272 useless extension candidates. Maximal degree in co-relation 154095. Up to 14735 conditions per place. 
[2024-03-12 00:31:33,238 INFO  L140   encePairwiseOnDemand]: 223/249 looper letters, 529 selfloop transitions, 329 changer transitions 0/1066 dead transitions.
[2024-03-12 00:31:33,238 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 1066 transitions, 9033 flow
[2024-03-12 00:31:33,239 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. 
[2024-03-12 00:31:33,239 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 21 states.
[2024-03-12 00:31:33,241 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 4281 transitions.
[2024-03-12 00:31:33,242 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8187033849684452
[2024-03-12 00:31:33,242 INFO  L72            ComplementDD]: Start complementDD. Operand 21 states and 4281 transitions.
[2024-03-12 00:31:33,242 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 21 states and 4281 transitions.
[2024-03-12 00:31:33,243 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:31:33,243 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 4281 transitions.
[2024-03-12 00:31:33,246 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 22 states, 21 states have (on average 203.85714285714286) internal successors, (4281), 21 states have internal predecessors, (4281), 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)
[2024-03-12 00:31:33,250 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 22 states, 22 states have (on average 249.0) internal successors, (5478), 22 states have internal predecessors, (5478), 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)
[2024-03-12 00:31:33,250 INFO  L81            ComplementDD]: Finished complementDD. Result  has 22 states, 22 states have (on average 249.0) internal successors, (5478), 22 states have internal predecessors, (5478), 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)
[2024-03-12 00:31:33,250 INFO  L175             Difference]: Start difference. First operand has 320 places, 564 transitions, 3702 flow. Second operand 21 states and 4281 transitions.
[2024-03-12 00:31:33,250 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 340 places, 1066 transitions, 9033 flow
[2024-03-12 00:31:33,830 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 334 places, 1066 transitions, 8987 flow, removed 4 selfloop flow, removed 6 redundant places.
[2024-03-12 00:31:33,839 INFO  L231             Difference]: Finished difference. Result has 348 places, 785 transitions, 6775 flow
[2024-03-12 00:31:33,839 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=3680, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=564, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=140, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=6775, PETRI_PLACES=348, PETRI_TRANSITIONS=785}
[2024-03-12 00:31:33,840 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 109 predicate places.
[2024-03-12 00:31:33,840 INFO  L495      AbstractCegarLoop]: Abstraction has has 348 places, 785 transitions, 6775 flow
[2024-03-12 00:31:33,840 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 12 states have (on average 190.41666666666666) internal successors, (2285), 12 states have internal predecessors, (2285), 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)
[2024-03-12 00:31:33,841 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:31:33,841 INFO  L208   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, 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, 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, 1]
[2024-03-12 00:31:33,841 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41
[2024-03-12 00:31:33,841 INFO  L420      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-12 00:31:33,841 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:31:33,841 INFO  L85        PathProgramCache]: Analyzing trace with hash 446813364, now seen corresponding path program 1 times
[2024-03-12 00:31:33,842 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:31:33,842 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516553202]
[2024-03-12 00:31:33,842 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:31:33,842 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:31:33,860 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:31:34,384 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:31:34,384 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:31:34,384 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516553202]
[2024-03-12 00:31:34,384 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516553202] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 00:31:34,384 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [691137790]
[2024-03-12 00:31:34,385 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:31:34,385 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 00:31:34,385 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 00:31:34,386 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-12 00:31:34,389 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2024-03-12 00:31:34,573 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:31:34,575 INFO  L262         TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 31 conjunts are in the unsatisfiable core
[2024-03-12 00:31:34,581 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 00:31:34,607 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-03-12 00:31:34,632 INFO  L349             Elim1Store]: treesize reduction 18, result has 35.7 percent of original size
[2024-03-12 00:31:34,632 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 21
[2024-03-12 00:31:34,708 INFO  L349             Elim1Store]: treesize reduction 8, result has 61.9 percent of original size
[2024-03-12 00:31:34,708 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22
[2024-03-12 00:31:35,011 INFO  L349             Elim1Store]: treesize reduction 19, result has 20.8 percent of original size
[2024-03-12 00:31:35,012 INFO  L378             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 33 treesize of output 32
[2024-03-12 00:31:35,094 INFO  L378             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 24 treesize of output 12
[2024-03-12 00:31:35,147 INFO  L378             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
[2024-03-12 00:31:35,156 INFO  L378             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
[2024-03-12 00:31:35,174 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 00:31:35,174 INFO  L378             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
[2024-03-12 00:31:35,194 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 00:31:35,194 INFO  L378             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
[2024-03-12 00:31:35,213 INFO  L378             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 56 treesize of output 45
[2024-03-12 00:31:35,223 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-12 00:31:35,223 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-03-12 00:31:35,223 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [691137790] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:31:35,223 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-03-12 00:31:35,223 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [15] total 20
[2024-03-12 00:31:35,224 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421059627]
[2024-03-12 00:31:35,224 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:31:35,224 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2024-03-12 00:31:35,224 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:31:35,225 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2024-03-12 00:31:35,225 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420
[2024-03-12 00:31:36,318 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 197 out of 249
[2024-03-12 00:31:36,321 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 348 places, 785 transitions, 6775 flow. Second operand  has 14 states, 14 states have (on average 198.85714285714286) internal successors, (2784), 14 states have internal predecessors, (2784), 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)
[2024-03-12 00:31:36,321 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:31:36,321 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 249
[2024-03-12 00:31:36,321 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:31:45,988 INFO  L124   PetriNetUnfolderBase]: 15375/44310 cut-off events.
[2024-03-12 00:31:45,988 INFO  L125   PetriNetUnfolderBase]: For 154665/156992 co-relation queries the response was YES.
[2024-03-12 00:31:46,402 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 158395 conditions, 44310 events. 15375/44310 cut-off events. For 154665/156992 co-relation queries the response was YES. Maximal size of possible extension queue 1109. Compared 513305 event pairs, 2178 based on Foata normal form. 253/41981 useless extension candidates. Maximal degree in co-relation 156446. Up to 10713 conditions per place. 
[2024-03-12 00:31:46,586 INFO  L140   encePairwiseOnDemand]: 231/249 looper letters, 824 selfloop transitions, 57 changer transitions 0/1238 dead transitions.
[2024-03-12 00:31:46,586 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 1238 transitions, 13767 flow
[2024-03-12 00:31:46,587 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2024-03-12 00:31:46,587 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 16 states.
[2024-03-12 00:31:46,593 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 3312 transitions.
[2024-03-12 00:31:46,595 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8313253012048193
[2024-03-12 00:31:46,596 INFO  L72            ComplementDD]: Start complementDD. Operand 16 states and 3312 transitions.
[2024-03-12 00:31:46,596 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 16 states and 3312 transitions.
[2024-03-12 00:31:46,597 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:31:46,597 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 3312 transitions.
[2024-03-12 00:31:46,603 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 17 states, 16 states have (on average 207.0) internal successors, (3312), 16 states have internal predecessors, (3312), 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)
[2024-03-12 00:31:46,606 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 17 states, 17 states have (on average 249.0) internal successors, (4233), 17 states have internal predecessors, (4233), 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)
[2024-03-12 00:31:46,607 INFO  L81            ComplementDD]: Finished complementDD. Result  has 17 states, 17 states have (on average 249.0) internal successors, (4233), 17 states have internal predecessors, (4233), 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)
[2024-03-12 00:31:46,607 INFO  L175             Difference]: Start difference. First operand has 348 places, 785 transitions, 6775 flow. Second operand 16 states and 3312 transitions.
[2024-03-12 00:31:46,607 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 362 places, 1238 transitions, 13767 flow
[2024-03-12 00:31:48,801 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 1238 transitions, 13653 flow, removed 52 selfloop flow, removed 4 redundant places.
[2024-03-12 00:31:48,812 INFO  L231             Difference]: Finished difference. Result has 358 places, 784 transitions, 6779 flow
[2024-03-12 00:31:48,812 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=6665, PETRI_DIFFERENCE_MINUEND_PLACES=343, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=784, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=727, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=6779, PETRI_PLACES=358, PETRI_TRANSITIONS=784}
[2024-03-12 00:31:48,814 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 119 predicate places.
[2024-03-12 00:31:48,814 INFO  L495      AbstractCegarLoop]: Abstraction has has 358 places, 784 transitions, 6779 flow
[2024-03-12 00:31:48,815 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 14 states, 14 states have (on average 198.85714285714286) internal successors, (2784), 14 states have internal predecessors, (2784), 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)
[2024-03-12 00:31:48,815 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:31:48,815 INFO  L208   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, 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, 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, 1]
[2024-03-12 00:31:48,822 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2024-03-12 00:31:49,016 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42
[2024-03-12 00:31:49,017 INFO  L420      AbstractCegarLoop]: === Iteration 23 === Targeting threadErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-12 00:31:49,017 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:31:49,018 INFO  L85        PathProgramCache]: Analyzing trace with hash 667056556, now seen corresponding path program 1 times
[2024-03-12 00:31:49,018 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:31:49,018 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860780473]
[2024-03-12 00:31:49,019 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:31:49,019 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:31:49,060 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:31:49,660 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:31:49,660 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:31:49,660 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860780473]
[2024-03-12 00:31:49,661 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860780473] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 00:31:49,661 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17804406]
[2024-03-12 00:31:49,661 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:31:49,661 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 00:31:49,661 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 00:31:49,662 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-12 00:31:49,664 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2024-03-12 00:31:49,846 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:31:49,848 INFO  L262         TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 45 conjunts are in the unsatisfiable core
[2024-03-12 00:31:49,855 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 00:31:49,885 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-03-12 00:31:49,962 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-03-12 00:31:49,963 INFO  L378             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 15 treesize of output 15
[2024-03-12 00:31:50,506 INFO  L349             Elim1Store]: treesize reduction 19, result has 20.8 percent of original size
[2024-03-12 00:31:50,506 INFO  L378             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 34 treesize of output 33
[2024-03-12 00:31:51,029 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:31:51,031 INFO  L378             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 26 treesize of output 19
[2024-03-12 00:31:51,061 INFO  L378             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
[2024-03-12 00:31:51,128 INFO  L378             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 11 treesize of output 7
[2024-03-12 00:31:51,165 INFO  L378             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 19 treesize of output 18
[2024-03-12 00:31:51,217 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28
[2024-03-12 00:31:51,279 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38
[2024-03-12 00:31:51,353 INFO  L378             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 37 treesize of output 26
[2024-03-12 00:31:51,410 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:31:51,411 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-12 00:31:51,444 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse0 (* c_threadThread1of2ForFork0_~j~0 4))) (and (forall ((v_ArrVal_1327 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem25#1.base| v_ArrVal_1327) c_~datas~0.base) (+ c_~datas~0.offset 3 .cse0)) |c_threadThread1of2ForFork0_#t~nondet9|)) (forall ((v_ArrVal_1327 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem25#1.base| v_ArrVal_1327) c_~datas~0.base) (+ c_~datas~0.offset .cse0 1)) |c_threadThread1of2ForFork0_#t~nondet9|)) (forall ((v_ArrVal_1327 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem25#1.base| v_ArrVal_1327) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse0)) |c_threadThread1of2ForFork0_#t~nondet9|)) (forall ((v_ArrVal_1327 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem25#1.base| v_ArrVal_1327) c_~datas~0.base) (+ c_~datas~0.offset .cse0)) |c_threadThread1of2ForFork0_#t~nondet9|)))) is different from false
[2024-03-12 00:31:51,475 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (* c_threadThread1of2ForFork0_~j~0 4))) (let ((.cse2 (+ c_~datas~0.offset 3 .cse1))) (let ((.cse0 (store |c_#race| c_~datas~0.base (store (select |c_#race| c_~datas~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet9|)))) (and (forall ((v_ArrVal_1327 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem25#1.base| v_ArrVal_1327) c_~datas~0.base) (+ c_~datas~0.offset .cse1 1)) |c_threadThread1of2ForFork0_#t~nondet9|)) (forall ((v_ArrVal_1327 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem25#1.base| v_ArrVal_1327) c_~datas~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet9|)) (forall ((v_ArrVal_1327 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem25#1.base| v_ArrVal_1327) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse1)) |c_threadThread1of2ForFork0_#t~nondet9|)) (forall ((v_ArrVal_1327 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem25#1.base| v_ArrVal_1327) c_~datas~0.base) (+ c_~datas~0.offset .cse1)) |c_threadThread1of2ForFork0_#t~nondet9|)))))) is different from false
[2024-03-12 00:31:51,491 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (* c_threadThread1of2ForFork0_~j~0 4))) (let ((.cse3 (+ c_~datas~0.offset 2 .cse1)) (.cse2 (+ c_~datas~0.offset 3 .cse1))) (let ((.cse0 (store |c_#race| c_~datas~0.base (store (store (select |c_#race| c_~datas~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet9|) .cse2 |c_threadThread1of2ForFork0_#t~nondet9|)))) (and (forall ((v_ArrVal_1327 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem25#1.base| v_ArrVal_1327) c_~datas~0.base) (+ c_~datas~0.offset .cse1 1)) |c_threadThread1of2ForFork0_#t~nondet9|)) (forall ((v_ArrVal_1327 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem25#1.base| v_ArrVal_1327) c_~datas~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet9|)) (forall ((v_ArrVal_1327 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem25#1.base| v_ArrVal_1327) c_~datas~0.base) .cse3) |c_threadThread1of2ForFork0_#t~nondet9|)) (forall ((v_ArrVal_1327 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem25#1.base| v_ArrVal_1327) c_~datas~0.base) (+ c_~datas~0.offset .cse1)) |c_threadThread1of2ForFork0_#t~nondet9|)))))) is different from false
[2024-03-12 00:31:51,570 WARN  L854   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1320 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_~datas~0.base v_ArrVal_1320) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) c_~datas~0.base))) is different from false
[2024-03-12 00:31:51,744 WARN  L854   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1320 (Array Int Int)) (v_ArrVal_1319 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1319) c_~datas~0.base v_ArrVal_1320) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) c_~datas~0.base))) is different from false
[2024-03-12 00:31:51,852 WARN  L854   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1320 (Array Int Int)) (v_ArrVal_1319 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1319) |c_ULTIMATE.start_main_#t~malloc12#1.base| v_ArrVal_1320) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |c_ULTIMATE.start_main_#t~malloc12#1.base|))) is different from false
[2024-03-12 00:31:51,925 INFO  L378             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 163 treesize of output 119
[2024-03-12 00:31:51,931 INFO  L378             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 52 treesize of output 48
[2024-03-12 00:31:51,934 INFO  L378             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 48 treesize of output 46
[2024-03-12 00:31:52,042 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 00:31:52,042 INFO  L378             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 35 treesize of output 40
[2024-03-12 00:31:52,091 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2024-03-12 00:31:52,091 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [17804406] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-12 00:31:52,092 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-12 00:31:52,092 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 42
[2024-03-12 00:31:52,092 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727970663]
[2024-03-12 00:31:52,092 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-12 00:31:52,093 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 43 states
[2024-03-12 00:31:52,093 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:31:52,093 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants.
[2024-03-12 00:31:52,094 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1158, Unknown=16, NotChecked=450, Total=1806
[2024-03-12 00:31:52,247 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 150 out of 249
[2024-03-12 00:31:52,250 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 784 transitions, 6779 flow. Second operand  has 43 states, 43 states have (on average 153.46511627906978) internal successors, (6599), 43 states have internal predecessors, (6599), 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)
[2024-03-12 00:31:52,250 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:31:52,250 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 249
[2024-03-12 00:31:52,250 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:32:45,129 INFO  L124   PetriNetUnfolderBase]: 96636/203678 cut-off events.
[2024-03-12 00:32:45,129 INFO  L125   PetriNetUnfolderBase]: For 664046/664572 co-relation queries the response was YES.
[2024-03-12 00:32:47,494 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 754846 conditions, 203678 events. 96636/203678 cut-off events. For 664046/664572 co-relation queries the response was YES. Maximal size of possible extension queue 4136. Compared 2417795 event pairs, 19952 based on Foata normal form. 1065/192463 useless extension candidates. Maximal degree in co-relation 743280. Up to 37239 conditions per place. 
[2024-03-12 00:32:48,285 INFO  L140   encePairwiseOnDemand]: 217/249 looper letters, 2451 selfloop transitions, 1018 changer transitions 40/3676 dead transitions.
[2024-03-12 00:32:48,285 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 404 places, 3676 transitions, 42055 flow
[2024-03-12 00:32:48,286 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. 
[2024-03-12 00:32:48,286 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 47 states.
[2024-03-12 00:32:48,289 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 7970 transitions.
[2024-03-12 00:32:48,291 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.6810219601811501
[2024-03-12 00:32:48,292 INFO  L72            ComplementDD]: Start complementDD. Operand 47 states and 7970 transitions.
[2024-03-12 00:32:48,292 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 47 states and 7970 transitions.
[2024-03-12 00:32:48,293 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:32:48,293 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 47 states and 7970 transitions.
[2024-03-12 00:32:48,298 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 48 states, 47 states have (on average 169.5744680851064) internal successors, (7970), 47 states have internal predecessors, (7970), 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)
[2024-03-12 00:32:48,304 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 48 states, 48 states have (on average 249.0) internal successors, (11952), 48 states have internal predecessors, (11952), 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)
[2024-03-12 00:32:48,305 INFO  L81            ComplementDD]: Finished complementDD. Result  has 48 states, 48 states have (on average 249.0) internal successors, (11952), 48 states have internal predecessors, (11952), 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)
[2024-03-12 00:32:48,305 INFO  L175             Difference]: Start difference. First operand has 358 places, 784 transitions, 6779 flow. Second operand 47 states and 7970 transitions.
[2024-03-12 00:32:48,305 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 404 places, 3676 transitions, 42055 flow
[2024-03-12 00:33:20,518 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 388 places, 3676 transitions, 41579 flow, removed 0 selfloop flow, removed 16 redundant places.
[2024-03-12 00:33:20,546 INFO  L231             Difference]: Finished difference. Result has 407 places, 1748 transitions, 21903 flow
[2024-03-12 00:33:20,547 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=6631, PETRI_DIFFERENCE_MINUEND_PLACES=342, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=783, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=156, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=467, PETRI_DIFFERENCE_SUBTRAHEND_STATES=47, PETRI_FLOW=21903, PETRI_PLACES=407, PETRI_TRANSITIONS=1748}
[2024-03-12 00:33:20,547 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 168 predicate places.
[2024-03-12 00:33:20,547 INFO  L495      AbstractCegarLoop]: Abstraction has has 407 places, 1748 transitions, 21903 flow
[2024-03-12 00:33:20,548 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 43 states, 43 states have (on average 153.46511627906978) internal successors, (6599), 43 states have internal predecessors, (6599), 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)
[2024-03-12 00:33:20,548 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:33:20,548 INFO  L208   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, 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, 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, 1]
[2024-03-12 00:33:20,554 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2024-03-12 00:33:20,749 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,4 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 00:33:20,750 INFO  L420      AbstractCegarLoop]: === Iteration 24 === Targeting threadErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-12 00:33:20,750 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:33:20,750 INFO  L85        PathProgramCache]: Analyzing trace with hash -1775215122, now seen corresponding path program 1 times
[2024-03-12 00:33:20,751 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:33:20,751 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250311554]
[2024-03-12 00:33:20,751 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:33:20,751 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:33:20,779 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:33:20,898 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:33:20,898 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:33:20,898 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250311554]
[2024-03-12 00:33:20,898 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250311554] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:33:20,898 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:33:20,898 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-03-12 00:33:20,899 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423936737]
[2024-03-12 00:33:20,899 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:33:20,899 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-12 00:33:20,899 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:33:20,900 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-12 00:33:20,900 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-03-12 00:33:20,951 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 225 out of 249
[2024-03-12 00:33:20,952 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 407 places, 1748 transitions, 21903 flow. Second operand  has 6 states, 6 states have (on average 227.0) internal successors, (1362), 6 states have internal predecessors, (1362), 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)
[2024-03-12 00:33:20,952 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:33:20,952 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 249
[2024-03-12 00:33:20,953 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:33:50,746 INFO  L124   PetriNetUnfolderBase]: 37965/116761 cut-off events.
[2024-03-12 00:33:50,747 INFO  L125   PetriNetUnfolderBase]: For 805306/1228320 co-relation queries the response was YES.
[2024-03-12 00:33:52,309 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 497650 conditions, 116761 events. 37965/116761 cut-off events. For 805306/1228320 co-relation queries the response was YES. Maximal size of possible extension queue 2908. Compared 1604426 event pairs, 3429 based on Foata normal form. 839/111499 useless extension candidates. Maximal degree in co-relation 482817. Up to 31553 conditions per place. 
[2024-03-12 00:33:52,932 INFO  L140   encePairwiseOnDemand]: 241/249 looper letters, 109 selfloop transitions, 29 changer transitions 0/1856 dead transitions.
[2024-03-12 00:33:52,932 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 416 places, 1856 transitions, 22537 flow
[2024-03-12 00:33:52,933 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-03-12 00:33:52,933 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-03-12 00:33:52,934 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2597 transitions.
[2024-03-12 00:33:52,935 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9481562614092734
[2024-03-12 00:33:52,935 INFO  L72            ComplementDD]: Start complementDD. Operand 11 states and 2597 transitions.
[2024-03-12 00:33:52,935 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 11 states and 2597 transitions.
[2024-03-12 00:33:52,936 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:33:52,936 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2597 transitions.
[2024-03-12 00:33:52,938 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 12 states, 11 states have (on average 236.0909090909091) internal successors, (2597), 11 states have internal predecessors, (2597), 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)
[2024-03-12 00:33:52,939 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 12 states, 12 states have (on average 249.0) internal successors, (2988), 12 states have internal predecessors, (2988), 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)
[2024-03-12 00:33:52,939 INFO  L81            ComplementDD]: Finished complementDD. Result  has 12 states, 12 states have (on average 249.0) internal successors, (2988), 12 states have internal predecessors, (2988), 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)
[2024-03-12 00:33:52,939 INFO  L175             Difference]: Start difference. First operand has 407 places, 1748 transitions, 21903 flow. Second operand 11 states and 2597 transitions.
[2024-03-12 00:33:52,939 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 416 places, 1856 transitions, 22537 flow
[2024-03-12 00:34:27,956 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 406 places, 1856 transitions, 22275 flow, removed 116 selfloop flow, removed 10 redundant places.
[2024-03-12 00:34:27,976 INFO  L231             Difference]: Finished difference. Result has 415 places, 1774 transitions, 21863 flow
[2024-03-12 00:34:27,977 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=21626, PETRI_DIFFERENCE_MINUEND_PLACES=396, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1746, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1733, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=21863, PETRI_PLACES=415, PETRI_TRANSITIONS=1774}
[2024-03-12 00:34:27,977 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 176 predicate places.
[2024-03-12 00:34:27,978 INFO  L495      AbstractCegarLoop]: Abstraction has has 415 places, 1774 transitions, 21863 flow
[2024-03-12 00:34:27,978 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 227.0) internal successors, (1362), 6 states have internal predecessors, (1362), 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)
[2024-03-12 00:34:27,978 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:34:27,978 INFO  L208   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, 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, 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, 1]
[2024-03-12 00:34:27,978 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44
[2024-03-12 00:34:27,978 INFO  L420      AbstractCegarLoop]: === Iteration 25 === Targeting threadErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-12 00:34:27,979 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:34:27,979 INFO  L85        PathProgramCache]: Analyzing trace with hash -1866117182, now seen corresponding path program 2 times
[2024-03-12 00:34:27,979 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:34:27,979 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073778474]
[2024-03-12 00:34:27,979 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:34:27,980 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:34:28,000 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:34:28,731 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:34:28,731 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:34:28,731 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073778474]
[2024-03-12 00:34:28,731 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073778474] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 00:34:28,731 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [794072031]
[2024-03-12 00:34:28,732 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-03-12 00:34:28,732 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 00:34:28,732 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 00:34:28,733 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-12 00:34:28,734 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2024-03-12 00:34:28,968 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-03-12 00:34:28,968 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-12 00:34:28,970 INFO  L262         TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 48 conjunts are in the unsatisfiable core
[2024-03-12 00:34:28,977 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 00:34:29,007 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-03-12 00:34:29,097 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-03-12 00:34:29,098 INFO  L378             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 15 treesize of output 15
[2024-03-12 00:34:29,640 INFO  L349             Elim1Store]: treesize reduction 17, result has 22.7 percent of original size
[2024-03-12 00:34:29,640 INFO  L378             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 33 treesize of output 24
[2024-03-12 00:34:30,017 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:34:30,018 INFO  L378             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 26 treesize of output 19
[2024-03-12 00:34:30,046 INFO  L378             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 11 treesize of output 7
[2024-03-12 00:34:30,100 INFO  L378             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 19 treesize of output 18
[2024-03-12 00:34:30,169 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28
[2024-03-12 00:34:30,394 INFO  L378             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
[2024-03-12 00:34:30,436 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:34:30,437 INFO  L378             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 21
[2024-03-12 00:34:30,474 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38
[2024-03-12 00:34:30,551 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:34:30,553 INFO  L378             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 37 treesize of output 26
[2024-03-12 00:34:30,570 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:34:30,571 INFO  L378             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 37 treesize of output 26
[2024-03-12 00:34:30,598 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:34:30,599 INFO  L378             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 37 treesize of output 26
[2024-03-12 00:34:30,669 INFO  L378             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 37 treesize of output 26
[2024-03-12 00:34:30,707 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:34:30,707 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-03-12 00:34:30,707 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [794072031] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:34:30,707 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-03-12 00:34:30,707 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [16] total 32
[2024-03-12 00:34:30,708 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039579698]
[2024-03-12 00:34:30,708 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:34:30,708 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 18 states
[2024-03-12 00:34:30,708 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:34:30,709 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants.
[2024-03-12 00:34:30,709 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=906, Unknown=0, NotChecked=0, Total=1056
[2024-03-12 00:34:31,905 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 177 out of 249
[2024-03-12 00:34:31,908 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 415 places, 1774 transitions, 21863 flow. Second operand  has 18 states, 18 states have (on average 179.27777777777777) internal successors, (3227), 18 states have internal predecessors, (3227), 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)
[2024-03-12 00:34:31,908 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:34:31,908 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 249
[2024-03-12 00:34:31,908 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:35:59,765 INFO  L124   PetriNetUnfolderBase]: 98357/262211 cut-off events.
[2024-03-12 00:35:59,765 INFO  L125   PetriNetUnfolderBase]: For 1383999/1386068 co-relation queries the response was YES.
[2024-03-12 00:36:03,670 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1080755 conditions, 262211 events. 98357/262211 cut-off events. For 1383999/1386068 co-relation queries the response was YES. Maximal size of possible extension queue 5541. Compared 3773413 event pairs, 17044 based on Foata normal form. 957/249402 useless extension candidates. Maximal degree in co-relation 1079006. Up to 51871 conditions per place. 
[2024-03-12 00:36:04,815 INFO  L140   encePairwiseOnDemand]: 215/249 looper letters, 2157 selfloop transitions, 1235 changer transitions 50/3656 dead transitions.
[2024-03-12 00:36:04,815 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 450 places, 3656 transitions, 53021 flow
[2024-03-12 00:36:04,816 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. 
[2024-03-12 00:36:04,816 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 36 states.
[2024-03-12 00:36:04,819 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 7022 transitions.
[2024-03-12 00:36:04,820 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.7833556448014279
[2024-03-12 00:36:04,821 INFO  L72            ComplementDD]: Start complementDD. Operand 36 states and 7022 transitions.
[2024-03-12 00:36:04,821 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 36 states and 7022 transitions.
[2024-03-12 00:36:04,821 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:36:04,822 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 36 states and 7022 transitions.
[2024-03-12 00:36:04,826 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 37 states, 36 states have (on average 195.05555555555554) internal successors, (7022), 36 states have internal predecessors, (7022), 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)
[2024-03-12 00:36:04,830 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 37 states, 37 states have (on average 249.0) internal successors, (9213), 37 states have internal predecessors, (9213), 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)
[2024-03-12 00:36:04,831 INFO  L81            ComplementDD]: Finished complementDD. Result  has 37 states, 37 states have (on average 249.0) internal successors, (9213), 37 states have internal predecessors, (9213), 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)
[2024-03-12 00:36:04,831 INFO  L175             Difference]: Start difference. First operand has 415 places, 1774 transitions, 21863 flow. Second operand 36 states and 7022 transitions.
[2024-03-12 00:36:04,831 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 450 places, 3656 transitions, 53021 flow
[2024-03-12 00:37:40,942 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 448 places, 3656 transitions, 52976 flow, removed 2 selfloop flow, removed 2 redundant places.
[2024-03-12 00:37:40,981 INFO  L231             Difference]: Finished difference. Result has 469 places, 2654 transitions, 41952 flow
[2024-03-12 00:37:40,982 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=21826, PETRI_DIFFERENCE_MINUEND_PLACES=413, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1774, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=530, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1066, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=41952, PETRI_PLACES=469, PETRI_TRANSITIONS=2654}
[2024-03-12 00:37:40,983 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 230 predicate places.
[2024-03-12 00:37:40,983 INFO  L495      AbstractCegarLoop]: Abstraction has has 469 places, 2654 transitions, 41952 flow
[2024-03-12 00:37:40,984 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 18 states, 18 states have (on average 179.27777777777777) internal successors, (3227), 18 states have internal predecessors, (3227), 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)
[2024-03-12 00:37:40,984 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:37:40,984 INFO  L208   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, 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, 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, 1]
[2024-03-12 00:37:40,992 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2024-03-12 00:37:41,184 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45
[2024-03-12 00:37:41,185 INFO  L420      AbstractCegarLoop]: === Iteration 26 === Targeting threadErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-12 00:37:41,186 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:37:41,186 INFO  L85        PathProgramCache]: Analyzing trace with hash -905546248, now seen corresponding path program 1 times
[2024-03-12 00:37:41,187 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:37:41,187 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692882210]
[2024-03-12 00:37:41,187 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:37:41,188 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:37:41,211 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:37:41,923 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:37:41,923 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:37:41,923 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692882210]
[2024-03-12 00:37:41,923 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692882210] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 00:37:41,923 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1701480952]
[2024-03-12 00:37:41,924 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:37:41,924 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 00:37:41,924 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 00:37:41,925 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-12 00:37:41,926 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2024-03-12 00:37:42,110 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:37:42,112 INFO  L262         TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 36 conjunts are in the unsatisfiable core
[2024-03-12 00:37:42,119 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 00:37:42,148 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-03-12 00:37:42,225 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-03-12 00:37:42,225 INFO  L378             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 15 treesize of output 15
[2024-03-12 00:37:42,580 INFO  L349             Elim1Store]: treesize reduction 19, result has 20.8 percent of original size
[2024-03-12 00:37:42,581 INFO  L378             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 34 treesize of output 33
[2024-03-12 00:37:42,778 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:37:42,779 INFO  L378             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 26 treesize of output 19
[2024-03-12 00:37:42,801 INFO  L378             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
[2024-03-12 00:37:42,846 INFO  L378             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
[2024-03-12 00:37:42,905 INFO  L378             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
[2024-03-12 00:37:42,963 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 00:37:42,963 INFO  L378             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
[2024-03-12 00:37:43,031 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:37:43,032 INFO  L378             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 44 treesize of output 35
[2024-03-12 00:37:43,058 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 00:37:43,058 INFO  L378             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
[2024-03-12 00:37:43,140 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:37:43,141 INFO  L378             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 56 treesize of output 45
[2024-03-12 00:37:43,177 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:37:43,178 INFO  L378             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 56 treesize of output 45
[2024-03-12 00:37:43,200 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:37:43,202 INFO  L378             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 56 treesize of output 45
[2024-03-12 00:37:43,255 INFO  L378             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 56 treesize of output 45
[2024-03-12 00:37:43,267 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-12 00:37:43,267 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-03-12 00:37:43,268 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1701480952] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:37:43,268 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-03-12 00:37:43,269 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [15] total 26
[2024-03-12 00:37:43,269 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469990009]
[2024-03-12 00:37:43,269 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:37:43,270 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2024-03-12 00:37:43,271 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:37:43,271 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2024-03-12 00:37:43,272 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702
[2024-03-12 00:37:44,837 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 186 out of 249
[2024-03-12 00:37:44,838 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 469 places, 2654 transitions, 41952 flow. Second operand  has 15 states, 15 states have (on average 188.33333333333334) internal successors, (2825), 15 states have internal predecessors, (2825), 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)
[2024-03-12 00:37:44,839 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:37:44,839 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 249
[2024-03-12 00:37:44,839 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:39:38,088 INFO  L124   PetriNetUnfolderBase]: 98023/250402 cut-off events.
[2024-03-12 00:39:38,088 INFO  L125   PetriNetUnfolderBase]: For 2298276/2315787 co-relation queries the response was YES.
[2024-03-12 00:39:42,885 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1254731 conditions, 250402 events. 98023/250402 cut-off events. For 2298276/2315787 co-relation queries the response was YES. Maximal size of possible extension queue 5696. Compared 3513253 event pairs, 14188 based on Foata normal form. 2741/239101 useless extension candidates. Maximal degree in co-relation 1238394. Up to 54339 conditions per place. 
[2024-03-12 00:39:44,099 INFO  L140   encePairwiseOnDemand]: 221/249 looper letters, 1891 selfloop transitions, 1941 changer transitions 38/4141 dead transitions.
[2024-03-12 00:39:44,099 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 490 places, 4141 transitions, 73602 flow
[2024-03-12 00:39:44,100 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. 
[2024-03-12 00:39:44,100 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 22 states.
[2024-03-12 00:39:44,101 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 4427 transitions.
[2024-03-12 00:39:44,102 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8081416575392479
[2024-03-12 00:39:44,102 INFO  L72            ComplementDD]: Start complementDD. Operand 22 states and 4427 transitions.
[2024-03-12 00:39:44,102 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 22 states and 4427 transitions.
[2024-03-12 00:39:44,103 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:39:44,103 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 4427 transitions.
[2024-03-12 00:39:44,106 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 23 states, 22 states have (on average 201.22727272727272) internal successors, (4427), 22 states have internal predecessors, (4427), 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)
[2024-03-12 00:39:44,108 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 23 states, 23 states have (on average 249.0) internal successors, (5727), 23 states have internal predecessors, (5727), 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)
[2024-03-12 00:39:44,108 INFO  L81            ComplementDD]: Finished complementDD. Result  has 23 states, 23 states have (on average 249.0) internal successors, (5727), 23 states have internal predecessors, (5727), 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)
[2024-03-12 00:39:44,108 INFO  L175             Difference]: Start difference. First operand has 469 places, 2654 transitions, 41952 flow. Second operand 22 states and 4427 transitions.
[2024-03-12 00:39:44,109 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 490 places, 4141 transitions, 73602 flow
Killed by 15
