./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-ext/14_spin2003.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-ext/14_spin2003.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/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 83bca07672f78100877a79a1440d2a8107bad3ebb200d176bee629abfa2ef706 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:04:52,789 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:04:52,868 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-01-09 21:04:52,876 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:04:52,876 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:04:52,907 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:04:52,909 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:04:52,909 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:04:52,909 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:04:52,910 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:04:52,911 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:04:52,911 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:04:52,911 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:04:52,911 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:04:52,912 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:04:52,912 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:04:52,912 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:04:52,912 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:04:52,912 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:04:52,913 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:04:52,913 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:04:52,913 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:04:52,913 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:04:52,913 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:04:52,913 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:04:52,913 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:04:52,913 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:04:52,913 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:04:52,913 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:04:52,914 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:04:52,914 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:04:52,914 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:04:52,914 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:04:52,915 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:04:52,915 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:04:52,915 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:04:52,915 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:04:52,915 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:04:52,915 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:04:52,915 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:04:52,915 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:04:52,915 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:04:52,916 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:04:52,916 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:04:52,916 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:04:52,916 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:04:52,916 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> /storage/repos/ultimate-jdk21/releaseScripts/default/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 -> 83bca07672f78100877a79a1440d2a8107bad3ebb200d176bee629abfa2ef706 [2025-01-09 21:04:53,201 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:04:53,209 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:04:53,212 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:04:53,213 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:04:53,214 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:04:53,215 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/14_spin2003.i [2025-01-09 21:04:54,479 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e51a90631/a7b19c1ae6614d16a13be74ff079b4b5/FLAG93d4a116e [2025-01-09 21:04:54,786 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:04:54,787 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/14_spin2003.i [2025-01-09 21:04:54,798 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e51a90631/a7b19c1ae6614d16a13be74ff079b4b5/FLAG93d4a116e [2025-01-09 21:04:54,811 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e51a90631/a7b19c1ae6614d16a13be74ff079b4b5 [2025-01-09 21:04:54,814 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:04:54,815 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:04:54,816 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:04:54,816 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:04:54,820 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:04:54,820 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:04:54" (1/1) ... [2025-01-09 21:04:54,821 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a15282b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:04:54, skipping insertion in model container [2025-01-09 21:04:54,821 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:04:54" (1/1) ... [2025-01-09 21:04:54,858 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:04:55,186 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:04:55,207 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:04:55,255 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:04:55,289 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:04:55,293 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:04:55 WrapperNode [2025-01-09 21:04:55,293 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:04:55,294 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:04:55,295 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:04:55,295 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:04:55,300 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:04:55" (1/1) ... [2025-01-09 21:04:55,311 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:04:55" (1/1) ... [2025-01-09 21:04:55,330 INFO L138 Inliner]: procedures = 161, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 49 [2025-01-09 21:04:55,330 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:04:55,331 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:04:55,332 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:04:55,332 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:04:55,337 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:04:55" (1/1) ... [2025-01-09 21:04:55,338 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:04:55" (1/1) ... [2025-01-09 21:04:55,340 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:04:55" (1/1) ... [2025-01-09 21:04:55,342 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:04:55" (1/1) ... [2025-01-09 21:04:55,347 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:04:55" (1/1) ... [2025-01-09 21:04:55,348 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:04:55" (1/1) ... [2025-01-09 21:04:55,351 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:04:55" (1/1) ... [2025-01-09 21:04:55,355 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:04:55" (1/1) ... [2025-01-09 21:04:55,356 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:04:55" (1/1) ... [2025-01-09 21:04:55,357 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:04:55,358 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:04:55,360 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:04:55,360 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:04:55,361 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:04:55" (1/1) ... [2025-01-09 21:04:55,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:04:55,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:04:55,393 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 21:04:55,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 21:04:55,414 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-01-09 21:04:55,415 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-01-09 21:04:55,415 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-09 21:04:55,415 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:04:55,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:04:55,415 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-09 21:04:55,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:04:55,415 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:04:55,416 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 21:04:55,529 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:04:55,531 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:04:55,627 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:04:55,627 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:04:55,644 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:04:55,644 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 21:04:55,644 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:04:55 BoogieIcfgContainer [2025-01-09 21:04:55,644 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:04:55,647 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:04:55,648 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:04:55,651 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:04:55,651 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:04:54" (1/3) ... [2025-01-09 21:04:55,652 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76b52d4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:04:55, skipping insertion in model container [2025-01-09 21:04:55,652 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:04:55" (2/3) ... [2025-01-09 21:04:55,652 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76b52d4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:04:55, skipping insertion in model container [2025-01-09 21:04:55,652 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:04:55" (3/3) ... [2025-01-09 21:04:55,653 INFO L128 eAbstractionObserver]: Analyzing ICFG 14_spin2003.i [2025-01-09 21:04:55,663 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:04:55,665 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 14_spin2003.i that has 2 procedures, 54 locations, 1 initial locations, 1 loop locations, and 3 error locations. [2025-01-09 21:04:55,665 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:04:55,714 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:04:55,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 56 transitions, 116 flow [2025-01-09 21:04:55,791 INFO L124 PetriNetUnfolderBase]: 2/63 cut-off events. [2025-01-09 21:04:55,793 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:04:55,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67 conditions, 63 events. 2/63 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 50 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2025-01-09 21:04:55,802 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 56 transitions, 116 flow [2025-01-09 21:04:55,805 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 56 transitions, 116 flow [2025-01-09 21:04:55,817 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:04:55,832 INFO L333 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, 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;@295ac9bc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:04:55,833 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-01-09 21:04:55,847 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:04:55,848 INFO L124 PetriNetUnfolderBase]: 0/36 cut-off events. [2025-01-09 21:04:55,848 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:04:55,848 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:04:55,849 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:04:55,849 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-09 21:04:55,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:04:55,854 INFO L85 PathProgramCache]: Analyzing trace with hash -510019553, now seen corresponding path program 1 times [2025-01-09 21:04:55,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:04:55,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012140496] [2025-01-09 21:04:55,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:04:55,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:04:55,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 21:04:55,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 21:04:55,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:04:55,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:04:55,964 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:04:55,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 21:04:55,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 21:04:55,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:04:55,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:04:56,011 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:04:56,014 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:04:56,016 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2025-01-09 21:04:56,017 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2025-01-09 21:04:56,017 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2025-01-09 21:04:56,018 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2025-01-09 21:04:56,018 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2025-01-09 21:04:56,018 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2025-01-09 21:04:56,018 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2025-01-09 21:04:56,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:04:56,019 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-01-09 21:04:56,022 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:04:56,022 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-09 21:04:56,058 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:04:56,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 87 transitions, 184 flow [2025-01-09 21:04:56,098 INFO L124 PetriNetUnfolderBase]: 4/101 cut-off events. [2025-01-09 21:04:56,100 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:04:56,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 101 events. 4/101 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 170 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 67. Up to 3 conditions per place. [2025-01-09 21:04:56,103 INFO L82 GeneralOperation]: Start removeDead. Operand has 88 places, 87 transitions, 184 flow [2025-01-09 21:04:56,105 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 88 places, 87 transitions, 184 flow [2025-01-09 21:04:56,107 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:04:56,108 INFO L333 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, 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;@295ac9bc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:04:56,109 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-01-09 21:04:56,124 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:04:56,124 INFO L124 PetriNetUnfolderBase]: 0/45 cut-off events. [2025-01-09 21:04:56,124 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:04:56,125 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:04:56,125 INFO L206 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] [2025-01-09 21:04:56,125 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-01-09 21:04:56,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:04:56,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1476467371, now seen corresponding path program 1 times [2025-01-09 21:04:56,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:04:56,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610684686] [2025-01-09 21:04:56,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:04:56,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:04:56,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 21:04:56,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 21:04:56,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:04:56,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:04:56,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:04:56,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:04:56,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610684686] [2025-01-09 21:04:56,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610684686] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:04:56,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:04:56,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:04:56,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31001305] [2025-01-09 21:04:56,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:04:56,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:04:56,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:04:56,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:04:56,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:04:56,348 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 87 [2025-01-09 21:04:56,351 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 87 transitions, 184 flow. Second operand has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:04:56,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:04:56,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 87 [2025-01-09 21:04:56,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:04:56,495 INFO L124 PetriNetUnfolderBase]: 57/327 cut-off events. [2025-01-09 21:04:56,496 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2025-01-09 21:04:56,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 492 conditions, 327 events. 57/327 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1630 event pairs, 37 based on Foata normal form. 110/392 useless extension candidates. Maximal degree in co-relation 383. Up to 109 conditions per place. [2025-01-09 21:04:56,505 INFO L140 encePairwiseOnDemand]: 75/87 looper letters, 18 selfloop transitions, 6 changer transitions 0/83 dead transitions. [2025-01-09 21:04:56,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 83 transitions, 229 flow [2025-01-09 21:04:56,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:04:56,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:04:56,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 225 transitions. [2025-01-09 21:04:56,521 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8620689655172413 [2025-01-09 21:04:56,523 INFO L175 Difference]: Start difference. First operand has 88 places, 87 transitions, 184 flow. Second operand 3 states and 225 transitions. [2025-01-09 21:04:56,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 83 transitions, 229 flow [2025-01-09 21:04:56,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 83 transitions, 229 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:04:56,536 INFO L231 Difference]: Finished difference. Result has 84 places, 80 transitions, 206 flow [2025-01-09 21:04:56,539 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=206, PETRI_PLACES=84, PETRI_TRANSITIONS=80} [2025-01-09 21:04:56,543 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, -4 predicate places. [2025-01-09 21:04:56,543 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 80 transitions, 206 flow [2025-01-09 21:04:56,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:04:56,544 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:04:56,544 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:04:56,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:04:56,545 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-01-09 21:04:56,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:04:56,545 INFO L85 PathProgramCache]: Analyzing trace with hash 221822750, now seen corresponding path program 1 times [2025-01-09 21:04:56,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:04:56,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420728167] [2025-01-09 21:04:56,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:04:56,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:04:56,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 21:04:56,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 21:04:56,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:04:56,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:04:56,569 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:04:56,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 21:04:56,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 21:04:56,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:04:56,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:04:56,599 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:04:56,601 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:04:56,601 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-01-09 21:04:56,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2025-01-09 21:04:56,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2025-01-09 21:04:56,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2025-01-09 21:04:56,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2025-01-09 21:04:56,603 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2025-01-09 21:04:56,603 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2025-01-09 21:04:56,603 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2025-01-09 21:04:56,603 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2025-01-09 21:04:56,604 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2025-01-09 21:04:56,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:04:56,604 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-09 21:04:56,604 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:04:56,605 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-09 21:04:56,644 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:04:56,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 118 transitions, 254 flow [2025-01-09 21:04:56,678 INFO L124 PetriNetUnfolderBase]: 6/139 cut-off events. [2025-01-09 21:04:56,681 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-01-09 21:04:56,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 139 events. 6/139 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 349 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 105. Up to 4 conditions per place. [2025-01-09 21:04:56,683 INFO L82 GeneralOperation]: Start removeDead. Operand has 119 places, 118 transitions, 254 flow [2025-01-09 21:04:56,684 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 118 transitions, 254 flow [2025-01-09 21:04:56,686 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:04:56,687 INFO L333 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, 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;@295ac9bc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:04:56,687 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-01-09 21:04:56,697 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:04:56,698 INFO L124 PetriNetUnfolderBase]: 0/45 cut-off events. [2025-01-09 21:04:56,698 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:04:56,698 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:04:56,698 INFO L206 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] [2025-01-09 21:04:56,698 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 9 more)] === [2025-01-09 21:04:56,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:04:56,699 INFO L85 PathProgramCache]: Analyzing trace with hash 849110519, now seen corresponding path program 1 times [2025-01-09 21:04:56,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:04:56,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567911716] [2025-01-09 21:04:56,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:04:56,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:04:56,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 21:04:56,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 21:04:56,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:04:56,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:04:56,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:04:56,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:04:56,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567911716] [2025-01-09 21:04:56,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567911716] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:04:56,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:04:56,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:04:56,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382720757] [2025-01-09 21:04:56,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:04:56,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:04:56,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:04:56,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:04:56,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:04:56,832 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 118 [2025-01-09 21:04:56,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 118 transitions, 254 flow. Second operand has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:04:56,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:04:56,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 118 [2025-01-09 21:04:56,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:04:57,218 INFO L124 PetriNetUnfolderBase]: 783/2639 cut-off events. [2025-01-09 21:04:57,218 INFO L125 PetriNetUnfolderBase]: For 427/427 co-relation queries the response was YES. [2025-01-09 21:04:57,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4215 conditions, 2639 events. 783/2639 cut-off events. For 427/427 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 22816 event pairs, 558 based on Foata normal form. 842/3085 useless extension candidates. Maximal degree in co-relation 3328. Up to 1091 conditions per place. [2025-01-09 21:04:57,247 INFO L140 encePairwiseOnDemand]: 101/118 looper letters, 27 selfloop transitions, 9 changer transitions 0/116 dead transitions. [2025-01-09 21:04:57,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 116 transitions, 334 flow [2025-01-09 21:04:57,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:04:57,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:04:57,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 307 transitions. [2025-01-09 21:04:57,251 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.867231638418079 [2025-01-09 21:04:57,252 INFO L175 Difference]: Start difference. First operand has 119 places, 118 transitions, 254 flow. Second operand 3 states and 307 transitions. [2025-01-09 21:04:57,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 116 transitions, 334 flow [2025-01-09 21:04:57,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 116 transitions, 330 flow, removed 2 selfloop flow, removed 0 redundant places. [2025-01-09 21:04:57,256 INFO L231 Difference]: Finished difference. Result has 113 places, 110 transitions, 290 flow [2025-01-09 21:04:57,257 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=290, PETRI_PLACES=113, PETRI_TRANSITIONS=110} [2025-01-09 21:04:57,258 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, -6 predicate places. [2025-01-09 21:04:57,259 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 110 transitions, 290 flow [2025-01-09 21:04:57,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:04:57,260 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:04:57,260 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-01-09 21:04:57,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:04:57,260 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 9 more)] === [2025-01-09 21:04:57,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:04:57,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1184563723, now seen corresponding path program 1 times [2025-01-09 21:04:57,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:04:57,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39485425] [2025-01-09 21:04:57,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:04:57,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:04:57,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 21:04:57,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 21:04:57,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:04:57,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:04:57,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:04:57,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:04:57,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39485425] [2025-01-09 21:04:57,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39485425] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:04:57,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:04:57,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:04:57,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450025813] [2025-01-09 21:04:57,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:04:57,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:04:57,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:04:57,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:04:57,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:04:57,355 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 118 [2025-01-09 21:04:57,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 110 transitions, 290 flow. Second operand has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:04:57,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:04:57,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 118 [2025-01-09 21:04:57,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:04:57,774 INFO L124 PetriNetUnfolderBase]: 1172/3570 cut-off events. [2025-01-09 21:04:57,775 INFO L125 PetriNetUnfolderBase]: For 1101/1137 co-relation queries the response was YES. [2025-01-09 21:04:57,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6840 conditions, 3570 events. 1172/3570 cut-off events. For 1101/1137 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 32015 event pairs, 677 based on Foata normal form. 0/3060 useless extension candidates. Maximal degree in co-relation 6741. Up to 1502 conditions per place. [2025-01-09 21:04:57,804 INFO L140 encePairwiseOnDemand]: 108/118 looper letters, 31 selfloop transitions, 13 changer transitions 0/126 dead transitions. [2025-01-09 21:04:57,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 126 transitions, 437 flow [2025-01-09 21:04:57,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:04:57,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:04:57,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 294 transitions. [2025-01-09 21:04:57,808 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8305084745762712 [2025-01-09 21:04:57,808 INFO L175 Difference]: Start difference. First operand has 113 places, 110 transitions, 290 flow. Second operand 3 states and 294 transitions. [2025-01-09 21:04:57,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 126 transitions, 437 flow [2025-01-09 21:04:57,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 126 transitions, 411 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:04:57,820 INFO L231 Difference]: Finished difference. Result has 115 places, 121 transitions, 384 flow [2025-01-09 21:04:57,820 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=384, PETRI_PLACES=115, PETRI_TRANSITIONS=121} [2025-01-09 21:04:57,822 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, -4 predicate places. [2025-01-09 21:04:57,823 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 121 transitions, 384 flow [2025-01-09 21:04:57,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:04:57,823 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:04:57,824 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:04:57,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:04:57,824 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 9 more)] === [2025-01-09 21:04:57,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:04:57,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1349475463, now seen corresponding path program 1 times [2025-01-09 21:04:57,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:04:57,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055461061] [2025-01-09 21:04:57,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:04:57,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:04:57,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 21:04:57,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 21:04:57,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:04:57,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:04:57,838 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:04:57,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 21:04:57,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 21:04:57,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:04:57,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:04:57,862 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:04:57,862 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:04:57,862 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2025-01-09 21:04:57,862 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (11 of 13 remaining) [2025-01-09 21:04:57,862 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (10 of 13 remaining) [2025-01-09 21:04:57,862 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (9 of 13 remaining) [2025-01-09 21:04:57,862 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 13 remaining) [2025-01-09 21:04:57,863 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (7 of 13 remaining) [2025-01-09 21:04:57,863 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (6 of 13 remaining) [2025-01-09 21:04:57,863 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (5 of 13 remaining) [2025-01-09 21:04:57,863 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (4 of 13 remaining) [2025-01-09 21:04:57,863 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (3 of 13 remaining) [2025-01-09 21:04:57,863 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (2 of 13 remaining) [2025-01-09 21:04:57,863 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 13 remaining) [2025-01-09 21:04:57,863 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (0 of 13 remaining) [2025-01-09 21:04:57,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:04:57,863 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-01-09 21:04:57,868 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:04:57,868 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-01-09 21:04:57,898 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:04:57,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 150 places, 149 transitions, 326 flow [2025-01-09 21:04:57,922 INFO L124 PetriNetUnfolderBase]: 8/177 cut-off events. [2025-01-09 21:04:57,922 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-01-09 21:04:57,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 177 events. 8/177 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 528 event pairs, 0 based on Foata normal form. 0/152 useless extension candidates. Maximal degree in co-relation 147. Up to 5 conditions per place. [2025-01-09 21:04:57,924 INFO L82 GeneralOperation]: Start removeDead. Operand has 150 places, 149 transitions, 326 flow [2025-01-09 21:04:57,927 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 150 places, 149 transitions, 326 flow [2025-01-09 21:04:57,928 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:04:57,932 INFO L333 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, 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;@295ac9bc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:04:57,932 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-01-09 21:04:57,936 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:04:57,936 INFO L124 PetriNetUnfolderBase]: 0/48 cut-off events. [2025-01-09 21:04:57,936 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 21:04:57,936 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:04:57,936 INFO L206 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] [2025-01-09 21:04:57,937 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-01-09 21:04:57,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:04:57,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1911398839, now seen corresponding path program 1 times [2025-01-09 21:04:57,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:04:57,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158710956] [2025-01-09 21:04:57,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:04:57,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:04:57,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 21:04:57,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 21:04:57,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:04:57,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:04:57,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:04:57,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:04:57,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158710956] [2025-01-09 21:04:57,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158710956] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:04:57,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:04:57,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:04:57,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474563105] [2025-01-09 21:04:57,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:04:57,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:04:57,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:04:57,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:04:57,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:04:58,060 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 149 [2025-01-09 21:04:58,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 149 transitions, 326 flow. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:04:58,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:04:58,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 149 [2025-01-09 21:04:58,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:05:00,201 INFO L124 PetriNetUnfolderBase]: 7395/19445 cut-off events. [2025-01-09 21:05:00,202 INFO L125 PetriNetUnfolderBase]: For 4630/4630 co-relation queries the response was YES. [2025-01-09 21:05:00,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32302 conditions, 19445 events. 7395/19445 cut-off events. For 4630/4630 co-relation queries the response was YES. Maximal size of possible extension queue 637. Compared 214871 event pairs, 5493 based on Foata normal form. 6058/22743 useless extension candidates. Maximal degree in co-relation 25149. Up to 9127 conditions per place. [2025-01-09 21:05:00,408 INFO L140 encePairwiseOnDemand]: 127/149 looper letters, 36 selfloop transitions, 12 changer transitions 0/149 dead transitions. [2025-01-09 21:05:00,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 149 transitions, 443 flow [2025-01-09 21:05:00,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:05:00,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:05:00,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 389 transitions. [2025-01-09 21:05:00,410 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8702460850111857 [2025-01-09 21:05:00,410 INFO L175 Difference]: Start difference. First operand has 150 places, 149 transitions, 326 flow. Second operand 3 states and 389 transitions. [2025-01-09 21:05:00,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 149 transitions, 443 flow [2025-01-09 21:05:00,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 149 transitions, 431 flow, removed 6 selfloop flow, removed 0 redundant places. [2025-01-09 21:05:00,415 INFO L231 Difference]: Finished difference. Result has 142 places, 140 transitions, 374 flow [2025-01-09 21:05:00,416 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=374, PETRI_PLACES=142, PETRI_TRANSITIONS=140} [2025-01-09 21:05:00,416 INFO L279 CegarLoopForPetriNet]: 150 programPoint places, -8 predicate places. [2025-01-09 21:05:00,416 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 140 transitions, 374 flow [2025-01-09 21:05:00,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:05:00,417 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:05:00,417 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-01-09 21:05:00,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:05:00,417 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-01-09 21:05:00,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:05:00,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1280261165, now seen corresponding path program 1 times [2025-01-09 21:05:00,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:05:00,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123813745] [2025-01-09 21:05:00,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:05:00,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:05:00,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 21:05:00,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 21:05:00,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:05:00,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:05:00,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:05:00,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:05:00,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123813745] [2025-01-09 21:05:00,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123813745] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:05:00,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:05:00,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:05:00,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505509680] [2025-01-09 21:05:00,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:05:00,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:05:00,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:05:00,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:05:00,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:05:00,524 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 149 [2025-01-09 21:05:00,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 140 transitions, 374 flow. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:05:00,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:05:00,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 149 [2025-01-09 21:05:00,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:05:02,770 INFO L124 PetriNetUnfolderBase]: 11941/28835 cut-off events. [2025-01-09 21:05:02,770 INFO L125 PetriNetUnfolderBase]: For 9738/10595 co-relation queries the response was YES. [2025-01-09 21:05:02,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57848 conditions, 28835 events. 11941/28835 cut-off events. For 9738/10595 co-relation queries the response was YES. Maximal size of possible extension queue 990. Compared 323204 event pairs, 7371 based on Foata normal form. 15/24818 useless extension candidates. Maximal degree in co-relation 57748. Up to 13802 conditions per place. [2025-01-09 21:05:03,095 INFO L140 encePairwiseOnDemand]: 136/149 looper letters, 43 selfloop transitions, 19 changer transitions 0/165 dead transitions. [2025-01-09 21:05:03,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 165 transitions, 598 flow [2025-01-09 21:05:03,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:05:03,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:05:03,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 372 transitions. [2025-01-09 21:05:03,099 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8322147651006712 [2025-01-09 21:05:03,099 INFO L175 Difference]: Start difference. First operand has 142 places, 140 transitions, 374 flow. Second operand 3 states and 372 transitions. [2025-01-09 21:05:03,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 165 transitions, 598 flow [2025-01-09 21:05:03,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 165 transitions, 560 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:05:03,169 INFO L231 Difference]: Finished difference. Result has 144 places, 157 transitions, 522 flow [2025-01-09 21:05:03,170 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=522, PETRI_PLACES=144, PETRI_TRANSITIONS=157} [2025-01-09 21:05:03,171 INFO L279 CegarLoopForPetriNet]: 150 programPoint places, -6 predicate places. [2025-01-09 21:05:03,172 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 157 transitions, 522 flow [2025-01-09 21:05:03,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:05:03,172 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:05:03,172 INFO L206 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] [2025-01-09 21:05:03,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:05:03,173 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-01-09 21:05:03,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:05:03,173 INFO L85 PathProgramCache]: Analyzing trace with hash -805513995, now seen corresponding path program 1 times [2025-01-09 21:05:03,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:05:03,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170062231] [2025-01-09 21:05:03,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:05:03,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:05:03,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 21:05:03,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 21:05:03,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:05:03,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:05:03,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:05:03,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:05:03,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170062231] [2025-01-09 21:05:03,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170062231] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:05:03,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:05:03,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:05:03,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295588182] [2025-01-09 21:05:03,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:05:03,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:05:03,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:05:03,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:05:03,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:05:03,367 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 149 [2025-01-09 21:05:03,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 157 transitions, 522 flow. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:05:03,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:05:03,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 149 [2025-01-09 21:05:03,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:05:06,025 INFO L124 PetriNetUnfolderBase]: 15835/37991 cut-off events. [2025-01-09 21:05:06,026 INFO L125 PetriNetUnfolderBase]: For 28313/30201 co-relation queries the response was YES. [2025-01-09 21:05:06,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87085 conditions, 37991 events. 15835/37991 cut-off events. For 28313/30201 co-relation queries the response was YES. Maximal size of possible extension queue 1327. Compared 441910 event pairs, 8895 based on Foata normal form. 23/32240 useless extension candidates. Maximal degree in co-relation 86963. Up to 17896 conditions per place. [2025-01-09 21:05:06,393 INFO L140 encePairwiseOnDemand]: 136/149 looper letters, 59 selfloop transitions, 19 changer transitions 0/183 dead transitions. [2025-01-09 21:05:06,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 183 transitions, 815 flow [2025-01-09 21:05:06,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:05:06,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:05:06,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 373 transitions. [2025-01-09 21:05:06,397 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8344519015659956 [2025-01-09 21:05:06,398 INFO L175 Difference]: Start difference. First operand has 144 places, 157 transitions, 522 flow. Second operand 3 states and 373 transitions. [2025-01-09 21:05:06,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 183 transitions, 815 flow [2025-01-09 21:05:06,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 183 transitions, 763 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:05:06,493 INFO L231 Difference]: Finished difference. Result has 146 places, 174 transitions, 686 flow [2025-01-09 21:05:06,493 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=484, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=686, PETRI_PLACES=146, PETRI_TRANSITIONS=174} [2025-01-09 21:05:06,494 INFO L279 CegarLoopForPetriNet]: 150 programPoint places, -4 predicate places. [2025-01-09 21:05:06,494 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 174 transitions, 686 flow [2025-01-09 21:05:06,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:05:06,494 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:05:06,494 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:05:06,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:05:06,495 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-01-09 21:05:06,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:05:06,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1217608694, now seen corresponding path program 1 times [2025-01-09 21:05:06,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:05:06,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917451483] [2025-01-09 21:05:06,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:05:06,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:05:06,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 21:05:06,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 21:05:06,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:05:06,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:05:06,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:05:06,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:05:06,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917451483] [2025-01-09 21:05:06,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917451483] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:05:06,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:05:06,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:05:06,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426362036] [2025-01-09 21:05:06,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:05:06,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:05:06,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:05:06,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:05:06,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:05:06,591 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 149 [2025-01-09 21:05:06,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 174 transitions, 686 flow. Second operand has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:05:06,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:05:06,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 149 [2025-01-09 21:05:06,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:05:10,924 INFO L124 PetriNetUnfolderBase]: 25435/56087 cut-off events. [2025-01-09 21:05:10,924 INFO L125 PetriNetUnfolderBase]: For 71798/73994 co-relation queries the response was YES. [2025-01-09 21:05:11,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146549 conditions, 56087 events. 25435/56087 cut-off events. For 71798/73994 co-relation queries the response was YES. Maximal size of possible extension queue 2077. Compared 650062 event pairs, 11736 based on Foata normal form. 56/46915 useless extension candidates. Maximal degree in co-relation 146440. Up to 26863 conditions per place. [2025-01-09 21:05:11,430 INFO L140 encePairwiseOnDemand]: 136/149 looper letters, 68 selfloop transitions, 41 changer transitions 0/216 dead transitions. [2025-01-09 21:05:11,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 216 transitions, 1167 flow [2025-01-09 21:05:11,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:05:11,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:05:11,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 371 transitions. [2025-01-09 21:05:11,432 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8299776286353467 [2025-01-09 21:05:11,432 INFO L175 Difference]: Start difference. First operand has 146 places, 174 transitions, 686 flow. Second operand 3 states and 371 transitions. [2025-01-09 21:05:11,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 216 transitions, 1167 flow [2025-01-09 21:05:11,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 216 transitions, 1059 flow, removed 24 selfloop flow, removed 2 redundant places. [2025-01-09 21:05:11,670 INFO L231 Difference]: Finished difference. Result has 148 places, 209 transitions, 1058 flow [2025-01-09 21:05:11,671 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=618, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1058, PETRI_PLACES=148, PETRI_TRANSITIONS=209} [2025-01-09 21:05:11,671 INFO L279 CegarLoopForPetriNet]: 150 programPoint places, -2 predicate places. [2025-01-09 21:05:11,671 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 209 transitions, 1058 flow [2025-01-09 21:05:11,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:05:11,671 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:05:11,672 INFO L206 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] [2025-01-09 21:05:11,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:05:11,672 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-01-09 21:05:11,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:05:11,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1084555396, now seen corresponding path program 1 times [2025-01-09 21:05:11,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:05:11,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689218307] [2025-01-09 21:05:11,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:05:11,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:05:11,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 21:05:11,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 21:05:11,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:05:11,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:05:11,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:05:11,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:05:11,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689218307] [2025-01-09 21:05:11,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689218307] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:05:11,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:05:11,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:05:11,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21966798] [2025-01-09 21:05:11,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:05:11,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:05:11,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:05:11,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:05:11,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:05:11,755 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 149 [2025-01-09 21:05:11,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 209 transitions, 1058 flow. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:05:11,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:05:11,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 149 [2025-01-09 21:05:11,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:05:15,649 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([498] L690-2-->L690-3: Formula: (= |v_thr1Thread3of4ForFork0_#t~nondet3#1_3| |v_#race~x~0_4|) InVars {thr1Thread3of4ForFork0_#t~nondet3#1=|v_thr1Thread3of4ForFork0_#t~nondet3#1_3|} OutVars{#race~x~0=|v_#race~x~0_4|, thr1Thread3of4ForFork0_#t~nondet3#1=|v_thr1Thread3of4ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~x~0][286], [75#L689-4true, Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), Black: 165#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 145#true, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 173#true, 17#L691-2true, 147#true, 7#L690-3true, 168#true, 98#L698-4true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|), 126#L689-4true]) [2025-01-09 21:05:15,650 INFO L294 olderBase$Statistics]: this new event has 73 ancestors and is cut-off event [2025-01-09 21:05:15,650 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-01-09 21:05:15,650 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-01-09 21:05:15,650 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-01-09 21:05:15,658 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([588] L690-2-->L690-3: Formula: (= |v_#race~x~0_4| |v_thr1Thread2of4ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of4ForFork0_#t~nondet3#1=|v_thr1Thread2of4ForFork0_#t~nondet3#1_3|} OutVars{thr1Thread2of4ForFork0_#t~nondet3#1=|v_thr1Thread2of4ForFork0_#t~nondet3#1_3|, #race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][285], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 83#L689-4true, Black: 165#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 145#true, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 173#true, 95#L690-3true, 17#L691-2true, 147#true, 168#true, 98#L698-4true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|), 126#L689-4true]) [2025-01-09 21:05:15,658 INFO L294 olderBase$Statistics]: this new event has 73 ancestors and is cut-off event [2025-01-09 21:05:15,659 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-01-09 21:05:15,659 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-01-09 21:05:15,659 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-01-09 21:05:15,685 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([558] L690-2-->L690-3: Formula: (= |v_#race~x~0_4| |v_thr1Thread1of4ForFork0_#t~nondet3#1_3|) InVars {thr1Thread1of4ForFork0_#t~nondet3#1=|v_thr1Thread1of4ForFork0_#t~nondet3#1_3|} OutVars{#race~x~0=|v_#race~x~0_4|, thr1Thread1of4ForFork0_#t~nondet3#1=|v_thr1Thread1of4ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~x~0][284], [75#L689-4true, Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 83#L689-4true, Black: 163#true, 145#true, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 173#true, 17#L691-2true, 147#true, 35#L690-3true, 168#true, 98#L698-4true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2025-01-09 21:05:15,686 INFO L294 olderBase$Statistics]: this new event has 73 ancestors and is cut-off event [2025-01-09 21:05:15,686 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-01-09 21:05:15,686 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-01-09 21:05:15,686 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-01-09 21:05:16,326 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([558] L690-2-->L690-3: Formula: (= |v_#race~x~0_4| |v_thr1Thread1of4ForFork0_#t~nondet3#1_3|) InVars {thr1Thread1of4ForFork0_#t~nondet3#1=|v_thr1Thread1of4ForFork0_#t~nondet3#1_3|} OutVars{#race~x~0=|v_#race~x~0_4|, thr1Thread1of4ForFork0_#t~nondet3#1=|v_thr1Thread1of4ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~x~0][284], [75#L689-4true, Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 9#L692-2true, 83#L689-4true, 145#true, Black: 163#true, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 173#true, 147#true, 35#L690-3true, 168#true, 98#L698-4true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2025-01-09 21:05:16,327 INFO L294 olderBase$Statistics]: this new event has 75 ancestors and is cut-off event [2025-01-09 21:05:16,327 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2025-01-09 21:05:16,327 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2025-01-09 21:05:16,327 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2025-01-09 21:05:16,352 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([588] L690-2-->L690-3: Formula: (= |v_#race~x~0_4| |v_thr1Thread2of4ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of4ForFork0_#t~nondet3#1=|v_thr1Thread2of4ForFork0_#t~nondet3#1_3|} OutVars{thr1Thread2of4ForFork0_#t~nondet3#1=|v_thr1Thread2of4ForFork0_#t~nondet3#1_3|, #race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][285], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 9#L692-2true, 83#L689-4true, Black: 165#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 145#true, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 173#true, 95#L690-3true, 147#true, 168#true, 98#L698-4true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|), 126#L689-4true]) [2025-01-09 21:05:16,353 INFO L294 olderBase$Statistics]: this new event has 75 ancestors and is cut-off event [2025-01-09 21:05:16,353 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2025-01-09 21:05:16,353 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2025-01-09 21:05:16,353 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2025-01-09 21:05:16,355 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([498] L690-2-->L690-3: Formula: (= |v_thr1Thread3of4ForFork0_#t~nondet3#1_3| |v_#race~x~0_4|) InVars {thr1Thread3of4ForFork0_#t~nondet3#1=|v_thr1Thread3of4ForFork0_#t~nondet3#1_3|} OutVars{#race~x~0=|v_#race~x~0_4|, thr1Thread3of4ForFork0_#t~nondet3#1=|v_thr1Thread3of4ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~x~0][286], [75#L689-4true, Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 9#L692-2true, Black: 165#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 145#true, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 173#true, 147#true, 7#L690-3true, 168#true, 98#L698-4true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|), 126#L689-4true]) [2025-01-09 21:05:16,355 INFO L294 olderBase$Statistics]: this new event has 75 ancestors and is cut-off event [2025-01-09 21:05:16,355 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2025-01-09 21:05:16,355 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2025-01-09 21:05:16,355 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2025-01-09 21:05:17,309 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([562] L691-->L691-1: Formula: (= |v_#race~x~0_7| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_7|} AuxVars[] AssignedVars[#race~x~0][295], [75#L689-4true, Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 83#L689-4true, Black: 165#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 145#true, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 17#L691-2true, 147#true, 143#L691-1true, 175#(= |#race~x~0| 0), 168#true, 98#L698-4true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2025-01-09 21:05:17,310 INFO L294 olderBase$Statistics]: this new event has 76 ancestors and is cut-off event [2025-01-09 21:05:17,310 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2025-01-09 21:05:17,310 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2025-01-09 21:05:17,310 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2025-01-09 21:05:17,355 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([498] L690-2-->L690-3: Formula: (= |v_thr1Thread3of4ForFork0_#t~nondet3#1_3| |v_#race~x~0_4|) InVars {thr1Thread3of4ForFork0_#t~nondet3#1=|v_thr1Thread3of4ForFork0_#t~nondet3#1_3|} OutVars{#race~x~0=|v_#race~x~0_4|, thr1Thread3of4ForFork0_#t~nondet3#1=|v_thr1Thread3of4ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~x~0][297], [75#L689-4true, Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), Black: 165#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 110#L690-4true, 145#true, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 173#true, 17#L691-2true, 147#true, 7#L690-3true, 168#true, 98#L698-4true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2025-01-09 21:05:17,355 INFO L294 olderBase$Statistics]: this new event has 78 ancestors and is cut-off event [2025-01-09 21:05:17,355 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-01-09 21:05:17,355 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-01-09 21:05:17,355 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-01-09 21:05:17,379 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([588] L690-2-->L690-3: Formula: (= |v_#race~x~0_4| |v_thr1Thread2of4ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of4ForFork0_#t~nondet3#1=|v_thr1Thread2of4ForFork0_#t~nondet3#1_3|} OutVars{thr1Thread2of4ForFork0_#t~nondet3#1=|v_thr1Thread2of4ForFork0_#t~nondet3#1_3|, #race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][296], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 83#L689-4true, Black: 165#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 110#L690-4true, 145#true, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 173#true, 95#L690-3true, 17#L691-2true, 147#true, 168#true, 98#L698-4true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2025-01-09 21:05:17,380 INFO L294 olderBase$Statistics]: this new event has 78 ancestors and is cut-off event [2025-01-09 21:05:17,380 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-01-09 21:05:17,380 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-01-09 21:05:17,380 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-01-09 21:05:17,703 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([562] L691-->L691-1: Formula: (= |v_#race~x~0_7| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_7|} AuxVars[] AssignedVars[#race~x~0][295], [75#L689-4true, Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 9#L692-2true, 83#L689-4true, Black: 165#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 145#true, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 147#true, 143#L691-1true, 175#(= |#race~x~0| 0), 168#true, 98#L698-4true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2025-01-09 21:05:17,703 INFO L294 olderBase$Statistics]: this new event has 78 ancestors and is cut-off event [2025-01-09 21:05:17,703 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-01-09 21:05:17,703 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-01-09 21:05:17,703 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-01-09 21:05:17,978 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([588] L690-2-->L690-3: Formula: (= |v_#race~x~0_4| |v_thr1Thread2of4ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of4ForFork0_#t~nondet3#1=|v_thr1Thread2of4ForFork0_#t~nondet3#1_3|} OutVars{thr1Thread2of4ForFork0_#t~nondet3#1=|v_thr1Thread2of4ForFork0_#t~nondet3#1_3|, #race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][296], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 9#L692-2true, 83#L689-4true, 110#L690-4true, Black: 165#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 145#true, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 173#true, 95#L690-3true, 147#true, 168#true, 98#L698-4true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2025-01-09 21:05:17,978 INFO L294 olderBase$Statistics]: this new event has 80 ancestors and is cut-off event [2025-01-09 21:05:17,978 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-01-09 21:05:17,978 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-01-09 21:05:17,978 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-01-09 21:05:18,035 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([498] L690-2-->L690-3: Formula: (= |v_thr1Thread3of4ForFork0_#t~nondet3#1_3| |v_#race~x~0_4|) InVars {thr1Thread3of4ForFork0_#t~nondet3#1=|v_thr1Thread3of4ForFork0_#t~nondet3#1_3|} OutVars{#race~x~0=|v_#race~x~0_4|, thr1Thread3of4ForFork0_#t~nondet3#1=|v_thr1Thread3of4ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~x~0][297], [75#L689-4true, Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 9#L692-2true, Black: 165#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 110#L690-4true, 145#true, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 173#true, 147#true, 7#L690-3true, 168#true, 98#L698-4true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2025-01-09 21:05:18,036 INFO L294 olderBase$Statistics]: this new event has 80 ancestors and is cut-off event [2025-01-09 21:05:18,036 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-01-09 21:05:18,036 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-01-09 21:05:18,036 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-01-09 21:05:18,511 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([588] L690-2-->L690-3: Formula: (= |v_#race~x~0_4| |v_thr1Thread2of4ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of4ForFork0_#t~nondet3#1=|v_thr1Thread2of4ForFork0_#t~nondet3#1_3|} OutVars{thr1Thread2of4ForFork0_#t~nondet3#1=|v_thr1Thread2of4ForFork0_#t~nondet3#1_3|, #race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][132], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 83#L689-4true, Black: 165#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 145#true, 47#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 173#true, 95#L690-3true, 147#true, 168#true, 98#L698-4true, 129#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2025-01-09 21:05:18,511 INFO L294 olderBase$Statistics]: this new event has 78 ancestors and is cut-off event [2025-01-09 21:05:18,511 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-01-09 21:05:18,511 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-01-09 21:05:18,511 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-01-09 21:05:19,423 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([588] L690-2-->L690-3: Formula: (= |v_#race~x~0_4| |v_thr1Thread2of4ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of4ForFork0_#t~nondet3#1=|v_thr1Thread2of4ForFork0_#t~nondet3#1_3|} OutVars{thr1Thread2of4ForFork0_#t~nondet3#1=|v_thr1Thread2of4ForFork0_#t~nondet3#1_3|, #race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][170], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), Black: 165#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 145#true, 63#L691-2true, 6#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 173#true, 95#L690-3true, 17#L691-2true, 147#true, 168#true, 98#L698-4true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2025-01-09 21:05:19,423 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2025-01-09 21:05:19,423 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-01-09 21:05:19,423 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-01-09 21:05:19,423 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-01-09 21:05:19,497 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([558] L690-2-->L690-3: Formula: (= |v_#race~x~0_4| |v_thr1Thread1of4ForFork0_#t~nondet3#1_3|) InVars {thr1Thread1of4ForFork0_#t~nondet3#1=|v_thr1Thread1of4ForFork0_#t~nondet3#1_3|} OutVars{#race~x~0=|v_#race~x~0_4|, thr1Thread1of4ForFork0_#t~nondet3#1=|v_thr1Thread1of4ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~x~0][172], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), Black: 163#true, 145#true, 6#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 173#true, 17#L691-2true, 147#true, 35#L690-3true, 168#true, 103#L691-2true, 98#L698-4true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2025-01-09 21:05:19,497 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2025-01-09 21:05:19,497 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-01-09 21:05:19,497 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-01-09 21:05:19,497 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-01-09 21:05:19,506 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([498] L690-2-->L690-3: Formula: (= |v_thr1Thread3of4ForFork0_#t~nondet3#1_3| |v_#race~x~0_4|) InVars {thr1Thread3of4ForFork0_#t~nondet3#1=|v_thr1Thread3of4ForFork0_#t~nondet3#1_3|} OutVars{#race~x~0=|v_#race~x~0_4|, thr1Thread3of4ForFork0_#t~nondet3#1=|v_thr1Thread3of4ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~x~0][200], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), Black: 165#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 145#true, 3#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 63#L691-2true, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 173#true, 17#L691-2true, 147#true, 7#L690-3true, 168#true, 98#L698-4true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2025-01-09 21:05:19,507 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2025-01-09 21:05:19,507 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-01-09 21:05:19,507 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-01-09 21:05:19,507 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-01-09 21:05:19,870 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([588] L690-2-->L690-3: Formula: (= |v_#race~x~0_4| |v_thr1Thread2of4ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of4ForFork0_#t~nondet3#1=|v_thr1Thread2of4ForFork0_#t~nondet3#1_3|} OutVars{thr1Thread2of4ForFork0_#t~nondet3#1=|v_thr1Thread2of4ForFork0_#t~nondet3#1_3|, #race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][170], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), Black: 165#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 88#L692-2true, 145#true, 6#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 173#true, 95#L690-3true, 17#L691-2true, 147#true, 168#true, 98#L698-4true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2025-01-09 21:05:19,871 INFO L294 olderBase$Statistics]: this new event has 83 ancestors and is cut-off event [2025-01-09 21:05:19,871 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-01-09 21:05:19,871 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-01-09 21:05:19,871 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-01-09 21:05:19,872 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([588] L690-2-->L690-3: Formula: (= |v_#race~x~0_4| |v_thr1Thread2of4ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of4ForFork0_#t~nondet3#1=|v_thr1Thread2of4ForFork0_#t~nondet3#1_3|} OutVars{thr1Thread2of4ForFork0_#t~nondet3#1=|v_thr1Thread2of4ForFork0_#t~nondet3#1_3|, #race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][170], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 9#L692-2true, Black: 165#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 145#true, 63#L691-2true, 6#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 173#true, 95#L690-3true, 147#true, 168#true, 98#L698-4true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2025-01-09 21:05:19,872 INFO L294 olderBase$Statistics]: this new event has 83 ancestors and is cut-off event [2025-01-09 21:05:19,872 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-01-09 21:05:19,872 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-01-09 21:05:19,872 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-01-09 21:05:19,945 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([558] L690-2-->L690-3: Formula: (= |v_#race~x~0_4| |v_thr1Thread1of4ForFork0_#t~nondet3#1_3|) InVars {thr1Thread1of4ForFork0_#t~nondet3#1=|v_thr1Thread1of4ForFork0_#t~nondet3#1_3|} OutVars{#race~x~0=|v_#race~x~0_4|, thr1Thread1of4ForFork0_#t~nondet3#1=|v_thr1Thread1of4ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~x~0][172], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 145#true, Black: 163#true, 6#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 173#true, 81#L692-2true, 17#L691-2true, 147#true, 35#L690-3true, 168#true, 98#L698-4true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2025-01-09 21:05:19,946 INFO L294 olderBase$Statistics]: this new event has 83 ancestors and is cut-off event [2025-01-09 21:05:19,946 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-01-09 21:05:19,946 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-01-09 21:05:19,946 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-01-09 21:05:19,946 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([558] L690-2-->L690-3: Formula: (= |v_#race~x~0_4| |v_thr1Thread1of4ForFork0_#t~nondet3#1_3|) InVars {thr1Thread1of4ForFork0_#t~nondet3#1=|v_thr1Thread1of4ForFork0_#t~nondet3#1_3|} OutVars{#race~x~0=|v_#race~x~0_4|, thr1Thread1of4ForFork0_#t~nondet3#1=|v_thr1Thread1of4ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~x~0][172], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 9#L692-2true, Black: 163#true, 145#true, 6#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 173#true, 147#true, 35#L690-3true, 168#true, 103#L691-2true, 98#L698-4true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2025-01-09 21:05:19,946 INFO L294 olderBase$Statistics]: this new event has 83 ancestors and is cut-off event [2025-01-09 21:05:19,946 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-01-09 21:05:19,946 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-01-09 21:05:19,946 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-01-09 21:05:19,955 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([498] L690-2-->L690-3: Formula: (= |v_thr1Thread3of4ForFork0_#t~nondet3#1_3| |v_#race~x~0_4|) InVars {thr1Thread3of4ForFork0_#t~nondet3#1=|v_thr1Thread3of4ForFork0_#t~nondet3#1_3|} OutVars{#race~x~0=|v_#race~x~0_4|, thr1Thread3of4ForFork0_#t~nondet3#1=|v_thr1Thread3of4ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~x~0][200], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), Black: 165#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 88#L692-2true, 145#true, 3#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 173#true, 17#L691-2true, 147#true, 7#L690-3true, 168#true, 98#L698-4true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2025-01-09 21:05:19,955 INFO L294 olderBase$Statistics]: this new event has 83 ancestors and is cut-off event [2025-01-09 21:05:19,955 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-01-09 21:05:19,955 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-01-09 21:05:19,955 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-01-09 21:05:19,959 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([498] L690-2-->L690-3: Formula: (= |v_thr1Thread3of4ForFork0_#t~nondet3#1_3| |v_#race~x~0_4|) InVars {thr1Thread3of4ForFork0_#t~nondet3#1=|v_thr1Thread3of4ForFork0_#t~nondet3#1_3|} OutVars{#race~x~0=|v_#race~x~0_4|, thr1Thread3of4ForFork0_#t~nondet3#1=|v_thr1Thread3of4ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~x~0][200], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 9#L692-2true, Black: 165#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 145#true, 3#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 63#L691-2true, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 173#true, 147#true, 7#L690-3true, 168#true, 98#L698-4true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2025-01-09 21:05:19,959 INFO L294 olderBase$Statistics]: this new event has 83 ancestors and is cut-off event [2025-01-09 21:05:19,959 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-01-09 21:05:19,959 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-01-09 21:05:19,959 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-01-09 21:05:20,429 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([562] L691-->L691-1: Formula: (= |v_#race~x~0_7| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_7|} AuxVars[] AssignedVars[#race~x~0][211], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), Black: 165#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 145#true, 6#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 151#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 149#true, 17#L691-2true, 147#true, 143#L691-1true, 175#(= |#race~x~0| 0), 168#true, 103#L691-2true, 98#L698-4true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2025-01-09 21:05:20,429 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2025-01-09 21:05:20,429 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-01-09 21:05:20,429 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-01-09 21:05:20,429 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-01-09 21:05:20,587 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([588] L690-2-->L690-3: Formula: (= |v_#race~x~0_4| |v_thr1Thread2of4ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of4ForFork0_#t~nondet3#1=|v_thr1Thread2of4ForFork0_#t~nondet3#1_3|} OutVars{thr1Thread2of4ForFork0_#t~nondet3#1=|v_thr1Thread2of4ForFork0_#t~nondet3#1_3|, #race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][170], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 9#L692-2true, Black: 165#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 88#L692-2true, 145#true, 6#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 173#true, 95#L690-3true, 147#true, 168#true, 98#L698-4true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2025-01-09 21:05:20,587 INFO L294 olderBase$Statistics]: this new event has 85 ancestors and is cut-off event [2025-01-09 21:05:20,587 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2025-01-09 21:05:20,587 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2025-01-09 21:05:20,587 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2025-01-09 21:05:20,654 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([558] L690-2-->L690-3: Formula: (= |v_#race~x~0_4| |v_thr1Thread1of4ForFork0_#t~nondet3#1_3|) InVars {thr1Thread1of4ForFork0_#t~nondet3#1=|v_thr1Thread1of4ForFork0_#t~nondet3#1_3|} OutVars{#race~x~0=|v_#race~x~0_4|, thr1Thread1of4ForFork0_#t~nondet3#1=|v_thr1Thread1of4ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~x~0][172], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 9#L692-2true, 145#true, Black: 163#true, 6#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 173#true, 81#L692-2true, 147#true, 35#L690-3true, 168#true, 98#L698-4true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2025-01-09 21:05:20,654 INFO L294 olderBase$Statistics]: this new event has 85 ancestors and is cut-off event [2025-01-09 21:05:20,654 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2025-01-09 21:05:20,654 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2025-01-09 21:05:20,655 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2025-01-09 21:05:20,662 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([498] L690-2-->L690-3: Formula: (= |v_thr1Thread3of4ForFork0_#t~nondet3#1_3| |v_#race~x~0_4|) InVars {thr1Thread3of4ForFork0_#t~nondet3#1=|v_thr1Thread3of4ForFork0_#t~nondet3#1_3|} OutVars{#race~x~0=|v_#race~x~0_4|, thr1Thread3of4ForFork0_#t~nondet3#1=|v_thr1Thread3of4ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~x~0][200], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 9#L692-2true, Black: 165#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 88#L692-2true, 145#true, 3#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 173#true, 147#true, 7#L690-3true, 168#true, 98#L698-4true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2025-01-09 21:05:20,662 INFO L294 olderBase$Statistics]: this new event has 85 ancestors and is cut-off event [2025-01-09 21:05:20,662 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2025-01-09 21:05:20,662 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2025-01-09 21:05:20,662 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2025-01-09 21:05:20,765 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([562] L691-->L691-1: Formula: (= |v_#race~x~0_7| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_7|} AuxVars[] AssignedVars[#race~x~0][211], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), Black: 165#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 145#true, 6#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 81#L692-2true, 17#L691-2true, 147#true, 143#L691-1true, 175#(= |#race~x~0| 0), 168#true, 98#L698-4true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2025-01-09 21:05:20,765 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2025-01-09 21:05:20,765 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-01-09 21:05:20,765 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-01-09 21:05:20,765 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-01-09 21:05:20,765 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([562] L691-->L691-1: Formula: (= |v_#race~x~0_7| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_7|} AuxVars[] AssignedVars[#race~x~0][211], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 9#L692-2true, Black: 165#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 145#true, 6#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 147#true, 143#L691-1true, 175#(= |#race~x~0| 0), 168#true, 103#L691-2true, 98#L698-4true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2025-01-09 21:05:20,765 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2025-01-09 21:05:20,766 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-01-09 21:05:20,766 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-01-09 21:05:20,766 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-01-09 21:05:21,060 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([562] L691-->L691-1: Formula: (= |v_#race~x~0_7| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_7|} AuxVars[] AssignedVars[#race~x~0][211], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 9#L692-2true, Black: 165#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 145#true, 6#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 81#L692-2true, 147#true, 143#L691-1true, 175#(= |#race~x~0| 0), 168#true, 98#L698-4true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2025-01-09 21:05:21,060 INFO L294 olderBase$Statistics]: this new event has 88 ancestors and is cut-off event [2025-01-09 21:05:21,060 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2025-01-09 21:05:21,060 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2025-01-09 21:05:21,060 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2025-01-09 21:05:22,002 INFO L124 PetriNetUnfolderBase]: 58260/134342 cut-off events. [2025-01-09 21:05:22,003 INFO L125 PetriNetUnfolderBase]: For 284868/290154 co-relation queries the response was YES. [2025-01-09 21:05:22,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 378714 conditions, 134342 events. 58260/134342 cut-off events. For 284868/290154 co-relation queries the response was YES. Maximal size of possible extension queue 4639. Compared 1776993 event pairs, 12497 based on Foata normal form. 113/110767 useless extension candidates. Maximal degree in co-relation 378586. Up to 37476 conditions per place. [2025-01-09 21:05:23,723 INFO L140 encePairwiseOnDemand]: 129/149 looper letters, 113 selfloop transitions, 84 changer transitions 0/302 dead transitions. [2025-01-09 21:05:23,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 302 transitions, 2179 flow [2025-01-09 21:05:23,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:05:23,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:05:23,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 375 transitions. [2025-01-09 21:05:23,725 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8389261744966443 [2025-01-09 21:05:23,726 INFO L175 Difference]: Start difference. First operand has 148 places, 209 transitions, 1058 flow. Second operand 3 states and 375 transitions. [2025-01-09 21:05:23,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 302 transitions, 2179 flow [2025-01-09 21:05:24,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 302 transitions, 2031 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:05:24,379 INFO L231 Difference]: Finished difference. Result has 150 places, 291 transitions, 2108 flow [2025-01-09 21:05:24,380 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=976, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2108, PETRI_PLACES=150, PETRI_TRANSITIONS=291} [2025-01-09 21:05:24,380 INFO L279 CegarLoopForPetriNet]: 150 programPoint places, 0 predicate places. [2025-01-09 21:05:24,380 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 291 transitions, 2108 flow [2025-01-09 21:05:24,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:05:24,381 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:05:24,381 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:05:24,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:05:24,381 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-01-09 21:05:24,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:05:24,382 INFO L85 PathProgramCache]: Analyzing trace with hash -2093688720, now seen corresponding path program 1 times [2025-01-09 21:05:24,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:05:24,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440821022] [2025-01-09 21:05:24,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:05:24,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:05:24,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 21:05:24,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 21:05:24,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:05:24,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:05:24,395 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:05:24,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 21:05:24,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 21:05:24,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:05:24,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:05:24,408 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:05:24,408 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:05:24,409 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2025-01-09 21:05:24,409 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (14 of 16 remaining) [2025-01-09 21:05:24,409 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining) [2025-01-09 21:05:24,409 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining) [2025-01-09 21:05:24,409 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining) [2025-01-09 21:05:24,409 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining) [2025-01-09 21:05:24,409 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (9 of 16 remaining) [2025-01-09 21:05:24,409 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 16 remaining) [2025-01-09 21:05:24,409 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (7 of 16 remaining) [2025-01-09 21:05:24,409 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (6 of 16 remaining) [2025-01-09 21:05:24,410 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining) [2025-01-09 21:05:24,410 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining) [2025-01-09 21:05:24,410 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining) [2025-01-09 21:05:24,410 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining) [2025-01-09 21:05:24,410 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining) [2025-01-09 21:05:24,410 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining) [2025-01-09 21:05:24,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:05:24,410 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-01-09 21:05:24,411 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:05:24,411 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-01-09 21:05:24,441 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:05:24,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 181 places, 180 transitions, 400 flow [2025-01-09 21:05:24,462 INFO L124 PetriNetUnfolderBase]: 10/215 cut-off events. [2025-01-09 21:05:24,463 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-01-09 21:05:24,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 241 conditions, 215 events. 10/215 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 724 event pairs, 0 based on Foata normal form. 0/184 useless extension candidates. Maximal degree in co-relation 190. Up to 6 conditions per place. [2025-01-09 21:05:24,465 INFO L82 GeneralOperation]: Start removeDead. Operand has 181 places, 180 transitions, 400 flow [2025-01-09 21:05:24,470 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 181 places, 180 transitions, 400 flow [2025-01-09 21:05:24,472 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:05:24,472 INFO L333 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, 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;@295ac9bc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:05:24,473 INFO L334 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2025-01-09 21:05:24,475 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:05:24,475 INFO L124 PetriNetUnfolderBase]: 0/45 cut-off events. [2025-01-09 21:05:24,476 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:05:24,476 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:05:24,476 INFO L206 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] [2025-01-09 21:05:24,476 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 15 more)] === [2025-01-09 21:05:24,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:05:24,477 INFO L85 PathProgramCache]: Analyzing trace with hash 776933883, now seen corresponding path program 1 times [2025-01-09 21:05:24,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:05:24,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727289407] [2025-01-09 21:05:24,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:05:24,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:05:24,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 21:05:24,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 21:05:24,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:05:24,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:05:24,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:05:24,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:05:24,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727289407] [2025-01-09 21:05:24,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727289407] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:05:24,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:05:24,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:05:24,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190246411] [2025-01-09 21:05:24,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:05:24,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:05:24,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:05:24,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:05:24,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:05:24,578 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 180 [2025-01-09 21:05:24,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 180 transitions, 400 flow. Second operand has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:05:24,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:05:24,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 180 [2025-01-09 21:05:24,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:05:35,219 INFO L124 PetriNetUnfolderBase]: 60315/134329 cut-off events. [2025-01-09 21:05:35,220 INFO L125 PetriNetUnfolderBase]: For 43154/43154 co-relation queries the response was YES. [2025-01-09 21:05:35,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 231019 conditions, 134329 events. 60315/134329 cut-off events. For 43154/43154 co-relation queries the response was YES. Maximal size of possible extension queue 3603. Compared 1714192 event pairs, 45993 based on Foata normal form. 42581/159557 useless extension candidates. Maximal degree in co-relation 178176. Up to 69791 conditions per place.