./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/pthread-race-challenges/per-thread-struct-in-array.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread-race-challenges/per-thread-struct-in-array.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 1efbfee867aa93c883ed542462d915cf6ce053f17d320bd1325ec563a2596804 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:10:58,492 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:10:58,544 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-04-29 11:10:58,549 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:10:58,549 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:10:58,569 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:10:58,570 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:10:58,570 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:10:58,571 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:10:58,571 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:10:58,571 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:10:58,572 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:10:58,572 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:10:58,572 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:10:58,572 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 11:10:58,572 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:10:58,572 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:10:58,572 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:10:58,572 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:10:58,573 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 11:10:58,573 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:10:58,573 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 11:10:58,573 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-04-29 11:10:58,573 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:10:58,573 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:10:58,573 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 11:10:58,573 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:10:58,573 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:10:58,573 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:10:58,574 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:10:58,574 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:10:58,574 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:10:58,574 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:10:58,574 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:10:58,574 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:10:58,574 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:10:58,575 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:10:58,575 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:10:58,575 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 11:10:58,575 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 11:10:58,575 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:10:58,575 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:10:58,575 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:10:58,575 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:10:58,575 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:10:58,575 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/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 -> 1efbfee867aa93c883ed542462d915cf6ce053f17d320bd1325ec563a2596804 [2025-04-29 11:10:58,780 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:10:58,786 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:10:58,789 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:10:58,789 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:10:58,790 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:10:58,791 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-race-challenges/per-thread-struct-in-array.c [2025-04-29 11:11:00,062 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1f3c06fa/5ff3e40197c3416c90014d46e833118c/FLAG26f2ce1c4 [2025-04-29 11:11:00,260 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:11:00,261 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-race-challenges/per-thread-struct-in-array.c [2025-04-29 11:11:00,262 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:11:00,262 WARN L117 ultiparseSymbolTable]: System include pthread.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:11:00,266 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1f3c06fa/5ff3e40197c3416c90014d46e833118c/FLAG26f2ce1c4 [2025-04-29 11:11:01,063 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1f3c06fa/5ff3e40197c3416c90014d46e833118c [2025-04-29 11:11:01,065 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:11:01,066 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:11:01,066 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:11:01,067 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:11:01,069 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:11:01,070 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:11:01" (1/1) ... [2025-04-29 11:11:01,072 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34fec481 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:11:01, skipping insertion in model container [2025-04-29 11:11:01,072 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:11:01" (1/1) ... [2025-04-29 11:11:01,084 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:11:01,222 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:11:01,230 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:11:01,254 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:11:01,264 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:11:01,265 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:11:01 WrapperNode [2025-04-29 11:11:01,265 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:11:01,265 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:11:01,266 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:11:01,266 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:11:01,270 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:11:01" (1/1) ... [2025-04-29 11:11:01,281 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:11:01" (1/1) ... [2025-04-29 11:11:01,297 INFO L138 Inliner]: procedures = 11, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 55 [2025-04-29 11:11:01,298 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:11:01,299 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:11:01,299 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:11:01,299 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:11:01,304 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:11:01" (1/1) ... [2025-04-29 11:11:01,306 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:11:01" (1/1) ... [2025-04-29 11:11:01,309 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:11:01" (1/1) ... [2025-04-29 11:11:01,310 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:11:01" (1/1) ... [2025-04-29 11:11:01,319 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:11:01" (1/1) ... [2025-04-29 11:11:01,320 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:11:01" (1/1) ... [2025-04-29 11:11:01,326 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:11:01" (1/1) ... [2025-04-29 11:11:01,326 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:11:01" (1/1) ... [2025-04-29 11:11:01,328 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:11:01" (1/1) ... [2025-04-29 11:11:01,332 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:11:01,336 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:11:01,336 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:11:01,336 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:11:01,337 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:11:01" (1/1) ... [2025-04-29 11:11:01,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:11:01,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:11:01,368 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-29 11:11:01,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-29 11:11:01,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-29 11:11:01,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 11:11:01,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:11:01,391 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:11:01,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-29 11:11:01,392 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-04-29 11:11:01,392 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-04-29 11:11:01,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-29 11:11:01,393 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-29 11:11:01,461 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:11:01,463 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:11:01,636 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-29 11:11:01,636 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:11:01,644 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:11:01,644 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 11:11:01,644 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:11:01 BoogieIcfgContainer [2025-04-29 11:11:01,644 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:11:01,646 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:11:01,646 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:11:01,649 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:11:01,650 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:11:01" (1/3) ... [2025-04-29 11:11:01,650 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@792da5ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:11:01, skipping insertion in model container [2025-04-29 11:11:01,651 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:11:01" (2/3) ... [2025-04-29 11:11:01,651 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@792da5ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:11:01, skipping insertion in model container [2025-04-29 11:11:01,651 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:11:01" (3/3) ... [2025-04-29 11:11:01,652 INFO L128 eAbstractionObserver]: Analyzing ICFG per-thread-struct-in-array.c [2025-04-29 11:11:01,661 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:11:01,663 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG per-thread-struct-in-array.c that has 2 procedures, 80 locations, 81 edges, 1 initial locations, 2 loop locations, and 3 error locations. [2025-04-29 11:11:01,663 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-29 11:11:01,711 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-04-29 11:11:01,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 82 transitions, 171 flow [2025-04-29 11:11:01,774 INFO L116 PetriNetUnfolderBase]: 2/112 cut-off events. [2025-04-29 11:11:01,777 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 11:11:01,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 112 events. 2/112 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 193 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 53. Up to 3 conditions per place. [2025-04-29 11:11:01,780 INFO L82 GeneralOperation]: Start removeDead. Operand has 83 places, 82 transitions, 171 flow [2025-04-29 11:11:01,782 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 82 transitions, 171 flow [2025-04-29 11:11:01,791 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:11:01,800 INFO L340 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;@59fb5049, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:11:01,800 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-29 11:11:01,809 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:11:01,810 INFO L116 PetriNetUnfolderBase]: 1/48 cut-off events. [2025-04-29 11:11:01,810 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:11:01,810 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:01,810 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] [2025-04-29 11:11:01,811 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-29 11:11:01,815 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:01,816 INFO L85 PathProgramCache]: Analyzing trace with hash 281933423, now seen corresponding path program 1 times [2025-04-29 11:11:01,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:01,821 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709613843] [2025-04-29 11:11:01,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:01,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:01,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-29 11:11:01,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-29 11:11:01,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:01,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:02,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:02,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:02,095 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709613843] [2025-04-29 11:11:02,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709613843] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:02,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:02,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:11:02,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447486381] [2025-04-29 11:11:02,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:02,102 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:11:02,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:02,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:11:02,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:11:02,198 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 82 [2025-04-29 11:11:02,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 82 transitions, 171 flow. Second operand has 5 states, 5 states have (on average 69.4) internal successors, (347), 5 states have internal predecessors, (347), 0 states have call successors, (0), 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-04-29 11:11:02,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:02,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 82 [2025-04-29 11:11:02,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:02,259 INFO L116 PetriNetUnfolderBase]: 1/118 cut-off events. [2025-04-29 11:11:02,262 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-29 11:11:02,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 118 events. 1/118 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 167 event pairs, 0 based on Foata normal form. 2/114 useless extension candidates. Maximal degree in co-relation 23. Up to 16 conditions per place. [2025-04-29 11:11:02,263 INFO L140 encePairwiseOnDemand]: 73/82 looper letters, 11 selfloop transitions, 2 changer transitions 6/86 dead transitions. [2025-04-29 11:11:02,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 86 transitions, 215 flow [2025-04-29 11:11:02,264 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:11:02,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:11:02,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 428 transitions. [2025-04-29 11:11:02,276 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8699186991869918 [2025-04-29 11:11:02,277 INFO L175 Difference]: Start difference. First operand has 83 places, 82 transitions, 171 flow. Second operand 6 states and 428 transitions. [2025-04-29 11:11:02,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 86 transitions, 215 flow [2025-04-29 11:11:02,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 86 transitions, 215 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:11:02,287 INFO L231 Difference]: Finished difference. Result has 92 places, 80 transitions, 185 flow [2025-04-29 11:11:02,289 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=185, PETRI_PLACES=92, PETRI_TRANSITIONS=80} [2025-04-29 11:11:02,291 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 9 predicate places. [2025-04-29 11:11:02,291 INFO L485 AbstractCegarLoop]: Abstraction has has 92 places, 80 transitions, 185 flow [2025-04-29 11:11:02,292 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 69.4) internal successors, (347), 5 states have internal predecessors, (347), 0 states have call successors, (0), 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-04-29 11:11:02,292 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:02,292 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] [2025-04-29 11:11:02,292 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:11:02,292 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-29 11:11:02,292 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:02,293 INFO L85 PathProgramCache]: Analyzing trace with hash 217789210, now seen corresponding path program 1 times [2025-04-29 11:11:02,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:02,293 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981910308] [2025-04-29 11:11:02,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:02,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:02,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-29 11:11:02,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-29 11:11:02,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:02,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:02,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:02,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:02,709 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981910308] [2025-04-29 11:11:02,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981910308] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:02,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:02,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:11:02,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374032379] [2025-04-29 11:11:02,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:02,710 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:11:02,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:02,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:11:02,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:11:02,815 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 82 [2025-04-29 11:11:02,816 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 80 transitions, 185 flow. Second operand has 6 states, 6 states have (on average 58.5) internal successors, (351), 6 states have internal predecessors, (351), 0 states have call successors, (0), 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-04-29 11:11:02,816 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:02,816 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 82 [2025-04-29 11:11:02,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:02,951 INFO L116 PetriNetUnfolderBase]: 70/349 cut-off events. [2025-04-29 11:11:02,953 INFO L117 PetriNetUnfolderBase]: For 25/28 co-relation queries the response was YES. [2025-04-29 11:11:02,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 576 conditions, 349 events. 70/349 cut-off events. For 25/28 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1681 event pairs, 35 based on Foata normal form. 0/316 useless extension candidates. Maximal degree in co-relation 487. Up to 150 conditions per place. [2025-04-29 11:11:02,956 INFO L140 encePairwiseOnDemand]: 71/82 looper letters, 23 selfloop transitions, 22 changer transitions 0/101 dead transitions. [2025-04-29 11:11:02,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 101 transitions, 317 flow [2025-04-29 11:11:02,957 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:11:02,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:11:02,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 388 transitions. [2025-04-29 11:11:02,960 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7886178861788617 [2025-04-29 11:11:02,962 INFO L175 Difference]: Start difference. First operand has 92 places, 80 transitions, 185 flow. Second operand 6 states and 388 transitions. [2025-04-29 11:11:02,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 101 transitions, 317 flow [2025-04-29 11:11:02,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 101 transitions, 303 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-04-29 11:11:02,965 INFO L231 Difference]: Finished difference. Result has 93 places, 101 transitions, 321 flow [2025-04-29 11:11:02,965 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=321, PETRI_PLACES=93, PETRI_TRANSITIONS=101} [2025-04-29 11:11:02,966 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 10 predicate places. [2025-04-29 11:11:02,966 INFO L485 AbstractCegarLoop]: Abstraction has has 93 places, 101 transitions, 321 flow [2025-04-29 11:11:02,966 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 58.5) internal successors, (351), 6 states have internal predecessors, (351), 0 states have call successors, (0), 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-04-29 11:11:02,967 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:02,967 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, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:11:02,967 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:11:02,967 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-29 11:11:02,967 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:02,968 INFO L85 PathProgramCache]: Analyzing trace with hash -358008177, now seen corresponding path program 1 times [2025-04-29 11:11:02,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:02,968 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400035249] [2025-04-29 11:11:02,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:02,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:02,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-29 11:11:02,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-29 11:11:02,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:02,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:03,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:03,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:03,212 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400035249] [2025-04-29 11:11:03,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400035249] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:03,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:03,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:11:03,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838923927] [2025-04-29 11:11:03,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:03,212 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:11:03,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:03,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:11:03,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:11:03,268 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 82 [2025-04-29 11:11:03,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 101 transitions, 321 flow. Second operand has 6 states, 6 states have (on average 64.0) internal successors, (384), 6 states have internal predecessors, (384), 0 states have call successors, (0), 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-04-29 11:11:03,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:03,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 82 [2025-04-29 11:11:03,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:03,415 INFO L116 PetriNetUnfolderBase]: 130/477 cut-off events. [2025-04-29 11:11:03,415 INFO L117 PetriNetUnfolderBase]: For 138/150 co-relation queries the response was YES. [2025-04-29 11:11:03,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1071 conditions, 477 events. 130/477 cut-off events. For 138/150 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2465 event pairs, 23 based on Foata normal form. 0/445 useless extension candidates. Maximal degree in co-relation 976. Up to 238 conditions per place. [2025-04-29 11:11:03,419 INFO L140 encePairwiseOnDemand]: 67/82 looper letters, 33 selfloop transitions, 48 changer transitions 8/144 dead transitions. [2025-04-29 11:11:03,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 144 transitions, 639 flow [2025-04-29 11:11:03,420 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:11:03,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:11:03,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 429 transitions. [2025-04-29 11:11:03,421 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8719512195121951 [2025-04-29 11:11:03,422 INFO L175 Difference]: Start difference. First operand has 93 places, 101 transitions, 321 flow. Second operand 6 states and 429 transitions. [2025-04-29 11:11:03,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 144 transitions, 639 flow [2025-04-29 11:11:03,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 144 transitions, 639 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:11:03,427 INFO L231 Difference]: Finished difference. Result has 103 places, 136 transitions, 693 flow [2025-04-29 11:11:03,427 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=693, PETRI_PLACES=103, PETRI_TRANSITIONS=136} [2025-04-29 11:11:03,428 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 20 predicate places. [2025-04-29 11:11:03,428 INFO L485 AbstractCegarLoop]: Abstraction has has 103 places, 136 transitions, 693 flow [2025-04-29 11:11:03,428 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 64.0) internal successors, (384), 6 states have internal predecessors, (384), 0 states have call successors, (0), 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-04-29 11:11:03,428 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:03,428 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:11:03,428 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:11:03,429 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-29 11:11:03,429 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:03,429 INFO L85 PathProgramCache]: Analyzing trace with hash 313813177, now seen corresponding path program 1 times [2025-04-29 11:11:03,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:03,429 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231644309] [2025-04-29 11:11:03,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:03,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:03,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-29 11:11:03,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-29 11:11:03,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:03,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:03,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:03,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:03,658 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231644309] [2025-04-29 11:11:03,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231644309] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:03,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:03,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:11:03,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631029631] [2025-04-29 11:11:03,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:03,658 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:11:03,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:03,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:11:03,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:11:03,749 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 82 [2025-04-29 11:11:03,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 136 transitions, 693 flow. Second operand has 6 states, 6 states have (on average 61.166666666666664) internal successors, (367), 6 states have internal predecessors, (367), 0 states have call successors, (0), 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-04-29 11:11:03,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:03,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 82 [2025-04-29 11:11:03,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:03,878 INFO L116 PetriNetUnfolderBase]: 142/505 cut-off events. [2025-04-29 11:11:03,878 INFO L117 PetriNetUnfolderBase]: For 464/492 co-relation queries the response was YES. [2025-04-29 11:11:03,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1574 conditions, 505 events. 142/505 cut-off events. For 464/492 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2810 event pairs, 10 based on Foata normal form. 0/496 useless extension candidates. Maximal degree in co-relation 1464. Up to 241 conditions per place. [2025-04-29 11:11:03,881 INFO L140 encePairwiseOnDemand]: 71/82 looper letters, 73 selfloop transitions, 25 changer transitions 13/164 dead transitions. [2025-04-29 11:11:03,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 164 transitions, 1076 flow [2025-04-29 11:11:03,882 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:11:03,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:11:03,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 397 transitions. [2025-04-29 11:11:03,883 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.806910569105691 [2025-04-29 11:11:03,883 INFO L175 Difference]: Start difference. First operand has 103 places, 136 transitions, 693 flow. Second operand 6 states and 397 transitions. [2025-04-29 11:11:03,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 164 transitions, 1076 flow [2025-04-29 11:11:03,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 164 transitions, 1058 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-04-29 11:11:03,894 INFO L231 Difference]: Finished difference. Result has 105 places, 151 transitions, 910 flow [2025-04-29 11:11:03,894 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=675, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=910, PETRI_PLACES=105, PETRI_TRANSITIONS=151} [2025-04-29 11:11:03,896 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 22 predicate places. [2025-04-29 11:11:03,896 INFO L485 AbstractCegarLoop]: Abstraction has has 105 places, 151 transitions, 910 flow [2025-04-29 11:11:03,896 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 61.166666666666664) internal successors, (367), 6 states have internal predecessors, (367), 0 states have call successors, (0), 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-04-29 11:11:03,896 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:03,896 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:11:03,897 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:11:03,897 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-29 11:11:03,897 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:03,897 INFO L85 PathProgramCache]: Analyzing trace with hash -850196485, now seen corresponding path program 1 times [2025-04-29 11:11:03,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:03,897 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147379842] [2025-04-29 11:11:03,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:03,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:03,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-04-29 11:11:03,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-04-29 11:11:03,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:03,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:11:03,919 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-29 11:11:03,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-04-29 11:11:03,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-04-29 11:11:03,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:03,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:11:03,955 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-29 11:11:03,955 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-29 11:11:03,956 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-04-29 11:11:03,958 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (3 of 5 remaining) [2025-04-29 11:11:03,959 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (2 of 5 remaining) [2025-04-29 11:11:03,959 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 5 remaining) [2025-04-29 11:11:03,959 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 5 remaining) [2025-04-29 11:11:03,960 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:11:03,960 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-04-29 11:11:03,962 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-29 11:11:03,962 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-29 11:11:03,976 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-29 11:11:03,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 100 transitions, 216 flow [2025-04-29 11:11:03,990 INFO L116 PetriNetUnfolderBase]: 4/192 cut-off events. [2025-04-29 11:11:03,991 INFO L117 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-04-29 11:11:03,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 192 events. 4/192 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 410 event pairs, 0 based on Foata normal form. 0/175 useless extension candidates. Maximal degree in co-relation 114. Up to 6 conditions per place. [2025-04-29 11:11:03,991 INFO L82 GeneralOperation]: Start removeDead. Operand has 102 places, 100 transitions, 216 flow [2025-04-29 11:11:03,992 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 100 transitions, 216 flow [2025-04-29 11:11:03,993 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:11:03,993 INFO L340 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;@59fb5049, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:11:03,993 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-29 11:11:03,996 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:11:03,996 INFO L116 PetriNetUnfolderBase]: 1/48 cut-off events. [2025-04-29 11:11:03,996 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:11:03,996 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:03,996 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] [2025-04-29 11:11:03,996 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-29 11:11:03,997 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:03,997 INFO L85 PathProgramCache]: Analyzing trace with hash -2123445421, now seen corresponding path program 1 times [2025-04-29 11:11:03,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:03,997 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984682297] [2025-04-29 11:11:03,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:03,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:04,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-29 11:11:04,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-29 11:11:04,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:04,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:04,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:04,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:04,048 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984682297] [2025-04-29 11:11:04,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984682297] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:04,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:04,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:11:04,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466439223] [2025-04-29 11:11:04,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:04,048 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:11:04,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:04,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:11:04,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:11:04,125 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 100 [2025-04-29 11:11:04,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 100 transitions, 216 flow. Second operand has 5 states, 5 states have (on average 85.4) internal successors, (427), 5 states have internal predecessors, (427), 0 states have call successors, (0), 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-04-29 11:11:04,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:04,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 100 [2025-04-29 11:11:04,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:04,169 INFO L116 PetriNetUnfolderBase]: 3/198 cut-off events. [2025-04-29 11:11:04,171 INFO L117 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-04-29 11:11:04,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 248 conditions, 198 events. 3/198 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 431 event pairs, 0 based on Foata normal form. 2/190 useless extension candidates. Maximal degree in co-relation 141. Up to 32 conditions per place. [2025-04-29 11:11:04,172 INFO L140 encePairwiseOnDemand]: 91/100 looper letters, 14 selfloop transitions, 2 changer transitions 6/105 dead transitions. [2025-04-29 11:11:04,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 105 transitions, 268 flow [2025-04-29 11:11:04,172 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:11:04,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:11:04,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 527 transitions. [2025-04-29 11:11:04,173 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8783333333333333 [2025-04-29 11:11:04,173 INFO L175 Difference]: Start difference. First operand has 102 places, 100 transitions, 216 flow. Second operand 6 states and 527 transitions. [2025-04-29 11:11:04,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 105 transitions, 268 flow [2025-04-29 11:11:04,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 105 transitions, 268 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:11:04,177 INFO L231 Difference]: Finished difference. Result has 111 places, 99 transitions, 234 flow [2025-04-29 11:11:04,178 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=234, PETRI_PLACES=111, PETRI_TRANSITIONS=99} [2025-04-29 11:11:04,178 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 9 predicate places. [2025-04-29 11:11:04,178 INFO L485 AbstractCegarLoop]: Abstraction has has 111 places, 99 transitions, 234 flow [2025-04-29 11:11:04,178 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 85.4) internal successors, (427), 5 states have internal predecessors, (427), 0 states have call successors, (0), 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-04-29 11:11:04,178 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:04,178 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] [2025-04-29 11:11:04,178 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:11:04,179 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-29 11:11:04,179 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:04,179 INFO L85 PathProgramCache]: Analyzing trace with hash 2107377662, now seen corresponding path program 1 times [2025-04-29 11:11:04,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:04,179 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043560575] [2025-04-29 11:11:04,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:04,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:04,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-29 11:11:04,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-29 11:11:04,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:04,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:04,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:04,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:04,384 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043560575] [2025-04-29 11:11:04,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043560575] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:04,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:04,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:11:04,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811391370] [2025-04-29 11:11:04,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:04,385 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:11:04,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:04,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:11:04,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:11:04,528 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 100 [2025-04-29 11:11:04,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 99 transitions, 234 flow. Second operand has 6 states, 6 states have (on average 70.5) internal successors, (423), 6 states have internal predecessors, (423), 0 states have call successors, (0), 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-04-29 11:11:04,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:04,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 100 [2025-04-29 11:11:04,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:04,911 INFO L116 PetriNetUnfolderBase]: 902/2602 cut-off events. [2025-04-29 11:11:04,912 INFO L117 PetriNetUnfolderBase]: For 180/186 co-relation queries the response was YES. [2025-04-29 11:11:04,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4377 conditions, 2602 events. 902/2602 cut-off events. For 180/186 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 19763 event pairs, 512 based on Foata normal form. 0/2364 useless extension candidates. Maximal degree in co-relation 3404. Up to 1384 conditions per place. [2025-04-29 11:11:04,928 INFO L140 encePairwiseOnDemand]: 85/100 looper letters, 31 selfloop transitions, 38 changer transitions 0/137 dead transitions. [2025-04-29 11:11:04,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 137 transitions, 453 flow [2025-04-29 11:11:04,928 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:11:04,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:11:04,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 483 transitions. [2025-04-29 11:11:04,931 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.805 [2025-04-29 11:11:04,931 INFO L175 Difference]: Start difference. First operand has 111 places, 99 transitions, 234 flow. Second operand 6 states and 483 transitions. [2025-04-29 11:11:04,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 137 transitions, 453 flow [2025-04-29 11:11:04,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 137 transitions, 441 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-04-29 11:11:04,936 INFO L231 Difference]: Finished difference. Result has 113 places, 136 transitions, 476 flow [2025-04-29 11:11:04,936 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=476, PETRI_PLACES=113, PETRI_TRANSITIONS=136} [2025-04-29 11:11:04,937 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 11 predicate places. [2025-04-29 11:11:04,938 INFO L485 AbstractCegarLoop]: Abstraction has has 113 places, 136 transitions, 476 flow [2025-04-29 11:11:04,938 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 70.5) internal successors, (423), 6 states have internal predecessors, (423), 0 states have call successors, (0), 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-04-29 11:11:04,938 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:04,938 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, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:11:04,938 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-29 11:11:04,938 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-29 11:11:04,939 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:04,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1154980451, now seen corresponding path program 1 times [2025-04-29 11:11:04,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:04,939 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604687435] [2025-04-29 11:11:04,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:04,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:04,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-29 11:11:04,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-29 11:11:04,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:04,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:05,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:05,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:05,144 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604687435] [2025-04-29 11:11:05,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604687435] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:05,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:05,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:11:05,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364897202] [2025-04-29 11:11:05,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:05,145 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:11:05,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:05,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:11:05,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:11:05,208 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 100 [2025-04-29 11:11:05,209 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 136 transitions, 476 flow. Second operand has 6 states, 6 states have (on average 76.0) internal successors, (456), 6 states have internal predecessors, (456), 0 states have call successors, (0), 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-04-29 11:11:05,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:05,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 100 [2025-04-29 11:11:05,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:05,707 INFO L116 PetriNetUnfolderBase]: 1866/4588 cut-off events. [2025-04-29 11:11:05,707 INFO L117 PetriNetUnfolderBase]: For 1539/1624 co-relation queries the response was YES. [2025-04-29 11:11:05,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10753 conditions, 4588 events. 1866/4588 cut-off events. For 1539/1624 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 36024 event pairs, 434 based on Foata normal form. 0/4289 useless extension candidates. Maximal degree in co-relation 8549. Up to 2580 conditions per place. [2025-04-29 11:11:05,732 INFO L140 encePairwiseOnDemand]: 81/100 looper letters, 63 selfloop transitions, 92 changer transitions 0/231 dead transitions. [2025-04-29 11:11:05,733 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 231 transitions, 1222 flow [2025-04-29 11:11:05,733 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:11:05,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:11:05,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 531 transitions. [2025-04-29 11:11:05,734 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.885 [2025-04-29 11:11:05,735 INFO L175 Difference]: Start difference. First operand has 113 places, 136 transitions, 476 flow. Second operand 6 states and 531 transitions. [2025-04-29 11:11:05,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 231 transitions, 1222 flow [2025-04-29 11:11:05,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 231 transitions, 1222 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:11:05,742 INFO L231 Difference]: Finished difference. Result has 123 places, 223 transitions, 1312 flow [2025-04-29 11:11:05,742 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1312, PETRI_PLACES=123, PETRI_TRANSITIONS=223} [2025-04-29 11:11:05,743 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 21 predicate places. [2025-04-29 11:11:05,743 INFO L485 AbstractCegarLoop]: Abstraction has has 123 places, 223 transitions, 1312 flow [2025-04-29 11:11:05,743 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 76.0) internal successors, (456), 6 states have internal predecessors, (456), 0 states have call successors, (0), 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-04-29 11:11:05,743 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:05,743 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:11:05,743 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-29 11:11:05,744 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-29 11:11:05,744 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:05,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1897723081, now seen corresponding path program 1 times [2025-04-29 11:11:05,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:05,744 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947971822] [2025-04-29 11:11:05,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:05,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:05,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-29 11:11:05,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-29 11:11:05,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:05,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:05,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:05,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:05,918 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947971822] [2025-04-29 11:11:05,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947971822] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:05,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:05,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:11:05,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14351796] [2025-04-29 11:11:05,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:05,919 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:11:05,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:05,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:11:05,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:11:06,027 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 100 [2025-04-29 11:11:06,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 223 transitions, 1312 flow. Second operand has 6 states, 6 states have (on average 73.16666666666667) internal successors, (439), 6 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:06,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:06,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 100 [2025-04-29 11:11:06,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:06,578 INFO L116 PetriNetUnfolderBase]: 2323/5522 cut-off events. [2025-04-29 11:11:06,578 INFO L117 PetriNetUnfolderBase]: For 5284/5444 co-relation queries the response was YES. [2025-04-29 11:11:06,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17444 conditions, 5522 events. 2323/5522 cut-off events. For 5284/5444 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 44218 event pairs, 290 based on Foata normal form. 2/5293 useless extension candidates. Maximal degree in co-relation 13989. Up to 3131 conditions per place. [2025-04-29 11:11:06,610 INFO L140 encePairwiseOnDemand]: 85/100 looper letters, 145 selfloop transitions, 76 changer transitions 0/296 dead transitions. [2025-04-29 11:11:06,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 296 transitions, 2246 flow [2025-04-29 11:11:06,610 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:11:06,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:11:06,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 494 transitions. [2025-04-29 11:11:06,612 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8233333333333334 [2025-04-29 11:11:06,612 INFO L175 Difference]: Start difference. First operand has 123 places, 223 transitions, 1312 flow. Second operand 6 states and 494 transitions. [2025-04-29 11:11:06,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 296 transitions, 2246 flow [2025-04-29 11:11:06,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 296 transitions, 2228 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-04-29 11:11:06,641 INFO L231 Difference]: Finished difference. Result has 133 places, 294 transitions, 2152 flow [2025-04-29 11:11:06,643 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=1294, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2152, PETRI_PLACES=133, PETRI_TRANSITIONS=294} [2025-04-29 11:11:06,643 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 31 predicate places. [2025-04-29 11:11:06,644 INFO L485 AbstractCegarLoop]: Abstraction has has 133 places, 294 transitions, 2152 flow [2025-04-29 11:11:06,645 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 73.16666666666667) internal successors, (439), 6 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:06,645 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:06,645 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:11:06,645 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-29 11:11:06,645 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-29 11:11:06,646 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:06,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1727947617, now seen corresponding path program 1 times [2025-04-29 11:11:06,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:06,646 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114755458] [2025-04-29 11:11:06,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:06,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:06,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-04-29 11:11:06,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-04-29 11:11:06,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:06,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:07,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:07,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:07,037 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114755458] [2025-04-29 11:11:07,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114755458] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:07,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:07,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-29 11:11:07,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324947888] [2025-04-29 11:11:07,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:07,038 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-29 11:11:07,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:07,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-29 11:11:07,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-29 11:11:07,584 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 100 [2025-04-29 11:11:07,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 294 transitions, 2152 flow. Second operand has 14 states, 14 states have (on average 61.857142857142854) internal successors, (866), 14 states have internal predecessors, (866), 0 states have call successors, (0), 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-04-29 11:11:07,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:07,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 100 [2025-04-29 11:11:07,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:08,819 INFO L116 PetriNetUnfolderBase]: 3298/7928 cut-off events. [2025-04-29 11:11:08,819 INFO L117 PetriNetUnfolderBase]: For 12552/12787 co-relation queries the response was YES. [2025-04-29 11:11:08,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27646 conditions, 7928 events. 3298/7928 cut-off events. For 12552/12787 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 67486 event pairs, 353 based on Foata normal form. 65/7687 useless extension candidates. Maximal degree in co-relation 23504. Up to 3811 conditions per place. [2025-04-29 11:11:08,877 INFO L140 encePairwiseOnDemand]: 74/100 looper letters, 229 selfloop transitions, 135 changer transitions 0/427 dead transitions. [2025-04-29 11:11:08,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 427 transitions, 3993 flow [2025-04-29 11:11:08,879 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-29 11:11:08,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-04-29 11:11:08,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1151 transitions. [2025-04-29 11:11:08,882 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6770588235294117 [2025-04-29 11:11:08,882 INFO L175 Difference]: Start difference. First operand has 133 places, 294 transitions, 2152 flow. Second operand 17 states and 1151 transitions. [2025-04-29 11:11:08,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 427 transitions, 3993 flow [2025-04-29 11:11:08,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 427 transitions, 3849 flow, removed 72 selfloop flow, removed 0 redundant places. [2025-04-29 11:11:08,936 INFO L231 Difference]: Finished difference. Result has 157 places, 353 transitions, 3118 flow [2025-04-29 11:11:08,936 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=2008, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=3118, PETRI_PLACES=157, PETRI_TRANSITIONS=353} [2025-04-29 11:11:08,937 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 55 predicate places. [2025-04-29 11:11:08,937 INFO L485 AbstractCegarLoop]: Abstraction has has 157 places, 353 transitions, 3118 flow [2025-04-29 11:11:08,937 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 61.857142857142854) internal successors, (866), 14 states have internal predecessors, (866), 0 states have call successors, (0), 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-04-29 11:11:08,937 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:08,937 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:11:08,937 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-29 11:11:08,938 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-29 11:11:08,938 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:08,938 INFO L85 PathProgramCache]: Analyzing trace with hash -597792845, now seen corresponding path program 1 times [2025-04-29 11:11:08,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:08,938 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165947403] [2025-04-29 11:11:08,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:08,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:08,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-04-29 11:11:08,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-04-29 11:11:08,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:08,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:09,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:09,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:09,211 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165947403] [2025-04-29 11:11:09,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165947403] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:09,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:09,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-29 11:11:09,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530710372] [2025-04-29 11:11:09,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:09,211 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-29 11:11:09,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:09,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-29 11:11:09,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-04-29 11:11:09,593 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 100 [2025-04-29 11:11:09,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 353 transitions, 3118 flow. Second operand has 14 states, 14 states have (on average 64.5) internal successors, (903), 14 states have internal predecessors, (903), 0 states have call successors, (0), 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-04-29 11:11:09,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:09,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 100 [2025-04-29 11:11:09,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:10,953 INFO L116 PetriNetUnfolderBase]: 3977/8910 cut-off events. [2025-04-29 11:11:10,954 INFO L117 PetriNetUnfolderBase]: For 20521/21071 co-relation queries the response was YES. [2025-04-29 11:11:10,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36130 conditions, 8910 events. 3977/8910 cut-off events. For 20521/21071 co-relation queries the response was YES. Maximal size of possible extension queue 400. Compared 74886 event pairs, 246 based on Foata normal form. 270/8945 useless extension candidates. Maximal degree in co-relation 31556. Up to 3183 conditions per place. [2025-04-29 11:11:11,006 INFO L140 encePairwiseOnDemand]: 78/100 looper letters, 366 selfloop transitions, 366 changer transitions 1/805 dead transitions. [2025-04-29 11:11:11,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 805 transitions, 8690 flow [2025-04-29 11:11:11,007 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-29 11:11:11,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-04-29 11:11:11,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1662 transitions. [2025-04-29 11:11:11,010 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7226086956521739 [2025-04-29 11:11:11,010 INFO L175 Difference]: Start difference. First operand has 157 places, 353 transitions, 3118 flow. Second operand 23 states and 1662 transitions. [2025-04-29 11:11:11,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 805 transitions, 8690 flow [2025-04-29 11:11:11,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 805 transitions, 8632 flow, removed 12 selfloop flow, removed 8 redundant places. [2025-04-29 11:11:11,080 INFO L231 Difference]: Finished difference. Result has 183 places, 671 transitions, 7920 flow [2025-04-29 11:11:11,080 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=3078, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=173, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=7920, PETRI_PLACES=183, PETRI_TRANSITIONS=671} [2025-04-29 11:11:11,081 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 81 predicate places. [2025-04-29 11:11:11,081 INFO L485 AbstractCegarLoop]: Abstraction has has 183 places, 671 transitions, 7920 flow [2025-04-29 11:11:11,081 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 64.5) internal successors, (903), 14 states have internal predecessors, (903), 0 states have call successors, (0), 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-04-29 11:11:11,081 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:11,082 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:11:11,082 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-29 11:11:11,083 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-29 11:11:11,083 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:11,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1470577801, now seen corresponding path program 2 times [2025-04-29 11:11:11,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:11,084 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391662378] [2025-04-29 11:11:11,084 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:11:11,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:11,091 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 55 statements into 1 equivalence classes. [2025-04-29 11:11:11,099 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-04-29 11:11:11,099 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:11:11,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:11,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:11,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:11,377 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391662378] [2025-04-29 11:11:11,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391662378] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:11,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:11,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-29 11:11:11,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757604154] [2025-04-29 11:11:11,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:11,377 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-29 11:11:11,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:11,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-29 11:11:11,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-04-29 11:11:11,863 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 100 [2025-04-29 11:11:11,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 671 transitions, 7920 flow. Second operand has 14 states, 14 states have (on average 61.857142857142854) internal successors, (866), 14 states have internal predecessors, (866), 0 states have call successors, (0), 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-04-29 11:11:11,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:11,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 100 [2025-04-29 11:11:11,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:13,636 INFO L116 PetriNetUnfolderBase]: 4544/10348 cut-off events. [2025-04-29 11:11:13,636 INFO L117 PetriNetUnfolderBase]: For 56563/57121 co-relation queries the response was YES. [2025-04-29 11:11:13,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52457 conditions, 10348 events. 4544/10348 cut-off events. For 56563/57121 co-relation queries the response was YES. Maximal size of possible extension queue 422. Compared 88687 event pairs, 327 based on Foata normal form. 179/10197 useless extension candidates. Maximal degree in co-relation 51344. Up to 4300 conditions per place. [2025-04-29 11:11:13,705 INFO L140 encePairwiseOnDemand]: 78/100 looper letters, 557 selfloop transitions, 371 changer transitions 0/1000 dead transitions. [2025-04-29 11:11:13,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 1000 transitions, 14068 flow [2025-04-29 11:11:13,705 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-29 11:11:13,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-04-29 11:11:13,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1429 transitions. [2025-04-29 11:11:13,709 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6804761904761905 [2025-04-29 11:11:13,709 INFO L175 Difference]: Start difference. First operand has 183 places, 671 transitions, 7920 flow. Second operand 21 states and 1429 transitions. [2025-04-29 11:11:13,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 1000 transitions, 14068 flow [2025-04-29 11:11:13,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 1000 transitions, 13844 flow, removed 106 selfloop flow, removed 6 redundant places. [2025-04-29 11:11:13,929 INFO L231 Difference]: Finished difference. Result has 204 places, 894 transitions, 12467 flow [2025-04-29 11:11:13,929 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=7696, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=671, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=183, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=413, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=12467, PETRI_PLACES=204, PETRI_TRANSITIONS=894} [2025-04-29 11:11:13,930 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 102 predicate places. [2025-04-29 11:11:13,930 INFO L485 AbstractCegarLoop]: Abstraction has has 204 places, 894 transitions, 12467 flow [2025-04-29 11:11:13,931 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 61.857142857142854) internal successors, (866), 14 states have internal predecessors, (866), 0 states have call successors, (0), 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-04-29 11:11:13,931 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:13,931 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:11:13,931 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-29 11:11:13,931 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-29 11:11:13,931 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:13,932 INFO L85 PathProgramCache]: Analyzing trace with hash -933869799, now seen corresponding path program 3 times [2025-04-29 11:11:13,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:13,932 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342691651] [2025-04-29 11:11:13,932 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:11:13,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:13,939 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 55 statements into 3 equivalence classes. [2025-04-29 11:11:13,960 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 55 of 55 statements. [2025-04-29 11:11:13,961 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-29 11:11:13,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:14,523 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:14,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:14,523 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342691651] [2025-04-29 11:11:14,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342691651] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:11:14,523 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309707182] [2025-04-29 11:11:14,524 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:11:14,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:11:14,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:11:14,526 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:11:14,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-29 11:11:14,572 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 55 statements into 3 equivalence classes. [2025-04-29 11:11:14,627 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 55 of 55 statements. [2025-04-29 11:11:14,627 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-29 11:11:14,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:14,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-04-29 11:11:14,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:11:14,898 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-04-29 11:11:14,941 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2025-04-29 11:11:14,989 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:11:14,989 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2025-04-29 11:11:15,041 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:11:15,041 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2025-04-29 11:11:15,192 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:11:15,193 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:11:15,194 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:11:15,195 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:11:15,197 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:11:15,197 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 60 [2025-04-29 11:11:15,240 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:15,240 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:12:04,078 INFO L172 IndexEqualityManager]: detected equality via solver Killed by 15