./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/value-barrier-race.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/value-barrier-race.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 febce8fe21e57a71f45b97f04493cc99ca265159aa11706dfff68f6cab9b75f4
--- Real Ultimate output ---
This is Ultimate 0.2.4-dev-0e0057c
[2024-03-09 07:03:38,802 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-03-09 07:03:38,838 INFO  L114        SettingsManager]: Loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2024-03-09 07:03:38,841 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-03-09 07:03:38,841 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-03-09 07:03:38,862 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-03-09 07:03:38,863 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-03-09 07:03:38,863 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-03-09 07:03:38,864 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-03-09 07:03:38,864 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-03-09 07:03:38,865 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-03-09 07:03:38,866 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-03-09 07:03:38,866 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-03-09 07:03:38,867 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-03-09 07:03:38,867 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-03-09 07:03:38,867 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-03-09 07:03:38,868 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-03-09 07:03:38,868 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-03-09 07:03:38,868 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-03-09 07:03:38,868 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-03-09 07:03:38,869 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-03-09 07:03:38,869 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-03-09 07:03:38,869 INFO  L153        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2024-03-09 07:03:38,870 INFO  L153        SettingsManager]:  * Check unreachability of reach_error function=false
[2024-03-09 07:03:38,870 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-03-09 07:03:38,870 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-03-09 07:03:38,870 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-03-09 07:03:38,871 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-03-09 07:03:38,871 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-03-09 07:03:38,871 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-03-09 07:03:38,871 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-03-09 07:03:38,872 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-03-09 07:03:38,872 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-03-09 07:03:38,872 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-03-09 07:03:38,872 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-03-09 07:03:38,872 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-03-09 07:03:38,873 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-03-09 07:03:38,873 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-03-09 07:03:38,873 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-03-09 07:03:38,873 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-03-09 07:03:38,873 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-03-09 07:03:38,874 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 -> febce8fe21e57a71f45b97f04493cc99ca265159aa11706dfff68f6cab9b75f4
[2024-03-09 07:03:39,048 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-03-09 07:03:39,063 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-03-09 07:03:39,065 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-03-09 07:03:39,066 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-03-09 07:03:39,066 INFO  L274        PluginConnector]: CDTParser initialized
[2024-03-09 07:03:39,067 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/value-barrier-race.i
[2024-03-09 07:03:40,117 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-03-09 07:03:40,318 INFO  L384              CDTParser]: Found 1 translation units.
[2024-03-09 07:03:40,318 INFO  L180              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/value-barrier-race.i
[2024-03-09 07:03:40,336 INFO  L427              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data/51c9365b9/681a50111ba04ceebc27c0a36f20a80e/FLAG87c5fd75a
[2024-03-09 07:03:40,348 INFO  L435              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data/51c9365b9/681a50111ba04ceebc27c0a36f20a80e
[2024-03-09 07:03:40,350 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-03-09 07:03:40,351 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-03-09 07:03:40,351 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-03-09 07:03:40,352 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-03-09 07:03:40,355 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-03-09 07:03:40,356 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 07:03:40" (1/1) ...
[2024-03-09 07:03:40,357 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b6f7a9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:03:40, skipping insertion in model container
[2024-03-09 07:03:40,357 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 07:03:40" (1/1) ...
[2024-03-09 07:03:40,394 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-03-09 07:03:40,659 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2024-03-09 07:03:40,666 INFO  L202         MainTranslator]: Completed pre-run
[2024-03-09 07:03:40,700 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2024-03-09 07:03:40,734 INFO  L206         MainTranslator]: Completed translation
[2024-03-09 07:03:40,735 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:03:40 WrapperNode
[2024-03-09 07:03:40,735 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-03-09 07:03:40,736 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-03-09 07:03:40,736 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-03-09 07:03:40,736 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-03-09 07:03:40,741 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:03:40" (1/1) ...
[2024-03-09 07:03:40,754 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:03:40" (1/1) ...
[2024-03-09 07:03:40,777 INFO  L138                Inliner]: procedures = 265, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 91
[2024-03-09 07:03:40,778 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-03-09 07:03:40,778 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-03-09 07:03:40,778 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-03-09 07:03:40,778 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-03-09 07:03:40,786 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:03:40" (1/1) ...
[2024-03-09 07:03:40,786 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:03:40" (1/1) ...
[2024-03-09 07:03:40,789 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:03:40" (1/1) ...
[2024-03-09 07:03:40,789 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:03:40" (1/1) ...
[2024-03-09 07:03:40,817 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:03:40" (1/1) ...
[2024-03-09 07:03:40,821 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:03:40" (1/1) ...
[2024-03-09 07:03:40,824 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:03:40" (1/1) ...
[2024-03-09 07:03:40,826 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:03:40" (1/1) ...
[2024-03-09 07:03:40,829 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-03-09 07:03:40,829 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-03-09 07:03:40,829 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-03-09 07:03:40,829 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-03-09 07:03:40,830 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:03:40" (1/1) ...
[2024-03-09 07:03:40,834 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-03-09 07:03:40,842 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 07:03:40,865 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-09 07:03:40,867 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-09 07:03:40,887 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2024-03-09 07:03:40,887 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2024-03-09 07:03:40,887 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-03-09 07:03:40,887 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2024-03-09 07:03:40,887 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2024-03-09 07:03:40,887 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2024-03-09 07:03:40,888 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2024-03-09 07:03:40,888 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2024-03-09 07:03:40,888 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2024-03-09 07:03:40,888 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-03-09 07:03:40,888 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-03-09 07:03:40,890 WARN  L213             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-03-09 07:03:41,000 INFO  L241             CfgBuilder]: Building ICFG
[2024-03-09 07:03:41,002 INFO  L267             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-03-09 07:03:41,183 INFO  L282             CfgBuilder]: Performing block encoding
[2024-03-09 07:03:41,191 INFO  L304             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-03-09 07:03:41,191 INFO  L309             CfgBuilder]: Removed 3 assume(true) statements.
[2024-03-09 07:03:41,193 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.03 07:03:41 BoogieIcfgContainer
[2024-03-09 07:03:41,193 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-03-09 07:03:41,195 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-03-09 07:03:41,195 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-03-09 07:03:41,197 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-03-09 07:03:41,197 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 07:03:40" (1/3) ...
[2024-03-09 07:03:41,198 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@725b1c04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 07:03:41, skipping insertion in model container
[2024-03-09 07:03:41,198 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:03:40" (2/3) ...
[2024-03-09 07:03:41,198 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@725b1c04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 07:03:41, skipping insertion in model container
[2024-03-09 07:03:41,198 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.03 07:03:41" (3/3) ...
[2024-03-09 07:03:41,199 INFO  L112   eAbstractionObserver]: Analyzing ICFG value-barrier-race.i
[2024-03-09 07:03:41,206 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2024-03-09 07:03:41,213 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-03-09 07:03:41,214 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations.
[2024-03-09 07:03:41,214 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-03-09 07:03:41,251 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2024-03-09 07:03:41,278 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 110 places, 113 transitions, 233 flow
[2024-03-09 07:03:41,323 INFO  L124   PetriNetUnfolderBase]: 8/176 cut-off events.
[2024-03-09 07:03:41,323 INFO  L125   PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES.
[2024-03-09 07:03:41,327 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 181 conditions, 176 events. 8/176 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 332 event pairs, 0 based on Foata normal form. 0/151 useless extension candidates. Maximal degree in co-relation 86. Up to 4 conditions per place. 
[2024-03-09 07:03:41,328 INFO  L82        GeneralOperation]: Start removeDead. Operand has 110 places, 113 transitions, 233 flow
[2024-03-09 07:03:41,331 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 110 places, 113 transitions, 233 flow
[2024-03-09 07:03:41,340 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-09 07:03:41,346 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;@210824e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-03-09 07:03:41,346 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 11 error locations.
[2024-03-09 07:03:41,353 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-03-09 07:03:41,353 INFO  L124   PetriNetUnfolderBase]: 2/39 cut-off events.
[2024-03-09 07:03:41,353 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-03-09 07:03:41,353 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 07:03:41,354 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]
[2024-03-09 07:03:41,354 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-09 07:03:41,359 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 07:03:41,359 INFO  L85        PathProgramCache]: Analyzing trace with hash -1411852213, now seen corresponding path program 1 times
[2024-03-09 07:03:41,366 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 07:03:41,366 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478328861]
[2024-03-09 07:03:41,366 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 07:03:41,367 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 07:03:41,445 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 07:03:41,525 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-09 07:03:41,526 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 07:03:41,526 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478328861]
[2024-03-09 07:03:41,526 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478328861] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 07:03:41,527 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 07:03:41,527 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 07:03:41,528 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810157105]
[2024-03-09 07:03:41,528 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 07:03:41,535 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 07:03:41,539 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 07:03:41,558 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 07:03:41,559 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 07:03:41,578 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 99 out of 113
[2024-03-09 07:03:41,580 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 113 transitions, 233 flow. Second operand  has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 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-09 07:03:41,580 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 07:03:41,580 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 113
[2024-03-09 07:03:41,581 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 07:03:41,633 INFO  L124   PetriNetUnfolderBase]: 7/207 cut-off events.
[2024-03-09 07:03:41,633 INFO  L125   PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES.
[2024-03-09 07:03:41,634 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 240 conditions, 207 events. 7/207 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 557 event pairs, 3 based on Foata normal form. 11/192 useless extension candidates. Maximal degree in co-relation 136. Up to 21 conditions per place. 
[2024-03-09 07:03:41,635 INFO  L140   encePairwiseOnDemand]: 104/113 looper letters, 9 selfloop transitions, 4 changer transitions 1/112 dead transitions.
[2024-03-09 07:03:41,636 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 112 transitions, 257 flow
[2024-03-09 07:03:41,637 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 07:03:41,639 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 07:03:41,645 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 316 transitions.
[2024-03-09 07:03:41,647 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9321533923303835
[2024-03-09 07:03:41,647 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 316 transitions.
[2024-03-09 07:03:41,648 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 316 transitions.
[2024-03-09 07:03:41,649 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 07:03:41,650 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 316 transitions.
[2024-03-09 07:03:41,654 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 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-09 07:03:41,657 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 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-09 07:03:41,658 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 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-09 07:03:41,659 INFO  L175             Difference]: Start difference. First operand has 110 places, 113 transitions, 233 flow. Second operand 3 states and 316 transitions.
[2024-03-09 07:03:41,660 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 112 transitions, 257 flow
[2024-03-09 07:03:41,662 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 112 transitions, 257 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 07:03:41,665 INFO  L231             Difference]: Finished difference. Result has 114 places, 111 transitions, 253 flow
[2024-03-09 07:03:41,667 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=253, PETRI_PLACES=114, PETRI_TRANSITIONS=111}
[2024-03-09 07:03:41,670 INFO  L281   CegarLoopForPetriNet]: 110 programPoint places, 4 predicate places.
[2024-03-09 07:03:41,670 INFO  L495      AbstractCegarLoop]: Abstraction has has 114 places, 111 transitions, 253 flow
[2024-03-09 07:03:41,670 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 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-09 07:03:41,670 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 07:03:41,670 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]
[2024-03-09 07:03:41,671 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-03-09 07:03:41,671 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-09 07:03:41,671 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 07:03:41,671 INFO  L85        PathProgramCache]: Analyzing trace with hash 1692169861, now seen corresponding path program 1 times
[2024-03-09 07:03:41,672 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 07:03:41,672 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717429489]
[2024-03-09 07:03:41,672 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 07:03:41,672 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 07:03:41,697 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 07:03:41,982 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-09 07:03:41,982 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 07:03:41,982 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717429489]
[2024-03-09 07:03:41,983 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717429489] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 07:03:41,983 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 07:03:41,983 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 07:03:41,983 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102800270]
[2024-03-09 07:03:41,983 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 07:03:41,984 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 07:03:41,984 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 07:03:41,985 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 07:03:41,985 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 07:03:42,153 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 85 out of 113
[2024-03-09 07:03:42,154 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 111 transitions, 253 flow. Second operand  has 6 states, 6 states have (on average 86.16666666666667) internal successors, (517), 6 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 07:03:42,154 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 07:03:42,154 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 113
[2024-03-09 07:03:42,154 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 07:03:42,187 INFO  L124   PetriNetUnfolderBase]: 6/199 cut-off events.
[2024-03-09 07:03:42,187 INFO  L125   PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES.
[2024-03-09 07:03:42,188 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 278 conditions, 199 events. 6/199 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 472 event pairs, 1 based on Foata normal form. 0/183 useless extension candidates. Maximal degree in co-relation 137. Up to 31 conditions per place. 
[2024-03-09 07:03:42,189 INFO  L140   encePairwiseOnDemand]: 97/113 looper letters, 20 selfloop transitions, 9 changer transitions 4/120 dead transitions.
[2024-03-09 07:03:42,189 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 120 transitions, 337 flow
[2024-03-09 07:03:42,189 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 07:03:42,189 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 07:03:42,192 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 546 transitions.
[2024-03-09 07:03:42,192 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8053097345132744
[2024-03-09 07:03:42,192 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 546 transitions.
[2024-03-09 07:03:42,192 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 546 transitions.
[2024-03-09 07:03:42,193 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 07:03:42,193 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 546 transitions.
[2024-03-09 07:03:42,195 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 91.0) internal successors, (546), 6 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-09 07:03:42,197 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 113.0) internal successors, (791), 7 states have internal predecessors, (791), 0 states have call successors, (0), 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-09 07:03:42,198 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 113.0) internal successors, (791), 7 states have internal predecessors, (791), 0 states have call successors, (0), 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-09 07:03:42,198 INFO  L175             Difference]: Start difference. First operand has 114 places, 111 transitions, 253 flow. Second operand 6 states and 546 transitions.
[2024-03-09 07:03:42,198 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 120 transitions, 337 flow
[2024-03-09 07:03:42,199 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 120 transitions, 329 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-09 07:03:42,201 INFO  L231             Difference]: Finished difference. Result has 117 places, 116 transitions, 312 flow
[2024-03-09 07:03:42,201 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=312, PETRI_PLACES=117, PETRI_TRANSITIONS=116}
[2024-03-09 07:03:42,202 INFO  L281   CegarLoopForPetriNet]: 110 programPoint places, 7 predicate places.
[2024-03-09 07:03:42,202 INFO  L495      AbstractCegarLoop]: Abstraction has has 117 places, 116 transitions, 312 flow
[2024-03-09 07:03:42,202 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 86.16666666666667) internal successors, (517), 6 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 07:03:42,202 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 07:03:42,202 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]
[2024-03-09 07:03:42,203 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-03-09 07:03:42,203 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-09 07:03:42,203 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 07:03:42,203 INFO  L85        PathProgramCache]: Analyzing trace with hash -1917900192, now seen corresponding path program 1 times
[2024-03-09 07:03:42,203 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 07:03:42,204 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579352745]
[2024-03-09 07:03:42,204 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 07:03:42,204 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 07:03:42,217 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 07:03:42,233 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-09 07:03:42,234 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 07:03:42,234 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579352745]
[2024-03-09 07:03:42,234 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579352745] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 07:03:42,234 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 07:03:42,234 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 07:03:42,234 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685002305]
[2024-03-09 07:03:42,234 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 07:03:42,235 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 07:03:42,235 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 07:03:42,235 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 07:03:42,235 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 07:03:42,242 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 103 out of 113
[2024-03-09 07:03:42,242 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 116 transitions, 312 flow. Second operand  has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 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-09 07:03:42,242 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 07:03:42,242 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 113
[2024-03-09 07:03:42,242 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 07:03:42,272 INFO  L124   PetriNetUnfolderBase]: 8/315 cut-off events.
[2024-03-09 07:03:42,272 INFO  L125   PetriNetUnfolderBase]: For 16/18 co-relation queries the response was YES.
[2024-03-09 07:03:42,273 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 425 conditions, 315 events. 8/315 cut-off events. For 16/18 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1024 event pairs, 1 based on Foata normal form. 1/288 useless extension candidates. Maximal degree in co-relation 309. Up to 14 conditions per place. 
[2024-03-09 07:03:42,274 INFO  L140   encePairwiseOnDemand]: 109/113 looper letters, 7 selfloop transitions, 3 changer transitions 0/120 dead transitions.
[2024-03-09 07:03:42,274 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 120 transitions, 343 flow
[2024-03-09 07:03:42,274 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 07:03:42,275 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 07:03:42,275 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 320 transitions.
[2024-03-09 07:03:42,275 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.943952802359882
[2024-03-09 07:03:42,276 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 320 transitions.
[2024-03-09 07:03:42,276 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 320 transitions.
[2024-03-09 07:03:42,276 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 07:03:42,276 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 320 transitions.
[2024-03-09 07:03:42,277 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 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-09 07:03:42,278 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 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-09 07:03:42,278 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 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-09 07:03:42,278 INFO  L175             Difference]: Start difference. First operand has 117 places, 116 transitions, 312 flow. Second operand 3 states and 320 transitions.
[2024-03-09 07:03:42,278 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 120 transitions, 343 flow
[2024-03-09 07:03:42,281 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 120 transitions, 334 flow, removed 3 selfloop flow, removed 1 redundant places.
[2024-03-09 07:03:42,283 INFO  L231             Difference]: Finished difference. Result has 120 places, 119 transitions, 329 flow
[2024-03-09 07:03:42,283 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=303, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=329, PETRI_PLACES=120, PETRI_TRANSITIONS=119}
[2024-03-09 07:03:42,283 INFO  L281   CegarLoopForPetriNet]: 110 programPoint places, 10 predicate places.
[2024-03-09 07:03:42,283 INFO  L495      AbstractCegarLoop]: Abstraction has has 120 places, 119 transitions, 329 flow
[2024-03-09 07:03:42,284 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 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-09 07:03:42,284 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 07:03:42,284 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]
[2024-03-09 07:03:42,284 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-03-09 07:03:42,284 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-09 07:03:42,285 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 07:03:42,285 INFO  L85        PathProgramCache]: Analyzing trace with hash 1831513461, now seen corresponding path program 1 times
[2024-03-09 07:03:42,285 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 07:03:42,285 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536171457]
[2024-03-09 07:03:42,285 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 07:03:42,285 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 07:03:42,294 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 07:03:42,307 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-09 07:03:42,307 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 07:03:42,307 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536171457]
[2024-03-09 07:03:42,307 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536171457] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 07:03:42,308 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 07:03:42,308 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 07:03:42,308 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646466868]
[2024-03-09 07:03:42,308 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 07:03:42,308 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 07:03:42,308 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 07:03:42,309 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 07:03:42,309 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 07:03:42,321 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 99 out of 113
[2024-03-09 07:03:42,321 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 119 transitions, 329 flow. Second operand  has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 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-09 07:03:42,321 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 07:03:42,321 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 113
[2024-03-09 07:03:42,321 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 07:03:42,373 INFO  L124   PetriNetUnfolderBase]: 25/379 cut-off events.
[2024-03-09 07:03:42,373 INFO  L125   PetriNetUnfolderBase]: For 53/56 co-relation queries the response was YES.
[2024-03-09 07:03:42,374 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 563 conditions, 379 events. 25/379 cut-off events. For 53/56 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1408 event pairs, 3 based on Foata normal form. 1/343 useless extension candidates. Maximal degree in co-relation 376. Up to 44 conditions per place. 
[2024-03-09 07:03:42,375 INFO  L140   encePairwiseOnDemand]: 108/113 looper letters, 10 selfloop transitions, 6 changer transitions 0/123 dead transitions.
[2024-03-09 07:03:42,375 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 123 transitions, 375 flow
[2024-03-09 07:03:42,376 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 07:03:42,376 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 07:03:42,376 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 311 transitions.
[2024-03-09 07:03:42,377 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9174041297935103
[2024-03-09 07:03:42,377 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 311 transitions.
[2024-03-09 07:03:42,377 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 311 transitions.
[2024-03-09 07:03:42,377 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 07:03:42,377 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 311 transitions.
[2024-03-09 07:03:42,378 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 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-09 07:03:42,379 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 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-09 07:03:42,379 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 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-09 07:03:42,379 INFO  L175             Difference]: Start difference. First operand has 120 places, 119 transitions, 329 flow. Second operand 3 states and 311 transitions.
[2024-03-09 07:03:42,380 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 123 transitions, 375 flow
[2024-03-09 07:03:42,382 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 123 transitions, 367 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-09 07:03:42,383 INFO  L231             Difference]: Finished difference. Result has 122 places, 123 transitions, 369 flow
[2024-03-09 07:03:42,384 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=323, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=369, PETRI_PLACES=122, PETRI_TRANSITIONS=123}
[2024-03-09 07:03:42,384 INFO  L281   CegarLoopForPetriNet]: 110 programPoint places, 12 predicate places.
[2024-03-09 07:03:42,384 INFO  L495      AbstractCegarLoop]: Abstraction has has 122 places, 123 transitions, 369 flow
[2024-03-09 07:03:42,385 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 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-09 07:03:42,385 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 07:03:42,385 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-09 07:03:42,385 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-03-09 07:03:42,385 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-09 07:03:42,386 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 07:03:42,386 INFO  L85        PathProgramCache]: Analyzing trace with hash -214390263, now seen corresponding path program 1 times
[2024-03-09 07:03:42,386 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 07:03:42,386 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939072341]
[2024-03-09 07:03:42,386 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 07:03:42,386 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 07:03:42,402 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 07:03:42,422 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-09 07:03:42,422 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 07:03:42,423 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939072341]
[2024-03-09 07:03:42,423 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939072341] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 07:03:42,423 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 07:03:42,423 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 07:03:42,423 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498366556]
[2024-03-09 07:03:42,423 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 07:03:42,423 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 07:03:42,424 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 07:03:42,424 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 07:03:42,424 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 07:03:42,430 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 103 out of 113
[2024-03-09 07:03:42,431 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 123 transitions, 369 flow. Second operand  has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 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-09 07:03:42,431 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 07:03:42,431 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 113
[2024-03-09 07:03:42,431 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 07:03:42,492 INFO  L124   PetriNetUnfolderBase]: 19/465 cut-off events.
[2024-03-09 07:03:42,492 INFO  L125   PetriNetUnfolderBase]: For 79/93 co-relation queries the response was YES.
[2024-03-09 07:03:42,493 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 688 conditions, 465 events. 19/465 cut-off events. For 79/93 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2081 event pairs, 0 based on Foata normal form. 4/438 useless extension candidates. Maximal degree in co-relation 454. Up to 26 conditions per place. 
[2024-03-09 07:03:42,494 INFO  L140   encePairwiseOnDemand]: 109/113 looper letters, 6 selfloop transitions, 4 changer transitions 0/126 dead transitions.
[2024-03-09 07:03:42,494 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 126 transitions, 400 flow
[2024-03-09 07:03:42,495 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 07:03:42,495 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 07:03:42,495 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 319 transitions.
[2024-03-09 07:03:42,495 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9410029498525073
[2024-03-09 07:03:42,496 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 319 transitions.
[2024-03-09 07:03:42,496 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 319 transitions.
[2024-03-09 07:03:42,496 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 07:03:42,496 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 319 transitions.
[2024-03-09 07:03:42,497 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 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-09 07:03:42,497 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 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-09 07:03:42,498 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 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-09 07:03:42,498 INFO  L175             Difference]: Start difference. First operand has 122 places, 123 transitions, 369 flow. Second operand 3 states and 319 transitions.
[2024-03-09 07:03:42,498 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 126 transitions, 400 flow
[2024-03-09 07:03:42,500 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 126 transitions, 388 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-09 07:03:42,501 INFO  L231             Difference]: Finished difference. Result has 124 places, 125 transitions, 385 flow
[2024-03-09 07:03:42,501 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=357, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=385, PETRI_PLACES=124, PETRI_TRANSITIONS=125}
[2024-03-09 07:03:42,502 INFO  L281   CegarLoopForPetriNet]: 110 programPoint places, 14 predicate places.
[2024-03-09 07:03:42,502 INFO  L495      AbstractCegarLoop]: Abstraction has has 124 places, 125 transitions, 385 flow
[2024-03-09 07:03:42,502 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 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-09 07:03:42,502 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 07:03:42,503 INFO  L208   CegarLoopForPetriNet]: trace histogram [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]
[2024-03-09 07:03:42,503 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-03-09 07:03:42,503 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-09 07:03:42,503 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 07:03:42,503 INFO  L85        PathProgramCache]: Analyzing trace with hash 1379493982, now seen corresponding path program 1 times
[2024-03-09 07:03:42,503 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 07:03:42,503 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946932323]
[2024-03-09 07:03:42,504 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 07:03:42,504 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 07:03:42,528 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-09 07:03:42,528 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-03-09 07:03:42,539 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-09 07:03:42,559 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-03-09 07:03:42,560 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-03-09 07:03:42,560 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining)
[2024-03-09 07:03:42,562 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining)
[2024-03-09 07:03:42,562 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining)
[2024-03-09 07:03:42,562 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining)
[2024-03-09 07:03:42,562 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining)
[2024-03-09 07:03:42,562 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining)
[2024-03-09 07:03:42,562 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining)
[2024-03-09 07:03:42,562 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining)
[2024-03-09 07:03:42,562 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining)
[2024-03-09 07:03:42,563 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining)
[2024-03-09 07:03:42,563 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining)
[2024-03-09 07:03:42,563 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-03-09 07:03:42,563 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1]
[2024-03-09 07:03:42,565 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-03-09 07:03:42,565 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2024-03-09 07:03:42,578 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2024-03-09 07:03:42,581 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 124 places, 128 transitions, 272 flow
[2024-03-09 07:03:42,599 INFO  L124   PetriNetUnfolderBase]: 15/305 cut-off events.
[2024-03-09 07:03:42,600 INFO  L125   PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES.
[2024-03-09 07:03:42,600 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 317 conditions, 305 events. 15/305 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 699 event pairs, 0 based on Foata normal form. 0/261 useless extension candidates. Maximal degree in co-relation 178. Up to 8 conditions per place. 
[2024-03-09 07:03:42,600 INFO  L82        GeneralOperation]: Start removeDead. Operand has 124 places, 128 transitions, 272 flow
[2024-03-09 07:03:42,602 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 124 places, 128 transitions, 272 flow
[2024-03-09 07:03:42,603 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-09 07:03:42,604 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;@210824e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-03-09 07:03:42,604 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 13 error locations.
[2024-03-09 07:03:42,606 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-03-09 07:03:42,606 INFO  L124   PetriNetUnfolderBase]: 2/39 cut-off events.
[2024-03-09 07:03:42,606 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-03-09 07:03:42,606 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 07:03:42,606 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]
[2024-03-09 07:03:42,606 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-03-09 07:03:42,607 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 07:03:42,607 INFO  L85        PathProgramCache]: Analyzing trace with hash 354416843, now seen corresponding path program 1 times
[2024-03-09 07:03:42,607 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 07:03:42,607 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149837049]
[2024-03-09 07:03:42,607 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 07:03:42,607 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 07:03:42,614 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 07:03:42,625 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-09 07:03:42,626 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 07:03:42,626 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149837049]
[2024-03-09 07:03:42,626 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149837049] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 07:03:42,626 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 07:03:42,626 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 07:03:42,626 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123860405]
[2024-03-09 07:03:42,626 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 07:03:42,627 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 07:03:42,627 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 07:03:42,627 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 07:03:42,627 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 07:03:42,640 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 110 out of 128
[2024-03-09 07:03:42,641 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 128 transitions, 272 flow. Second operand  has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 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-09 07:03:42,641 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 07:03:42,641 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 128
[2024-03-09 07:03:42,641 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 07:03:42,700 INFO  L124   PetriNetUnfolderBase]: 43/526 cut-off events.
[2024-03-09 07:03:42,700 INFO  L125   PetriNetUnfolderBase]: For 29/39 co-relation queries the response was YES.
[2024-03-09 07:03:42,701 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 645 conditions, 526 events. 43/526 cut-off events. For 29/39 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2275 event pairs, 23 based on Foata normal form. 50/500 useless extension candidates. Maximal degree in co-relation 344. Up to 83 conditions per place. 
[2024-03-09 07:03:42,702 INFO  L140   encePairwiseOnDemand]: 117/128 looper letters, 12 selfloop transitions, 5 changer transitions 1/127 dead transitions.
[2024-03-09 07:03:42,703 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 127 transitions, 304 flow
[2024-03-09 07:03:42,703 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 07:03:42,703 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 07:03:42,704 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 355 transitions.
[2024-03-09 07:03:42,704 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9244791666666666
[2024-03-09 07:03:42,704 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 355 transitions.
[2024-03-09 07:03:42,704 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 355 transitions.
[2024-03-09 07:03:42,704 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 07:03:42,704 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 355 transitions.
[2024-03-09 07:03:42,705 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 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-09 07:03:42,706 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 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-09 07:03:42,706 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 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-09 07:03:42,706 INFO  L175             Difference]: Start difference. First operand has 124 places, 128 transitions, 272 flow. Second operand 3 states and 355 transitions.
[2024-03-09 07:03:42,706 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 127 transitions, 304 flow
[2024-03-09 07:03:42,707 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 127 transitions, 304 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 07:03:42,708 INFO  L231             Difference]: Finished difference. Result has 128 places, 126 transitions, 298 flow
[2024-03-09 07:03:42,708 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=298, PETRI_PLACES=128, PETRI_TRANSITIONS=126}
[2024-03-09 07:03:42,709 INFO  L281   CegarLoopForPetriNet]: 124 programPoint places, 4 predicate places.
[2024-03-09 07:03:42,709 INFO  L495      AbstractCegarLoop]: Abstraction has has 128 places, 126 transitions, 298 flow
[2024-03-09 07:03:42,709 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 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-09 07:03:42,709 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 07:03:42,709 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]
[2024-03-09 07:03:42,709 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-03-09 07:03:42,710 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-03-09 07:03:42,710 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 07:03:42,710 INFO  L85        PathProgramCache]: Analyzing trace with hash 611935877, now seen corresponding path program 1 times
[2024-03-09 07:03:42,710 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 07:03:42,710 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934435560]
[2024-03-09 07:03:42,710 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 07:03:42,710 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 07:03:42,718 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 07:03:42,877 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-09 07:03:42,877 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 07:03:42,877 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934435560]
[2024-03-09 07:03:42,878 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934435560] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 07:03:42,878 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 07:03:42,878 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 07:03:42,878 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916212105]
[2024-03-09 07:03:42,878 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 07:03:42,878 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 07:03:42,878 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 07:03:42,879 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 07:03:42,879 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 07:03:43,016 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 97 out of 128
[2024-03-09 07:03:43,017 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 126 transitions, 298 flow. Second operand  has 6 states, 6 states have (on average 98.16666666666667) internal successors, (589), 6 states have internal predecessors, (589), 0 states have call successors, (0), 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-09 07:03:43,017 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 07:03:43,017 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 128
[2024-03-09 07:03:43,017 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 07:03:43,100 INFO  L124   PetriNetUnfolderBase]: 29/446 cut-off events.
[2024-03-09 07:03:43,101 INFO  L125   PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES.
[2024-03-09 07:03:43,102 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 642 conditions, 446 events. 29/446 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1704 event pairs, 9 based on Foata normal form. 0/404 useless extension candidates. Maximal degree in co-relation 315. Up to 72 conditions per place. 
[2024-03-09 07:03:43,103 INFO  L140   encePairwiseOnDemand]: 112/128 looper letters, 22 selfloop transitions, 9 changer transitions 4/135 dead transitions.
[2024-03-09 07:03:43,103 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 135 transitions, 386 flow
[2024-03-09 07:03:43,106 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 07:03:43,106 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 07:03:43,107 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 620 transitions.
[2024-03-09 07:03:43,107 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8072916666666666
[2024-03-09 07:03:43,107 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 620 transitions.
[2024-03-09 07:03:43,107 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 620 transitions.
[2024-03-09 07:03:43,107 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 07:03:43,108 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 620 transitions.
[2024-03-09 07:03:43,109 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 103.33333333333333) internal successors, (620), 6 states have internal predecessors, (620), 0 states have call successors, (0), 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-09 07:03:43,110 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 128.0) internal successors, (896), 7 states have internal predecessors, (896), 0 states have call successors, (0), 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-09 07:03:43,110 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 128.0) internal successors, (896), 7 states have internal predecessors, (896), 0 states have call successors, (0), 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-09 07:03:43,110 INFO  L175             Difference]: Start difference. First operand has 128 places, 126 transitions, 298 flow. Second operand 6 states and 620 transitions.
[2024-03-09 07:03:43,110 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 135 transitions, 386 flow
[2024-03-09 07:03:43,112 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 135 transitions, 376 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-09 07:03:43,113 INFO  L231             Difference]: Finished difference. Result has 131 places, 131 transitions, 355 flow
[2024-03-09 07:03:43,113 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=355, PETRI_PLACES=131, PETRI_TRANSITIONS=131}
[2024-03-09 07:03:43,114 INFO  L281   CegarLoopForPetriNet]: 124 programPoint places, 7 predicate places.
[2024-03-09 07:03:43,114 INFO  L495      AbstractCegarLoop]: Abstraction has has 131 places, 131 transitions, 355 flow
[2024-03-09 07:03:43,114 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 98.16666666666667) internal successors, (589), 6 states have internal predecessors, (589), 0 states have call successors, (0), 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-09 07:03:43,114 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 07:03:43,114 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]
[2024-03-09 07:03:43,114 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-03-09 07:03:43,114 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-03-09 07:03:43,115 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 07:03:43,115 INFO  L85        PathProgramCache]: Analyzing trace with hash -1040841805, now seen corresponding path program 1 times
[2024-03-09 07:03:43,115 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 07:03:43,115 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922758461]
[2024-03-09 07:03:43,115 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 07:03:43,115 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 07:03:43,125 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 07:03:43,145 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-09 07:03:43,145 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 07:03:43,145 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922758461]
[2024-03-09 07:03:43,145 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922758461] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 07:03:43,145 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 07:03:43,145 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 07:03:43,146 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728262940]
[2024-03-09 07:03:43,146 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 07:03:43,146 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 07:03:43,146 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 07:03:43,146 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 07:03:43,146 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 07:03:43,154 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 112 out of 128
[2024-03-09 07:03:43,155 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 131 transitions, 355 flow. Second operand  has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 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-09 07:03:43,155 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 07:03:43,155 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 128
[2024-03-09 07:03:43,155 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 07:03:43,280 INFO  L124   PetriNetUnfolderBase]: 102/1429 cut-off events.
[2024-03-09 07:03:43,281 INFO  L125   PetriNetUnfolderBase]: For 130/178 co-relation queries the response was YES.
[2024-03-09 07:03:43,284 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1950 conditions, 1429 events. 102/1429 cut-off events. For 130/178 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 10360 event pairs, 25 based on Foata normal form. 5/1267 useless extension candidates. Maximal degree in co-relation 1738. Up to 93 conditions per place. 
[2024-03-09 07:03:43,288 INFO  L140   encePairwiseOnDemand]: 121/128 looper letters, 14 selfloop transitions, 5 changer transitions 0/139 dead transitions.
[2024-03-09 07:03:43,288 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 139 transitions, 420 flow
[2024-03-09 07:03:43,289 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 07:03:43,289 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 07:03:43,290 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 357 transitions.
[2024-03-09 07:03:43,290 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9296875
[2024-03-09 07:03:43,290 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 357 transitions.
[2024-03-09 07:03:43,290 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 357 transitions.
[2024-03-09 07:03:43,290 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 07:03:43,290 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 357 transitions.
[2024-03-09 07:03:43,291 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 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-09 07:03:43,292 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 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-09 07:03:43,292 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 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-09 07:03:43,292 INFO  L175             Difference]: Start difference. First operand has 131 places, 131 transitions, 355 flow. Second operand 3 states and 357 transitions.
[2024-03-09 07:03:43,292 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 139 transitions, 420 flow
[2024-03-09 07:03:43,295 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 139 transitions, 411 flow, removed 3 selfloop flow, removed 1 redundant places.
[2024-03-09 07:03:43,296 INFO  L231             Difference]: Finished difference. Result has 134 places, 136 transitions, 390 flow
[2024-03-09 07:03:43,296 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=390, PETRI_PLACES=134, PETRI_TRANSITIONS=136}
[2024-03-09 07:03:43,297 INFO  L281   CegarLoopForPetriNet]: 124 programPoint places, 10 predicate places.
[2024-03-09 07:03:43,297 INFO  L495      AbstractCegarLoop]: Abstraction has has 134 places, 136 transitions, 390 flow
[2024-03-09 07:03:43,297 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 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-09 07:03:43,297 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 07:03:43,297 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]
[2024-03-09 07:03:43,297 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-03-09 07:03:43,297 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-03-09 07:03:43,297 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 07:03:43,298 INFO  L85        PathProgramCache]: Analyzing trace with hash -1586782731, now seen corresponding path program 1 times
[2024-03-09 07:03:43,298 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 07:03:43,298 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609323367]
[2024-03-09 07:03:43,298 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 07:03:43,298 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 07:03:43,303 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 07:03:43,318 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-09 07:03:43,318 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 07:03:43,318 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609323367]
[2024-03-09 07:03:43,318 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609323367] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 07:03:43,318 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 07:03:43,318 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 07:03:43,318 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921271095]
[2024-03-09 07:03:43,318 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 07:03:43,319 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 07:03:43,319 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 07:03:43,319 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 07:03:43,319 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 07:03:43,332 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 110 out of 128
[2024-03-09 07:03:43,332 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 136 transitions, 390 flow. Second operand  has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 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-09 07:03:43,332 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 07:03:43,332 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 128
[2024-03-09 07:03:43,332 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 07:03:43,395 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([386] L1015-4-->L1015-1: Formula: (= |v_#race~ready~0_4| 0)  InVars {}  OutVars{#race~ready~0=|v_#race~ready~0_4|}  AuxVars[]  AssignedVars[#race~ready~0][109], [Black: 129#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), 50#L1015-2true, Black: 136#(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: 137#(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: 135#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 150#true, Black: 133#true, 146#(= |#race~ready~0| 0), 40#L1015-1true, Black: 144#true, threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, 121#L1027-4true])
[2024-03-09 07:03:43,395 INFO  L294   olderBase$Statistics]: this new event has 77 ancestors and is cut-off event
[2024-03-09 07:03:43,395 INFO  L297   olderBase$Statistics]:   existing Event has 74 ancestors and is cut-off event
[2024-03-09 07:03:43,395 INFO  L297   olderBase$Statistics]:   existing Event has 74 ancestors and is cut-off event
[2024-03-09 07:03:43,395 INFO  L297   olderBase$Statistics]:   existing Event has 77 ancestors and is cut-off event
[2024-03-09 07:03:43,401 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([399] L1015-4-->L1015-1: Formula: (= |v_#race~ready~0_4| 0)  InVars {}  OutVars{#race~ready~0=|v_#race~ready~0_4|}  AuxVars[]  AssignedVars[#race~ready~0][135], [Black: 129#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), Black: 136#(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: 137#(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: 135#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 150#true, Black: 133#true, 146#(= |#race~ready~0| 0), 25#L1015-2true, 74#L1015-1true, Black: 144#true, threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, 121#L1027-4true])
[2024-03-09 07:03:43,402 INFO  L294   olderBase$Statistics]: this new event has 77 ancestors and is cut-off event
[2024-03-09 07:03:43,402 INFO  L297   olderBase$Statistics]:   existing Event has 74 ancestors and is cut-off event
[2024-03-09 07:03:43,402 INFO  L297   olderBase$Statistics]:   existing Event has 74 ancestors and is cut-off event
[2024-03-09 07:03:43,402 INFO  L297   olderBase$Statistics]:   existing Event has 77 ancestors and is cut-off event
[2024-03-09 07:03:43,406 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([386] L1015-4-->L1015-1: Formula: (= |v_#race~ready~0_4| 0)  InVars {}  OutVars{#race~ready~0=|v_#race~ready~0_4|}  AuxVars[]  AssignedVars[#race~ready~0][57], [113#L1028true, Black: 129#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), 50#L1015-2true, Black: 136#(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: 137#(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: 135#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 150#true, Black: 133#true, 146#(= |#race~ready~0| 0), 40#L1015-1true, Black: 144#true, threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse])
[2024-03-09 07:03:43,406 INFO  L294   olderBase$Statistics]: this new event has 78 ancestors and is cut-off event
[2024-03-09 07:03:43,406 INFO  L297   olderBase$Statistics]:   existing Event has 75 ancestors and is cut-off event
[2024-03-09 07:03:43,406 INFO  L297   olderBase$Statistics]:   existing Event has 75 ancestors and is cut-off event
[2024-03-09 07:03:43,406 INFO  L297   olderBase$Statistics]:   existing Event has 78 ancestors and is cut-off event
[2024-03-09 07:03:43,411 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([399] L1015-4-->L1015-1: Formula: (= |v_#race~ready~0_4| 0)  InVars {}  OutVars{#race~ready~0=|v_#race~ready~0_4|}  AuxVars[]  AssignedVars[#race~ready~0][93], [113#L1028true, Black: 129#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), Black: 136#(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: 137#(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: 135#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 150#true, Black: 133#true, 146#(= |#race~ready~0| 0), 25#L1015-2true, 74#L1015-1true, Black: 144#true, threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse])
[2024-03-09 07:03:43,411 INFO  L294   olderBase$Statistics]: this new event has 78 ancestors and is cut-off event
[2024-03-09 07:03:43,411 INFO  L297   olderBase$Statistics]:   existing Event has 75 ancestors and is cut-off event
[2024-03-09 07:03:43,412 INFO  L297   olderBase$Statistics]:   existing Event has 75 ancestors and is cut-off event
[2024-03-09 07:03:43,412 INFO  L297   olderBase$Statistics]:   existing Event has 78 ancestors and is cut-off event
[2024-03-09 07:03:43,453 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([386] L1015-4-->L1015-1: Formula: (= |v_#race~ready~0_4| 0)  InVars {}  OutVars{#race~ready~0=|v_#race~ready~0_4|}  AuxVars[]  AssignedVars[#race~ready~0][57], [Black: 129#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), 133#true, 50#L1015-2true, Black: 136#(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)), 54#ULTIMATE.startFINALtrue, Black: 137#(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: 135#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 150#true, 146#(= |#race~ready~0| 0), 40#L1015-1true, Black: 144#true, threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse])
[2024-03-09 07:03:43,453 INFO  L294   olderBase$Statistics]: this new event has 94 ancestors and is cut-off event
[2024-03-09 07:03:43,453 INFO  L297   olderBase$Statistics]:   existing Event has 91 ancestors and is cut-off event
[2024-03-09 07:03:43,453 INFO  L297   olderBase$Statistics]:   existing Event has 91 ancestors and is cut-off event
[2024-03-09 07:03:43,453 INFO  L297   olderBase$Statistics]:   existing Event has 94 ancestors and is cut-off event
[2024-03-09 07:03:43,455 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([399] L1015-4-->L1015-1: Formula: (= |v_#race~ready~0_4| 0)  InVars {}  OutVars{#race~ready~0=|v_#race~ready~0_4|}  AuxVars[]  AssignedVars[#race~ready~0][93], [Black: 129#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), 133#true, Black: 136#(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)), 54#ULTIMATE.startFINALtrue, Black: 137#(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: 135#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 150#true, 146#(= |#race~ready~0| 0), 25#L1015-2true, 74#L1015-1true, Black: 144#true, threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse])
[2024-03-09 07:03:43,455 INFO  L294   olderBase$Statistics]: this new event has 94 ancestors and is cut-off event
[2024-03-09 07:03:43,455 INFO  L297   olderBase$Statistics]:   existing Event has 94 ancestors and is cut-off event
[2024-03-09 07:03:43,455 INFO  L297   olderBase$Statistics]:   existing Event has 91 ancestors and is cut-off event
[2024-03-09 07:03:43,455 INFO  L297   olderBase$Statistics]:   existing Event has 91 ancestors and is cut-off event
[2024-03-09 07:03:43,490 INFO  L124   PetriNetUnfolderBase]: 298/1949 cut-off events.
[2024-03-09 07:03:43,491 INFO  L125   PetriNetUnfolderBase]: For 464/511 co-relation queries the response was YES.
[2024-03-09 07:03:43,495 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3109 conditions, 1949 events. 298/1949 cut-off events. For 464/511 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 14691 event pairs, 48 based on Foata normal form. 8/1688 useless extension candidates. Maximal degree in co-relation 2296. Up to 348 conditions per place. 
[2024-03-09 07:03:43,501 INFO  L140   encePairwiseOnDemand]: 122/128 looper letters, 14 selfloop transitions, 8 changer transitions 0/142 dead transitions.
[2024-03-09 07:03:43,502 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 142 transitions, 458 flow
[2024-03-09 07:03:43,502 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 07:03:43,502 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 07:03:43,503 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 348 transitions.
[2024-03-09 07:03:43,503 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.90625
[2024-03-09 07:03:43,503 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 348 transitions.
[2024-03-09 07:03:43,503 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 348 transitions.
[2024-03-09 07:03:43,504 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 07:03:43,504 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 348 transitions.
[2024-03-09 07:03:43,504 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 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-09 07:03:43,505 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 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-09 07:03:43,505 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 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-09 07:03:43,505 INFO  L175             Difference]: Start difference. First operand has 134 places, 136 transitions, 390 flow. Second operand 3 states and 348 transitions.
[2024-03-09 07:03:43,505 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 142 transitions, 458 flow
[2024-03-09 07:03:43,507 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 142 transitions, 444 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-09 07:03:43,509 INFO  L231             Difference]: Finished difference. Result has 136 places, 142 transitions, 446 flow
[2024-03-09 07:03:43,509 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=446, PETRI_PLACES=136, PETRI_TRANSITIONS=142}
[2024-03-09 07:03:43,509 INFO  L281   CegarLoopForPetriNet]: 124 programPoint places, 12 predicate places.
[2024-03-09 07:03:43,510 INFO  L495      AbstractCegarLoop]: Abstraction has has 136 places, 142 transitions, 446 flow
[2024-03-09 07:03:43,510 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 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-09 07:03:43,510 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 07:03:43,510 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-09 07:03:43,510 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-03-09 07:03:43,510 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-03-09 07:03:43,510 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 07:03:43,510 INFO  L85        PathProgramCache]: Analyzing trace with hash 1946082390, now seen corresponding path program 1 times
[2024-03-09 07:03:43,510 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 07:03:43,511 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087139779]
[2024-03-09 07:03:43,511 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 07:03:43,511 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 07:03:43,520 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 07:03:43,536 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-09 07:03:43,536 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 07:03:43,536 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087139779]
[2024-03-09 07:03:43,536 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087139779] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 07:03:43,536 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 07:03:43,536 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 07:03:43,536 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308353828]
[2024-03-09 07:03:43,536 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 07:03:43,537 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 07:03:43,537 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 07:03:43,537 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 07:03:43,537 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 07:03:43,548 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 112 out of 128
[2024-03-09 07:03:43,548 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 142 transitions, 446 flow. Second operand  has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 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-09 07:03:43,549 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 07:03:43,549 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 128
[2024-03-09 07:03:43,549 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 07:03:43,637 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([386] L1015-4-->L1015-1: Formula: (= |v_#race~ready~0_4| 0)  InVars {}  OutVars{#race~ready~0=|v_#race~ready~0_4|}  AuxVars[]  AssignedVars[#race~ready~0][111], [Black: 129#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), 50#L1015-2true, Black: 136#(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: 137#(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: 135#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 133#true, 150#true, 40#L1015-1true, 156#true, Black: 144#true, Black: 152#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|), threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, 121#L1027-4true])
[2024-03-09 07:03:43,638 INFO  L294   olderBase$Statistics]: this new event has 77 ancestors and is cut-off event
[2024-03-09 07:03:43,638 INFO  L297   olderBase$Statistics]:   existing Event has 77 ancestors and is cut-off event
[2024-03-09 07:03:43,638 INFO  L297   olderBase$Statistics]:   existing Event has 74 ancestors and is cut-off event
[2024-03-09 07:03:43,638 INFO  L297   olderBase$Statistics]:   existing Event has 74 ancestors and is cut-off event
[2024-03-09 07:03:43,638 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([399] L1015-4-->L1015-1: Formula: (= |v_#race~ready~0_4| 0)  InVars {}  OutVars{#race~ready~0=|v_#race~ready~0_4|}  AuxVars[]  AssignedVars[#race~ready~0][142], [Black: 129#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), Black: 136#(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: 137#(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: 135#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 133#true, 150#true, 25#L1015-2true, 156#true, 74#L1015-1true, Black: 144#true, Black: 152#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|), threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, 121#L1027-4true])
[2024-03-09 07:03:43,638 INFO  L294   olderBase$Statistics]: this new event has 77 ancestors and is cut-off event
[2024-03-09 07:03:43,638 INFO  L297   olderBase$Statistics]:   existing Event has 74 ancestors and is cut-off event
[2024-03-09 07:03:43,638 INFO  L297   olderBase$Statistics]:   existing Event has 74 ancestors and is cut-off event
[2024-03-09 07:03:43,639 INFO  L297   olderBase$Statistics]:   existing Event has 77 ancestors and is cut-off event
[2024-03-09 07:03:43,646 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([386] L1015-4-->L1015-1: Formula: (= |v_#race~ready~0_4| 0)  InVars {}  OutVars{#race~ready~0=|v_#race~ready~0_4|}  AuxVars[]  AssignedVars[#race~ready~0][57], [113#L1028true, Black: 129#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), 50#L1015-2true, Black: 136#(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: 137#(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: 135#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 133#true, 150#true, 40#L1015-1true, 156#true, Black: 144#true, Black: 152#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|), threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse])
[2024-03-09 07:03:43,647 INFO  L294   olderBase$Statistics]: this new event has 78 ancestors and is cut-off event
[2024-03-09 07:03:43,647 INFO  L297   olderBase$Statistics]:   existing Event has 78 ancestors and is cut-off event
[2024-03-09 07:03:43,647 INFO  L297   olderBase$Statistics]:   existing Event has 75 ancestors and is cut-off event
[2024-03-09 07:03:43,647 INFO  L297   olderBase$Statistics]:   existing Event has 75 ancestors and is cut-off event
[2024-03-09 07:03:43,658 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([399] L1015-4-->L1015-1: Formula: (= |v_#race~ready~0_4| 0)  InVars {}  OutVars{#race~ready~0=|v_#race~ready~0_4|}  AuxVars[]  AssignedVars[#race~ready~0][91], [113#L1028true, Black: 129#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), Black: 136#(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: 137#(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: 135#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 133#true, 150#true, 25#L1015-2true, 156#true, 74#L1015-1true, Black: 144#true, Black: 152#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|), threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse])
[2024-03-09 07:03:43,658 INFO  L294   olderBase$Statistics]: this new event has 78 ancestors and is cut-off event
[2024-03-09 07:03:43,658 INFO  L297   olderBase$Statistics]:   existing Event has 75 ancestors and is cut-off event
[2024-03-09 07:03:43,658 INFO  L297   olderBase$Statistics]:   existing Event has 78 ancestors and is cut-off event
[2024-03-09 07:03:43,658 INFO  L297   olderBase$Statistics]:   existing Event has 75 ancestors and is cut-off event
[2024-03-09 07:03:43,885 INFO  L124   PetriNetUnfolderBase]: 386/3533 cut-off events.
[2024-03-09 07:03:43,885 INFO  L125   PetriNetUnfolderBase]: For 989/1445 co-relation queries the response was YES.
[2024-03-09 07:03:43,891 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5551 conditions, 3533 events. 386/3533 cut-off events. For 989/1445 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 33915 event pairs, 41 based on Foata normal form. 33/3235 useless extension candidates. Maximal degree in co-relation 4169. Up to 355 conditions per place. 
[2024-03-09 07:03:43,899 INFO  L140   encePairwiseOnDemand]: 121/128 looper letters, 16 selfloop transitions, 7 changer transitions 0/152 dead transitions.
[2024-03-09 07:03:43,900 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 152 transitions, 533 flow
[2024-03-09 07:03:43,900 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 07:03:43,900 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 07:03:43,901 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 357 transitions.
[2024-03-09 07:03:43,901 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9296875
[2024-03-09 07:03:43,901 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 357 transitions.
[2024-03-09 07:03:43,901 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 357 transitions.
[2024-03-09 07:03:43,901 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 07:03:43,901 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 357 transitions.
[2024-03-09 07:03:43,902 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 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-09 07:03:43,903 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 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-09 07:03:43,903 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 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-09 07:03:43,903 INFO  L175             Difference]: Start difference. First operand has 136 places, 142 transitions, 446 flow. Second operand 3 states and 357 transitions.
[2024-03-09 07:03:43,903 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 152 transitions, 533 flow
[2024-03-09 07:03:43,910 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 152 transitions, 517 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-09 07:03:43,911 INFO  L231             Difference]: Finished difference. Result has 138 places, 149 transitions, 500 flow
[2024-03-09 07:03:43,912 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=430, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=500, PETRI_PLACES=138, PETRI_TRANSITIONS=149}
[2024-03-09 07:03:43,912 INFO  L281   CegarLoopForPetriNet]: 124 programPoint places, 14 predicate places.
[2024-03-09 07:03:43,912 INFO  L495      AbstractCegarLoop]: Abstraction has has 138 places, 149 transitions, 500 flow
[2024-03-09 07:03:43,913 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 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-09 07:03:43,913 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 07:03:43,913 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]
[2024-03-09 07:03:43,913 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-03-09 07:03:43,913 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-03-09 07:03:43,913 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 07:03:43,913 INFO  L85        PathProgramCache]: Analyzing trace with hash 1466173380, now seen corresponding path program 1 times
[2024-03-09 07:03:43,913 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 07:03:43,913 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532212]
[2024-03-09 07:03:43,913 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 07:03:43,914 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 07:03:43,924 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 07:03:43,984 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-09 07:03:43,984 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 07:03:43,984 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532212]
[2024-03-09 07:03:43,984 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532212] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 07:03:43,984 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 07:03:43,984 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 07:03:43,984 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778124488]
[2024-03-09 07:03:43,984 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 07:03:43,985 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-03-09 07:03:43,985 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 07:03:43,985 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-03-09 07:03:43,985 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-03-09 07:03:44,029 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 108 out of 128
[2024-03-09 07:03:44,029 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 149 transitions, 500 flow. Second operand  has 5 states, 5 states have (on average 109.4) internal successors, (547), 5 states have internal predecessors, (547), 0 states have call successors, (0), 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-09 07:03:44,029 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 07:03:44,029 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 128
[2024-03-09 07:03:44,029 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 07:03:44,113 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([386] L1015-4-->L1015-1: Formula: (= |v_#race~ready~0_4| 0)  InVars {}  OutVars{#race~ready~0=|v_#race~ready~0_4|}  AuxVars[]  AssignedVars[#race~ready~0][101], [Black: 158#(= |#race~data~0| 0), Black: 129#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), 162#true, 50#L1015-2true, Black: 136#(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: 137#(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: 135#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 133#true, 40#L1015-1true, 156#true, Black: 144#true, Black: 152#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|), threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, 121#L1027-4true])
[2024-03-09 07:03:44,113 INFO  L294   olderBase$Statistics]: this new event has 77 ancestors and is cut-off event
[2024-03-09 07:03:44,113 INFO  L297   olderBase$Statistics]:   existing Event has 74 ancestors and is cut-off event
[2024-03-09 07:03:44,114 INFO  L297   olderBase$Statistics]:   existing Event has 74 ancestors and is cut-off event
[2024-03-09 07:03:44,114 INFO  L297   olderBase$Statistics]:   existing Event has 77 ancestors and is cut-off event
[2024-03-09 07:03:44,114 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([399] L1015-4-->L1015-1: Formula: (= |v_#race~ready~0_4| 0)  InVars {}  OutVars{#race~ready~0=|v_#race~ready~0_4|}  AuxVars[]  AssignedVars[#race~ready~0][142], [Black: 158#(= |#race~data~0| 0), Black: 129#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), 162#true, Black: 136#(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: 137#(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: 135#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 133#true, 25#L1015-2true, 156#true, 74#L1015-1true, Black: 144#true, Black: 152#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|), threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, 121#L1027-4true])
[2024-03-09 07:03:44,114 INFO  L294   olderBase$Statistics]: this new event has 77 ancestors and is cut-off event
[2024-03-09 07:03:44,114 INFO  L297   olderBase$Statistics]:   existing Event has 77 ancestors and is cut-off event
[2024-03-09 07:03:44,114 INFO  L297   olderBase$Statistics]:   existing Event has 74 ancestors and is cut-off event
[2024-03-09 07:03:44,114 INFO  L297   olderBase$Statistics]:   existing Event has 74 ancestors and is cut-off event
[2024-03-09 07:03:44,121 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([386] L1015-4-->L1015-1: Formula: (= |v_#race~ready~0_4| 0)  InVars {}  OutVars{#race~ready~0=|v_#race~ready~0_4|}  AuxVars[]  AssignedVars[#race~ready~0][57], [Black: 158#(= |#race~data~0| 0), 113#L1028true, Black: 129#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), 162#true, 50#L1015-2true, Black: 136#(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: 137#(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: 135#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 133#true, 40#L1015-1true, 156#true, Black: 144#true, Black: 152#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|), threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse])
[2024-03-09 07:03:44,121 INFO  L294   olderBase$Statistics]: this new event has 78 ancestors and is cut-off event
[2024-03-09 07:03:44,121 INFO  L297   olderBase$Statistics]:   existing Event has 75 ancestors and is cut-off event
[2024-03-09 07:03:44,121 INFO  L297   olderBase$Statistics]:   existing Event has 75 ancestors and is cut-off event
[2024-03-09 07:03:44,121 INFO  L297   olderBase$Statistics]:   existing Event has 78 ancestors and is cut-off event
[2024-03-09 07:03:44,129 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([399] L1015-4-->L1015-1: Formula: (= |v_#race~ready~0_4| 0)  InVars {}  OutVars{#race~ready~0=|v_#race~ready~0_4|}  AuxVars[]  AssignedVars[#race~ready~0][78], [Black: 158#(= |#race~data~0| 0), 113#L1028true, Black: 129#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), 162#true, Black: 136#(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: 137#(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: 135#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 133#true, 25#L1015-2true, 156#true, 74#L1015-1true, Black: 144#true, Black: 152#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|), threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse])
[2024-03-09 07:03:44,129 INFO  L294   olderBase$Statistics]: this new event has 78 ancestors and is cut-off event
[2024-03-09 07:03:44,129 INFO  L297   olderBase$Statistics]:   existing Event has 75 ancestors and is cut-off event
[2024-03-09 07:03:44,129 INFO  L297   olderBase$Statistics]:   existing Event has 75 ancestors and is cut-off event
[2024-03-09 07:03:44,129 INFO  L297   olderBase$Statistics]:   existing Event has 78 ancestors and is cut-off event
[2024-03-09 07:03:44,342 INFO  L124   PetriNetUnfolderBase]: 362/3524 cut-off events.
[2024-03-09 07:03:44,342 INFO  L125   PetriNetUnfolderBase]: For 772/940 co-relation queries the response was YES.
[2024-03-09 07:03:44,350 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5699 conditions, 3524 events. 362/3524 cut-off events. For 772/940 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 34080 event pairs, 33 based on Foata normal form. 1/3270 useless extension candidates. Maximal degree in co-relation 4279. Up to 328 conditions per place. 
[2024-03-09 07:03:44,359 INFO  L140   encePairwiseOnDemand]: 121/128 looper letters, 14 selfloop transitions, 2 changer transitions 4/150 dead transitions.
[2024-03-09 07:03:44,359 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 150 transitions, 528 flow
[2024-03-09 07:03:44,360 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 07:03:44,360 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 07:03:44,361 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 669 transitions.
[2024-03-09 07:03:44,361 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.87109375
[2024-03-09 07:03:44,361 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 669 transitions.
[2024-03-09 07:03:44,361 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 669 transitions.
[2024-03-09 07:03:44,361 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 07:03:44,361 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 669 transitions.
[2024-03-09 07:03:44,363 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 111.5) internal successors, (669), 6 states have internal predecessors, (669), 0 states have call successors, (0), 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-09 07:03:44,364 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 128.0) internal successors, (896), 7 states have internal predecessors, (896), 0 states have call successors, (0), 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-09 07:03:44,364 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 128.0) internal successors, (896), 7 states have internal predecessors, (896), 0 states have call successors, (0), 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-09 07:03:44,364 INFO  L175             Difference]: Start difference. First operand has 138 places, 149 transitions, 500 flow. Second operand 6 states and 669 transitions.
[2024-03-09 07:03:44,364 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 150 transitions, 528 flow
[2024-03-09 07:03:44,369 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 150 transitions, 506 flow, removed 4 selfloop flow, removed 2 redundant places.
[2024-03-09 07:03:44,370 INFO  L231             Difference]: Finished difference. Result has 145 places, 146 transitions, 476 flow
[2024-03-09 07:03:44,370 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=476, PETRI_PLACES=145, PETRI_TRANSITIONS=146}
[2024-03-09 07:03:44,371 INFO  L281   CegarLoopForPetriNet]: 124 programPoint places, 21 predicate places.
[2024-03-09 07:03:44,371 INFO  L495      AbstractCegarLoop]: Abstraction has has 145 places, 146 transitions, 476 flow
[2024-03-09 07:03:44,371 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 109.4) internal successors, (547), 5 states have internal predecessors, (547), 0 states have call successors, (0), 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-09 07:03:44,371 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 07:03:44,371 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-09 07:03:44,371 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-03-09 07:03:44,371 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-03-09 07:03:44,372 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 07:03:44,372 INFO  L85        PathProgramCache]: Analyzing trace with hash 435508997, now seen corresponding path program 1 times
[2024-03-09 07:03:44,372 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 07:03:44,372 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76359691]
[2024-03-09 07:03:44,372 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 07:03:44,372 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 07:03:44,385 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 07:03:44,444 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-09 07:03:44,444 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 07:03:44,444 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76359691]
[2024-03-09 07:03:44,444 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76359691] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 07:03:44,444 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 07:03:44,445 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-03-09 07:03:44,445 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926988753]
[2024-03-09 07:03:44,445 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 07:03:44,445 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 07:03:44,445 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 07:03:44,445 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 07:03:44,446 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 07:03:44,450 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 115 out of 128
[2024-03-09 07:03:44,451 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 146 transitions, 476 flow. Second operand  has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 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-09 07:03:44,451 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 07:03:44,451 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 128
[2024-03-09 07:03:44,451 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 07:03:44,504 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([386] L1015-4-->L1015-1: Formula: (= |v_#race~ready~0_4| 0)  InVars {}  OutVars{#race~ready~0=|v_#race~ready~0_4|}  AuxVars[]  AssignedVars[#race~ready~0][83], [Black: 158#(= |#race~data~0| 0), Black: 129#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), 162#true, Black: 164#(= |ULTIMATE.start_main_~i~0#1| 0), 50#L1015-2true, Black: 165#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), Black: 168#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 136#(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: 166#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 174#true, Black: 137#(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: 135#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 133#true, 40#L1015-1true, Black: 144#true, Black: 152#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|), threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, 121#L1027-4true])
[2024-03-09 07:03:44,504 INFO  L294   olderBase$Statistics]: this new event has 77 ancestors and is cut-off event
[2024-03-09 07:03:44,504 INFO  L297   olderBase$Statistics]:   existing Event has 74 ancestors and is cut-off event
[2024-03-09 07:03:44,504 INFO  L297   olderBase$Statistics]:   existing Event has 74 ancestors and is cut-off event
[2024-03-09 07:03:44,504 INFO  L297   olderBase$Statistics]:   existing Event has 77 ancestors and is cut-off event
[2024-03-09 07:03:44,505 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([399] L1015-4-->L1015-1: Formula: (= |v_#race~ready~0_4| 0)  InVars {}  OutVars{#race~ready~0=|v_#race~ready~0_4|}  AuxVars[]  AssignedVars[#race~ready~0][121], [Black: 158#(= |#race~data~0| 0), Black: 129#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), 162#true, Black: 164#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 165#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), Black: 168#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 136#(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: 166#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 174#true, Black: 137#(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: 135#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 133#true, 25#L1015-2true, 74#L1015-1true, Black: 144#true, Black: 152#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|), threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, 121#L1027-4true])
[2024-03-09 07:03:44,505 INFO  L294   olderBase$Statistics]: this new event has 77 ancestors and is cut-off event
[2024-03-09 07:03:44,506 INFO  L297   olderBase$Statistics]:   existing Event has 74 ancestors and is cut-off event
[2024-03-09 07:03:44,506 INFO  L297   olderBase$Statistics]:   existing Event has 74 ancestors and is cut-off event
[2024-03-09 07:03:44,506 INFO  L297   olderBase$Statistics]:   existing Event has 77 ancestors and is cut-off event
[2024-03-09 07:03:44,511 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([386] L1015-4-->L1015-1: Formula: (= |v_#race~ready~0_4| 0)  InVars {}  OutVars{#race~ready~0=|v_#race~ready~0_4|}  AuxVars[]  AssignedVars[#race~ready~0][40], [113#L1028true, Black: 158#(= |#race~data~0| 0), Black: 129#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), 162#true, Black: 164#(= |ULTIMATE.start_main_~i~0#1| 0), 50#L1015-2true, Black: 165#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), Black: 168#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 136#(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: 166#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 174#true, Black: 137#(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: 135#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 133#true, 40#L1015-1true, Black: 144#true, Black: 152#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|), threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse])
[2024-03-09 07:03:44,511 INFO  L294   olderBase$Statistics]: this new event has 78 ancestors and is cut-off event
[2024-03-09 07:03:44,511 INFO  L297   olderBase$Statistics]:   existing Event has 75 ancestors and is cut-off event
[2024-03-09 07:03:44,511 INFO  L297   olderBase$Statistics]:   existing Event has 75 ancestors and is cut-off event
[2024-03-09 07:03:44,511 INFO  L297   olderBase$Statistics]:   existing Event has 78 ancestors and is cut-off event
[2024-03-09 07:03:44,516 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([399] L1015-4-->L1015-1: Formula: (= |v_#race~ready~0_4| 0)  InVars {}  OutVars{#race~ready~0=|v_#race~ready~0_4|}  AuxVars[]  AssignedVars[#race~ready~0][62], [113#L1028true, Black: 158#(= |#race~data~0| 0), Black: 129#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), 162#true, Black: 164#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 165#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), Black: 136#(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: 168#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 137#(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: 166#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 174#true, Black: 135#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 133#true, 25#L1015-2true, 74#L1015-1true, Black: 144#true, Black: 152#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|), threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse])
[2024-03-09 07:03:44,516 INFO  L294   olderBase$Statistics]: this new event has 78 ancestors and is cut-off event
[2024-03-09 07:03:44,516 INFO  L297   olderBase$Statistics]:   existing Event has 75 ancestors and is cut-off event
[2024-03-09 07:03:44,516 INFO  L297   olderBase$Statistics]:   existing Event has 78 ancestors and is cut-off event
[2024-03-09 07:03:44,516 INFO  L297   olderBase$Statistics]:   existing Event has 75 ancestors and is cut-off event
[2024-03-09 07:03:44,610 INFO  L124   PetriNetUnfolderBase]: 216/1962 cut-off events.
[2024-03-09 07:03:44,610 INFO  L125   PetriNetUnfolderBase]: For 369/524 co-relation queries the response was YES.
[2024-03-09 07:03:44,614 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2973 conditions, 1962 events. 216/1962 cut-off events. For 369/524 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 15899 event pairs, 32 based on Foata normal form. 9/1856 useless extension candidates. Maximal degree in co-relation 2905. Up to 214 conditions per place. 
[2024-03-09 07:03:44,620 INFO  L140   encePairwiseOnDemand]: 124/128 looper letters, 6 selfloop transitions, 2 changer transitions 0/134 dead transitions.
[2024-03-09 07:03:44,620 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 134 transitions, 434 flow
[2024-03-09 07:03:44,621 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 07:03:44,621 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 07:03:44,622 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 355 transitions.
[2024-03-09 07:03:44,622 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9244791666666666
[2024-03-09 07:03:44,622 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 355 transitions.
[2024-03-09 07:03:44,622 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 355 transitions.
[2024-03-09 07:03:44,622 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 07:03:44,622 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 355 transitions.
[2024-03-09 07:03:44,623 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 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-09 07:03:44,624 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 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-09 07:03:44,624 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 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-09 07:03:44,624 INFO  L175             Difference]: Start difference. First operand has 145 places, 146 transitions, 476 flow. Second operand 3 states and 355 transitions.
[2024-03-09 07:03:44,624 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 134 transitions, 434 flow
[2024-03-09 07:03:44,627 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 134 transitions, 412 flow, removed 9 selfloop flow, removed 5 redundant places.
[2024-03-09 07:03:44,629 INFO  L231             Difference]: Finished difference. Result has 137 places, 134 transitions, 406 flow
[2024-03-09 07:03:44,629 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=406, PETRI_PLACES=137, PETRI_TRANSITIONS=134}
[2024-03-09 07:03:44,629 INFO  L281   CegarLoopForPetriNet]: 124 programPoint places, 13 predicate places.
[2024-03-09 07:03:44,629 INFO  L495      AbstractCegarLoop]: Abstraction has has 137 places, 134 transitions, 406 flow
[2024-03-09 07:03:44,630 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 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-09 07:03:44,630 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 07:03:44,630 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]
[2024-03-09 07:03:44,630 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-03-09 07:03:44,630 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-03-09 07:03:44,630 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 07:03:44,630 INFO  L85        PathProgramCache]: Analyzing trace with hash -122984263, now seen corresponding path program 1 times
[2024-03-09 07:03:44,630 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 07:03:44,630 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173462038]
[2024-03-09 07:03:44,631 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 07:03:44,631 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 07:03:44,646 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-09 07:03:44,646 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-03-09 07:03:44,652 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-09 07:03:44,656 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-03-09 07:03:44,657 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-03-09 07:03:44,657 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (12 of 13 remaining)
[2024-03-09 07:03:44,657 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (11 of 13 remaining)
[2024-03-09 07:03:44,657 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (10 of 13 remaining)
[2024-03-09 07:03:44,657 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (9 of 13 remaining)
[2024-03-09 07:03:44,657 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (8 of 13 remaining)
[2024-03-09 07:03:44,657 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (7 of 13 remaining)
[2024-03-09 07:03:44,657 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (6 of 13 remaining)
[2024-03-09 07:03:44,657 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 13 remaining)
[2024-03-09 07:03:44,657 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 13 remaining)
[2024-03-09 07:03:44,658 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (3 of 13 remaining)
[2024-03-09 07:03:44,658 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 13 remaining)
[2024-03-09 07:03:44,658 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 13 remaining)
[2024-03-09 07:03:44,658 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (0 of 13 remaining)
[2024-03-09 07:03:44,658 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-03-09 07:03:44,658 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 07:03:44,662 INFO  L228   ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances
[2024-03-09 07:03:44,662 INFO  L178   ceAbstractionStarter]: Computing trace abstraction results
[2024-03-09 07:03:44,682 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-09 07:03:44,683 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~malloc4
[2024-03-09 07:03:44,683 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem7
[2024-03-09 07:03:44,683 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre6 could not be translated
[2024-03-09 07:03:44,683 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre6 could not be translated
[2024-03-09 07:03:44,683 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem7
[2024-03-09 07:03:44,684 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem7
[2024-03-09 07:03:44,684 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre6 could not be translated
[2024-03-09 07:03:44,684 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not
[2024-03-09 07:03:44,684 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet9 could not be translated
[2024-03-09 07:03:44,684 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet10 could not be translated
[2024-03-09 07:03:44,685 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet11 could not be translated
[2024-03-09 07:03:44,691 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 07:03:44 BasicIcfg
[2024-03-09 07:03:44,691 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-03-09 07:03:44,692 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2024-03-09 07:03:44,692 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2024-03-09 07:03:44,692 INFO  L274        PluginConnector]: Witness Printer initialized
[2024-03-09 07:03:44,692 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.03 07:03:41" (3/4) ...
[2024-03-09 07:03:44,694 INFO  L140         WitnessPrinter]: No result that supports witness generation found
[2024-03-09 07:03:44,694 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-03-09 07:03:44,695 INFO  L158              Benchmark]: Toolchain (without parser) took 4344.26ms. Allocated memory was 125.8MB in the beginning and 230.7MB in the end (delta: 104.9MB). Free memory was 86.1MB in the beginning and 69.2MB in the end (delta: 16.9MB). Peak memory consumption was 124.7MB. Max. memory is 16.1GB.
[2024-03-09 07:03:44,695 INFO  L158              Benchmark]: CDTParser took 0.15ms. Allocated memory is still 125.8MB. Free memory is still 93.0MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-03-09 07:03:44,695 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 383.57ms. Allocated memory is still 125.8MB. Free memory was 85.9MB in the beginning and 58.0MB in the end (delta: 27.9MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB.
[2024-03-09 07:03:44,695 INFO  L158              Benchmark]: Boogie Procedure Inliner took 42.13ms. Allocated memory is still 125.8MB. Free memory was 58.0MB in the beginning and 55.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-03-09 07:03:44,696 INFO  L158              Benchmark]: Boogie Preprocessor took 50.52ms. Allocated memory was 125.8MB in the beginning and 153.1MB in the end (delta: 27.3MB). Free memory was 55.3MB in the beginning and 122.0MB in the end (delta: -66.7MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB.
[2024-03-09 07:03:44,696 INFO  L158              Benchmark]: RCFGBuilder took 363.62ms. Allocated memory is still 153.1MB. Free memory was 121.9MB in the beginning and 109.5MB in the end (delta: 12.4MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB.
[2024-03-09 07:03:44,696 INFO  L158              Benchmark]: TraceAbstraction took 3497.01ms. Allocated memory was 153.1MB in the beginning and 230.7MB in the end (delta: 77.6MB). Free memory was 108.8MB in the beginning and 69.2MB in the end (delta: 39.7MB). Peak memory consumption was 117.7MB. Max. memory is 16.1GB.
[2024-03-09 07:03:44,696 INFO  L158              Benchmark]: Witness Printer took 2.55ms. Allocated memory is still 230.7MB. Free memory is still 69.2MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-03-09 07:03:44,697 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.15ms. Allocated memory is still 125.8MB. Free memory is still 93.0MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 383.57ms. Allocated memory is still 125.8MB. Free memory was 85.9MB in the beginning and 58.0MB in the end (delta: 27.9MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 42.13ms. Allocated memory is still 125.8MB. Free memory was 58.0MB in the beginning and 55.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 50.52ms. Allocated memory was 125.8MB in the beginning and 153.1MB in the end (delta: 27.3MB). Free memory was 55.3MB in the beginning and 122.0MB in the end (delta: -66.7MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB.
 * RCFGBuilder took 363.62ms. Allocated memory is still 153.1MB. Free memory was 121.9MB in the beginning and 109.5MB in the end (delta: 12.4MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB.
 * TraceAbstraction took 3497.01ms. Allocated memory was 153.1MB in the beginning and 230.7MB in the end (delta: 77.6MB). Free memory was 108.8MB in the beginning and 69.2MB in the end (delta: 39.7MB). Peak memory consumption was 117.7MB. Max. memory is 16.1GB.
 * Witness Printer took 2.55ms. Allocated memory is still 230.7MB. Free memory is still 69.2MB. There was no memory consumed. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator:
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: unknown boogie variable #t~malloc4
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: unknown boogie variable #t~mem7
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~pre6 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~pre6 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: unknown boogie variable #t~mem7
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: unknown boogie variable #t~mem7
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~pre6 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet9 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet10 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet11 could not be translated
  - GenericResult: Unfinished Backtranslation
    The program execution was not completely translated back.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - DataRaceFoundResult [Line: 1015]: Data race detected
[2024-03-09 07:03:44,709 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-09 07:03:44,709 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~malloc4
[2024-03-09 07:03:44,709 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre6 could not be translated
[2024-03-09 07:03:44,710 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem7
[2024-03-09 07:03:44,710 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem7
[2024-03-09 07:03:44,710 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre6 could not be translated
[2024-03-09 07:03:44,710 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre6 could not be translated
[2024-03-09 07:03:44,710 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem7
[2024-03-09 07:03:44,710 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not
[2024-03-09 07:03:44,710 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet9 could not be translated
[2024-03-09 07:03:44,711 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet10 could not be translated
[2024-03-09 07:03:44,711 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet11 could not be translated
[2024-03-09 07:03:44,718 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-03-09 07:03:44,718 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~malloc4
[2024-03-09 07:03:44,719 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem7
[2024-03-09 07:03:44,719 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre6 could not be translated
[2024-03-09 07:03:44,719 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre6 could not be translated
[2024-03-09 07:03:44,719 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem7
[2024-03-09 07:03:44,719 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem7
[2024-03-09 07:03:44,719 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre6 could not be translated
[2024-03-09 07:03:44,720 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not
[2024-03-09 07:03:44,720 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet10 could not be translated
[2024-03-09 07:03:44,720 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet9 could not be translated
[2024-03-09 07:03:44,720 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet11 could not be translated
    Data race detected
The following path leads to a data race: 
[L1012]               0  _Bool ready = 0;
         VAL             [ready=0]
[L1013]               0  int data = 0;
         VAL             [data=0, ready=0]
[L1020]               0  int threads_total = __VERIFIER_nondet_int();
         VAL             [data=0, ready=0, threads_total=1]
[L1021]  CALL         0  assume_abort_if_not(threads_total >= 0)
[L1009]  COND FALSE   0  !(!cond)
         VAL             [\old(cond)=1, cond=1, data=0, ready=0]
[L1021]  RET          0  assume_abort_if_not(threads_total >= 0)
[L1022]               0  pthread_t *tids = malloc(threads_total * sizeof(pthread_t));
         VAL             [data=0, ready=0, threads_total=1, tids={5:0}]
[L1022]               0  pthread_t *tids = malloc(threads_total * sizeof(pthread_t));
         VAL             [data=0, ready=0, threads_total=1, tids={5:0}]
[L1023]               0  int i = 0;
         VAL             [data=0, i=0, ready=0, threads_total=1, tids={5:0}]
[L1023]  COND TRUE    0  i < threads_total
         VAL             [data=0, i=0, ready=0, threads_total=1, tids={5:0}]
[L1024]  EXPR         0  \read(*tids)
         VAL             [data=0, i=0, ready=0, threads_total=1, tids={5:0}]
[L1024]  EXPR         0  tids[i]
         VAL             [data=0, i=0, ready=0, threads_total=1, tids={5:0}]
[L1024]  FCALL, FORK  0  pthread_create(&tids[i], ((void *)0), &thread, ((void *)0))
         VAL             [arg={0:0}, data=0, i=0, ready=0, threads_total=1, tids={5:0}]
[L1015]               1  !ready
         VAL             [arg={0:0}, arg={0:0}, data=0, ready=0]
[L1023]               0  i++
         VAL             [arg={0:0}, arg={0:0}, data=0, i=1, ready=0, threads_total=1, tids={5:0}]
[L1023]  COND FALSE   0  !(i < threads_total)
         VAL             [arg={0:0}, arg={0:0}, data=0, i=1, ready=0, threads_total=1, tids={5:0}]
[L1026]               0  data = __VERIFIER_nondet_int()
         VAL             [arg={0:0}, arg={0:0}, data=0, ready=0, threads_total=1, tids={5:0}]
[L1027]               0  ready = 1
         VAL             [arg={0:0}, arg={0:0}, data=0, ready=1, threads_total=1, tids={5:0}]
[L1015]               1  !ready
         VAL             [arg={0:0}, arg={0:0}, data=0, ready=1]

Now there is a data race on ~ready~0 between 
	C: ready = 1 [1027]
and
	C: !ready [1015]

  - UnprovableResult [Line: 1026]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1024]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1027]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1029]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1031]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1029]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1024]: Unable to prove that petrification did provide enough thread instances (tool internal message)
    Unable to prove that petrification did provide enough thread instances (tool internal message)
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1016]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
    CFG has 3 procedures, 120 locations, 11 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.3s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 125 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 49 mSDsluCounter, 6 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 66 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 188 IncrementalHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 66 mSolverCounterUnsat, 6 mSDtfsCounter, 188 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=385occurred in iteration=5, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 216 NumberOfCodeBlocks, 216 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 162 ConstructedInterpolants, 0 QuantifiedInterpolants, 251 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
  - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances
    CFG has 4 procedures, 132 locations, 13 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.1s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 248 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 134 mSDsluCounter, 82 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 59 mSDsCounter, 72 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 297 IncrementalHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 72 mSolverCounterUnsat, 23 mSDtfsCounter, 297 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=500occurred in iteration=5, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 322 NumberOfCodeBlocks, 322 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 261 ConstructedInterpolants, 0 QuantifiedInterpolants, 480 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 1/1 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
[2024-03-09 07:03:44,740 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---

Execution finished normally
Writing output log to file Ultimate.log
Writing human readable error path to file UltimateCounterExample.errorpath
Result:
FALSE
