./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/pthread-race-challenges/thread-join-array-dynamic-race-2.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/thread-join-array-dynamic-race-2.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 8693189b466e1b7e5f63422c3d85e5cfcbb448c6c6220bdf908ac17e0cc9bfa7 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:11:44,674 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:11:44,724 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-04-29 11:11:44,729 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:11:44,729 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:11:44,753 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:11:44,753 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:11:44,754 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:11:44,754 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:11:44,754 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:11:44,754 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:11:44,755 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:11:44,755 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:11:44,755 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:11:44,756 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 11:11:44,756 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:11:44,756 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:11:44,756 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:11:44,756 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:11:44,756 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 11:11:44,756 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:11:44,756 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 11:11:44,756 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-04-29 11:11:44,756 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:11:44,756 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:11:44,757 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 11:11:44,757 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:11:44,757 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:11:44,757 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:11:44,757 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:11:44,757 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:11:44,757 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:11:44,757 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:11:44,758 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:11:44,758 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:11:44,758 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:11:44,758 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:11:44,758 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:11:44,758 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 11:11:44,758 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 11:11:44,758 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:11:44,758 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:11:44,758 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:11:44,758 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:11:44,759 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:11:44,759 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 -> 8693189b466e1b7e5f63422c3d85e5cfcbb448c6c6220bdf908ac17e0cc9bfa7 [2025-04-29 11:11:44,998 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:11:45,007 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:11:45,009 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:11:45,010 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:11:45,010 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:11:45,011 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-race-challenges/thread-join-array-dynamic-race-2.c [2025-04-29 11:11:46,288 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72d0ac32f/5f45b891cac549c892447939a22def7d/FLAG2f398b840 [2025-04-29 11:11:46,487 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:11:46,487 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-race-challenges/thread-join-array-dynamic-race-2.c [2025-04-29 11:11:46,500 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:46,502 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:46,520 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72d0ac32f/5f45b891cac549c892447939a22def7d/FLAG2f398b840 [2025-04-29 11:11:47,289 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72d0ac32f/5f45b891cac549c892447939a22def7d [2025-04-29 11:11:47,292 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:11:47,293 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:11:47,293 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:11:47,293 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:11:47,298 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:11:47,301 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:11:47" (1/1) ... [2025-04-29 11:11:47,301 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d43c06a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:11:47, skipping insertion in model container [2025-04-29 11:11:47,302 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:11:47" (1/1) ... [2025-04-29 11:11:47,314 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:11:47,448 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:11:47,456 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:11:47,482 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:11:47,498 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:11:47,499 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:11:47 WrapperNode [2025-04-29 11:11:47,499 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:11:47,500 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:11:47,500 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:11:47,500 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:11:47,504 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:47" (1/1) ... [2025-04-29 11:11:47,510 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:47" (1/1) ... [2025-04-29 11:11:47,527 INFO L138 Inliner]: procedures = 15, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 55 [2025-04-29 11:11:47,528 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:11:47,529 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:11:47,529 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:11:47,529 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:11:47,534 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:47" (1/1) ... [2025-04-29 11:11:47,535 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:47" (1/1) ... [2025-04-29 11:11:47,536 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:47" (1/1) ... [2025-04-29 11:11:47,538 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:47" (1/1) ... [2025-04-29 11:11:47,548 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:47" (1/1) ... [2025-04-29 11:11:47,549 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:47" (1/1) ... [2025-04-29 11:11:47,551 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:47" (1/1) ... [2025-04-29 11:11:47,551 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:47" (1/1) ... [2025-04-29 11:11:47,552 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:47" (1/1) ... [2025-04-29 11:11:47,554 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:11:47,555 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:11:47,555 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:11:47,555 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:11:47,556 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:11:47" (1/1) ... [2025-04-29 11:11:47,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:11:47,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:11:47,580 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:47,583 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:47,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-29 11:11:47,600 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-29 11:11:47,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-29 11:11:47,600 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-04-29 11:11:47,600 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-04-29 11:11:47,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-29 11:11:47,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 11:11:47,600 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-29 11:11:47,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:11:47,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:11:47,600 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-29 11:11:47,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-29 11:11:47,601 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:47,674 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:11:47,675 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:11:47,856 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-29 11:11:47,856 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:11:47,874 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:11:47,874 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 11:11:47,874 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:11:47 BoogieIcfgContainer [2025-04-29 11:11:47,874 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:11:47,876 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:11:47,876 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:11:47,879 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:11:47,879 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:11:47" (1/3) ... [2025-04-29 11:11:47,880 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@629a9ec4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:11:47, skipping insertion in model container [2025-04-29 11:11:47,880 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:11:47" (2/3) ... [2025-04-29 11:11:47,880 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@629a9ec4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:11:47, skipping insertion in model container [2025-04-29 11:11:47,880 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:11:47" (3/3) ... [2025-04-29 11:11:47,881 INFO L128 eAbstractionObserver]: Analyzing ICFG thread-join-array-dynamic-race-2.c [2025-04-29 11:11:47,891 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:11:47,893 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG thread-join-array-dynamic-race-2.c that has 2 procedures, 81 locations, 82 edges, 1 initial locations, 2 loop locations, and 4 error locations. [2025-04-29 11:11:47,893 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-29 11:11:47,942 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-04-29 11:11:47,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 84 places, 83 transitions, 173 flow [2025-04-29 11:11:48,011 INFO L116 PetriNetUnfolderBase]: 2/115 cut-off events. [2025-04-29 11:11:48,012 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 11:11:48,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 115 events. 2/115 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 209 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 56. Up to 3 conditions per place. [2025-04-29 11:11:48,015 INFO L82 GeneralOperation]: Start removeDead. Operand has 84 places, 83 transitions, 173 flow [2025-04-29 11:11:48,017 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 84 places, 83 transitions, 173 flow [2025-04-29 11:11:48,026 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:11:48,033 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;@45ac2c5f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:11:48,033 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-29 11:11:48,041 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:11:48,042 INFO L116 PetriNetUnfolderBase]: 1/42 cut-off events. [2025-04-29 11:11:48,042 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:11:48,042 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:48,042 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] [2025-04-29 11:11:48,043 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-04-29 11:11:48,047 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:48,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1662304589, now seen corresponding path program 1 times [2025-04-29 11:11:48,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:48,053 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286105811] [2025-04-29 11:11:48,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:48,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:48,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-29 11:11:48,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-29 11:11:48,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:48,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:48,199 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:48,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:48,202 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286105811] [2025-04-29 11:11:48,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286105811] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:48,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:48,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:11:48,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962388905] [2025-04-29 11:11:48,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:48,209 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:11:48,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:48,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:11:48,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:11:48,248 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 83 [2025-04-29 11:11:48,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 83 transitions, 173 flow. Second operand has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 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:48,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:48,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 83 [2025-04-29 11:11:48,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:48,316 INFO L116 PetriNetUnfolderBase]: 8/157 cut-off events. [2025-04-29 11:11:48,320 INFO L117 PetriNetUnfolderBase]: For 4/7 co-relation queries the response was YES. [2025-04-29 11:11:48,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 191 conditions, 157 events. 8/157 cut-off events. For 4/7 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 413 event pairs, 1 based on Foata normal form. 1/141 useless extension candidates. Maximal degree in co-relation 122. Up to 16 conditions per place. [2025-04-29 11:11:48,321 INFO L140 encePairwiseOnDemand]: 78/83 looper letters, 8 selfloop transitions, 3 changer transitions 2/86 dead transitions. [2025-04-29 11:11:48,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 86 transitions, 203 flow [2025-04-29 11:11:48,322 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:11:48,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:11:48,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 236 transitions. [2025-04-29 11:11:48,334 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9477911646586346 [2025-04-29 11:11:48,336 INFO L175 Difference]: Start difference. First operand has 84 places, 83 transitions, 173 flow. Second operand 3 states and 236 transitions. [2025-04-29 11:11:48,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 86 transitions, 203 flow [2025-04-29 11:11:48,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 86 transitions, 203 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:11:48,348 INFO L231 Difference]: Finished difference. Result has 88 places, 83 transitions, 191 flow [2025-04-29 11:11:48,350 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=191, PETRI_PLACES=88, PETRI_TRANSITIONS=83} [2025-04-29 11:11:48,353 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 4 predicate places. [2025-04-29 11:11:48,353 INFO L485 AbstractCegarLoop]: Abstraction has has 88 places, 83 transitions, 191 flow [2025-04-29 11:11:48,354 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 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:48,354 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:48,354 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] [2025-04-29 11:11:48,354 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:11:48,354 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-04-29 11:11:48,355 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:48,355 INFO L85 PathProgramCache]: Analyzing trace with hash 542770031, now seen corresponding path program 1 times [2025-04-29 11:11:48,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:48,355 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590940212] [2025-04-29 11:11:48,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:48,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:48,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-29 11:11:48,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-29 11:11:48,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:48,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:48,858 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:48,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:48,859 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590940212] [2025-04-29 11:11:48,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590940212] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:48,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:48,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:11:48,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697164297] [2025-04-29 11:11:48,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:48,861 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:11:48,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:48,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:11:48,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:11:48,985 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 83 [2025-04-29 11:11:48,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 83 transitions, 191 flow. Second operand has 6 states, 6 states have (on average 61.5) internal successors, (369), 6 states have internal predecessors, (369), 0 states have call successors, (0), 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:48,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:48,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 83 [2025-04-29 11:11:48,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:49,086 INFO L116 PetriNetUnfolderBase]: 31/238 cut-off events. [2025-04-29 11:11:49,086 INFO L117 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-04-29 11:11:49,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 363 conditions, 238 events. 31/238 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1054 event pairs, 5 based on Foata normal form. 0/219 useless extension candidates. Maximal degree in co-relation 276. Up to 62 conditions per place. [2025-04-29 11:11:49,087 INFO L140 encePairwiseOnDemand]: 77/83 looper letters, 24 selfloop transitions, 5 changer transitions 0/90 dead transitions. [2025-04-29 11:11:49,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 90 transitions, 263 flow [2025-04-29 11:11:49,088 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:11:49,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:11:49,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 390 transitions. [2025-04-29 11:11:49,091 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7831325301204819 [2025-04-29 11:11:49,092 INFO L175 Difference]: Start difference. First operand has 88 places, 83 transitions, 191 flow. Second operand 6 states and 390 transitions. [2025-04-29 11:11:49,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 90 transitions, 263 flow [2025-04-29 11:11:49,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 90 transitions, 257 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:11:49,094 INFO L231 Difference]: Finished difference. Result has 89 places, 82 transitions, 193 flow [2025-04-29 11:11:49,095 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=193, PETRI_PLACES=89, PETRI_TRANSITIONS=82} [2025-04-29 11:11:49,095 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 5 predicate places. [2025-04-29 11:11:49,095 INFO L485 AbstractCegarLoop]: Abstraction has has 89 places, 82 transitions, 193 flow [2025-04-29 11:11:49,096 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 61.5) internal successors, (369), 6 states have internal predecessors, (369), 0 states have call successors, (0), 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:49,096 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:49,096 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] [2025-04-29 11:11:49,096 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:11:49,097 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-04-29 11:11:49,097 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:49,097 INFO L85 PathProgramCache]: Analyzing trace with hash 904159279, now seen corresponding path program 1 times [2025-04-29 11:11:49,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:49,097 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427477876] [2025-04-29 11:11:49,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:49,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:49,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-29 11:11:49,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-29 11:11:49,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:49,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:49,189 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:49,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:49,190 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427477876] [2025-04-29 11:11:49,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427477876] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:49,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:49,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:11:49,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101093915] [2025-04-29 11:11:49,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:49,191 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:11:49,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:49,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:11:49,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:11:49,269 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 83 [2025-04-29 11:11:49,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 82 transitions, 193 flow. Second operand has 5 states, 5 states have (on average 68.4) internal successors, (342), 5 states have internal predecessors, (342), 0 states have call successors, (0), 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:49,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:49,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 83 [2025-04-29 11:11:49,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:49,326 INFO L116 PetriNetUnfolderBase]: 17/226 cut-off events. [2025-04-29 11:11:49,326 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-29 11:11:49,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 324 conditions, 226 events. 17/226 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 810 event pairs, 1 based on Foata normal form. 1/213 useless extension candidates. Maximal degree in co-relation 227. Up to 49 conditions per place. [2025-04-29 11:11:49,327 INFO L140 encePairwiseOnDemand]: 75/83 looper letters, 15 selfloop transitions, 2 changer transitions 5/89 dead transitions. [2025-04-29 11:11:49,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 89 transitions, 251 flow [2025-04-29 11:11:49,329 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:11:49,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:11:49,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 425 transitions. [2025-04-29 11:11:49,330 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8534136546184738 [2025-04-29 11:11:49,330 INFO L175 Difference]: Start difference. First operand has 89 places, 82 transitions, 193 flow. Second operand 6 states and 425 transitions. [2025-04-29 11:11:49,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 89 transitions, 251 flow [2025-04-29 11:11:49,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 89 transitions, 241 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:11:49,332 INFO L231 Difference]: Finished difference. Result has 93 places, 82 transitions, 201 flow [2025-04-29 11:11:49,334 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=201, PETRI_PLACES=93, PETRI_TRANSITIONS=82} [2025-04-29 11:11:49,335 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 9 predicate places. [2025-04-29 11:11:49,335 INFO L485 AbstractCegarLoop]: Abstraction has has 93 places, 82 transitions, 201 flow [2025-04-29 11:11:49,335 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 68.4) internal successors, (342), 5 states have internal predecessors, (342), 0 states have call successors, (0), 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:49,336 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:49,336 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] [2025-04-29 11:11:49,336 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:11:49,336 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-04-29 11:11:49,337 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:49,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1104688963, now seen corresponding path program 1 times [2025-04-29 11:11:49,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:49,337 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450185523] [2025-04-29 11:11:49,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:49,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:49,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-29 11:11:49,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-29 11:11:49,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:49,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:49,377 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:49,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:49,377 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450185523] [2025-04-29 11:11:49,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450185523] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:49,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:49,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:11:49,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672943853] [2025-04-29 11:11:49,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:49,378 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:11:49,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:49,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:11:49,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:11:49,386 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 83 [2025-04-29 11:11:49,387 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 82 transitions, 201 flow. Second operand has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 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:49,387 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:49,387 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 83 [2025-04-29 11:11:49,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:49,414 INFO L116 PetriNetUnfolderBase]: 5/163 cut-off events. [2025-04-29 11:11:49,414 INFO L117 PetriNetUnfolderBase]: For 19/32 co-relation queries the response was YES. [2025-04-29 11:11:49,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 240 conditions, 163 events. 5/163 cut-off events. For 19/32 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 472 event pairs, 3 based on Foata normal form. 1/154 useless extension candidates. Maximal degree in co-relation 187. Up to 25 conditions per place. [2025-04-29 11:11:49,416 INFO L140 encePairwiseOnDemand]: 78/83 looper letters, 8 selfloop transitions, 4 changer transitions 3/85 dead transitions. [2025-04-29 11:11:49,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 85 transitions, 237 flow [2025-04-29 11:11:49,417 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:11:49,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:11:49,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 230 transitions. [2025-04-29 11:11:49,418 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9236947791164659 [2025-04-29 11:11:49,418 INFO L175 Difference]: Start difference. First operand has 93 places, 82 transitions, 201 flow. Second operand 3 states and 230 transitions. [2025-04-29 11:11:49,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 85 transitions, 237 flow [2025-04-29 11:11:49,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 85 transitions, 223 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-04-29 11:11:49,420 INFO L231 Difference]: Finished difference. Result has 89 places, 82 transitions, 209 flow [2025-04-29 11:11:49,420 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=209, PETRI_PLACES=89, PETRI_TRANSITIONS=82} [2025-04-29 11:11:49,421 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 5 predicate places. [2025-04-29 11:11:49,421 INFO L485 AbstractCegarLoop]: Abstraction has has 89 places, 82 transitions, 209 flow [2025-04-29 11:11:49,421 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 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:49,421 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:49,421 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, 1] [2025-04-29 11:11:49,421 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:11:49,423 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-04-29 11:11:49,425 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:49,425 INFO L85 PathProgramCache]: Analyzing trace with hash 2047961271, now seen corresponding path program 1 times [2025-04-29 11:11:49,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:49,425 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462012600] [2025-04-29 11:11:49,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:49,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:49,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-04-29 11:11:49,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-04-29 11:11:49,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:49,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:49,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:11:49,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:49,725 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462012600] [2025-04-29 11:11:49,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462012600] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:49,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:49,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:11:49,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468451284] [2025-04-29 11:11:49,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:49,725 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:11:49,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:49,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:11:49,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:11:49,810 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 83 [2025-04-29 11:11:49,810 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 82 transitions, 209 flow. Second operand has 6 states, 6 states have (on average 64.16666666666667) internal successors, (385), 6 states have internal predecessors, (385), 0 states have call successors, (0), 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:49,810 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:49,810 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 83 [2025-04-29 11:11:49,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:49,863 INFO L116 PetriNetUnfolderBase]: 25/276 cut-off events. [2025-04-29 11:11:49,863 INFO L117 PetriNetUnfolderBase]: For 51/54 co-relation queries the response was YES. [2025-04-29 11:11:49,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 452 conditions, 276 events. 25/276 cut-off events. For 51/54 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1221 event pairs, 15 based on Foata normal form. 0/267 useless extension candidates. Maximal degree in co-relation 370. Up to 55 conditions per place. [2025-04-29 11:11:49,865 INFO L140 encePairwiseOnDemand]: 77/83 looper letters, 12 selfloop transitions, 0 changer transitions 18/89 dead transitions. [2025-04-29 11:11:49,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 89 transitions, 277 flow [2025-04-29 11:11:49,865 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:11:49,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:11:49,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 400 transitions. [2025-04-29 11:11:49,866 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8032128514056225 [2025-04-29 11:11:49,866 INFO L175 Difference]: Start difference. First operand has 89 places, 82 transitions, 209 flow. Second operand 6 states and 400 transitions. [2025-04-29 11:11:49,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 89 transitions, 277 flow [2025-04-29 11:11:49,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 89 transitions, 269 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:11:49,870 INFO L231 Difference]: Finished difference. Result has 91 places, 71 transitions, 176 flow [2025-04-29 11:11:49,872 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=176, PETRI_PLACES=91, PETRI_TRANSITIONS=71} [2025-04-29 11:11:49,873 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 7 predicate places. [2025-04-29 11:11:49,873 INFO L485 AbstractCegarLoop]: Abstraction has has 91 places, 71 transitions, 176 flow [2025-04-29 11:11:49,873 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 64.16666666666667) internal successors, (385), 6 states have internal predecessors, (385), 0 states have call successors, (0), 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:49,874 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:49,874 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, 1] [2025-04-29 11:11:49,874 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:11:49,874 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-04-29 11:11:49,875 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:49,876 INFO L85 PathProgramCache]: Analyzing trace with hash 744125394, now seen corresponding path program 1 times [2025-04-29 11:11:49,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:49,876 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142598411] [2025-04-29 11:11:49,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:49,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:49,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-04-29 11:11:49,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-04-29 11:11:49,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:49,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:11:49,906 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-29 11:11:49,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-04-29 11:11:49,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-04-29 11:11:49,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:49,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:11:49,937 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-29 11:11:49,937 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-29 11:11:49,938 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-04-29 11:11:49,939 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 6 remaining) [2025-04-29 11:11:49,939 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (3 of 6 remaining) [2025-04-29 11:11:49,940 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (2 of 6 remaining) [2025-04-29 11:11:49,940 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 6 remaining) [2025-04-29 11:11:49,940 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 6 remaining) [2025-04-29 11:11:49,940 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:11:49,940 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-04-29 11:11:49,942 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-29 11:11:49,942 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-29 11:11:49,958 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-29 11:11:49,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 101 transitions, 218 flow [2025-04-29 11:11:49,982 INFO L116 PetriNetUnfolderBase]: 4/195 cut-off events. [2025-04-29 11:11:49,982 INFO L117 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-04-29 11:11:49,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 207 conditions, 195 events. 4/195 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 426 event pairs, 0 based on Foata normal form. 0/174 useless extension candidates. Maximal degree in co-relation 117. Up to 6 conditions per place. [2025-04-29 11:11:49,982 INFO L82 GeneralOperation]: Start removeDead. Operand has 103 places, 101 transitions, 218 flow [2025-04-29 11:11:49,983 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 103 places, 101 transitions, 218 flow [2025-04-29 11:11:49,984 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:11:49,984 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;@45ac2c5f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:11:49,984 INFO L341 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-04-29 11:11:49,989 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:11:49,990 INFO L116 PetriNetUnfolderBase]: 1/42 cut-off events. [2025-04-29 11:11:49,990 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:11:49,990 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:49,990 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] [2025-04-29 11:11:49,990 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-04-29 11:11:49,991 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:49,991 INFO L85 PathProgramCache]: Analyzing trace with hash -163146067, now seen corresponding path program 1 times [2025-04-29 11:11:49,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:49,991 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470864841] [2025-04-29 11:11:49,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:49,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:49,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-29 11:11:49,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-29 11:11:49,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:49,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:50,016 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:50,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:50,016 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470864841] [2025-04-29 11:11:50,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470864841] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:50,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:50,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:11:50,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069094886] [2025-04-29 11:11:50,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:50,017 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:11:50,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:50,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:11:50,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:11:50,028 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 101 [2025-04-29 11:11:50,029 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 101 transitions, 218 flow. Second operand has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:50,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:50,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 101 [2025-04-29 11:11:50,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:50,139 INFO L116 PetriNetUnfolderBase]: 119/715 cut-off events. [2025-04-29 11:11:50,140 INFO L117 PetriNetUnfolderBase]: For 68/92 co-relation queries the response was YES. [2025-04-29 11:11:50,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 987 conditions, 715 events. 119/715 cut-off events. For 68/92 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 4205 event pairs, 50 based on Foata normal form. 1/631 useless extension candidates. Maximal degree in co-relation 741. Up to 139 conditions per place. [2025-04-29 11:11:50,144 INFO L140 encePairwiseOnDemand]: 95/101 looper letters, 16 selfloop transitions, 4 changer transitions 1/107 dead transitions. [2025-04-29 11:11:50,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 107 transitions, 270 flow [2025-04-29 11:11:50,145 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:11:50,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:11:50,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 283 transitions. [2025-04-29 11:11:50,146 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.933993399339934 [2025-04-29 11:11:50,146 INFO L175 Difference]: Start difference. First operand has 103 places, 101 transitions, 218 flow. Second operand 3 states and 283 transitions. [2025-04-29 11:11:50,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 107 transitions, 270 flow [2025-04-29 11:11:50,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 107 transitions, 270 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:11:50,148 INFO L231 Difference]: Finished difference. Result has 107 places, 102 transitions, 244 flow [2025-04-29 11:11:50,148 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=244, PETRI_PLACES=107, PETRI_TRANSITIONS=102} [2025-04-29 11:11:50,149 INFO L279 CegarLoopForPetriNet]: 103 programPoint places, 4 predicate places. [2025-04-29 11:11:50,149 INFO L485 AbstractCegarLoop]: Abstraction has has 107 places, 102 transitions, 244 flow [2025-04-29 11:11:50,149 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:50,149 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:50,149 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] [2025-04-29 11:11:50,149 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-29 11:11:50,149 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-04-29 11:11:50,149 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:50,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1007261137, now seen corresponding path program 1 times [2025-04-29 11:11:50,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:50,150 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466439223] [2025-04-29 11:11:50,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:50,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:50,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-29 11:11:50,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-29 11:11:50,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:50,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:50,198 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:50,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:50,198 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466439223] [2025-04-29 11:11:50,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466439223] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:50,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:50,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:11:50,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894919052] [2025-04-29 11:11:50,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:50,198 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:11:50,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:50,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:11:50,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:11:50,278 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 101 [2025-04-29 11:11:50,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 102 transitions, 244 flow. Second operand has 5 states, 5 states have (on average 82.4) internal successors, (412), 5 states have internal predecessors, (412), 0 states have call successors, (0), 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:50,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:50,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 101 [2025-04-29 11:11:50,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:50,439 INFO L116 PetriNetUnfolderBase]: 187/1177 cut-off events. [2025-04-29 11:11:50,439 INFO L117 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2025-04-29 11:11:50,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1675 conditions, 1177 events. 187/1177 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 8536 event pairs, 130 based on Foata normal form. 1/1079 useless extension candidates. Maximal degree in co-relation 1074. Up to 312 conditions per place. [2025-04-29 11:11:50,448 INFO L140 encePairwiseOnDemand]: 93/101 looper letters, 20 selfloop transitions, 2 changer transitions 5/110 dead transitions. [2025-04-29 11:11:50,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 110 transitions, 314 flow [2025-04-29 11:11:50,451 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:11:50,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:11:50,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 514 transitions. [2025-04-29 11:11:50,453 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8481848184818482 [2025-04-29 11:11:50,453 INFO L175 Difference]: Start difference. First operand has 107 places, 102 transitions, 244 flow. Second operand 6 states and 514 transitions. [2025-04-29 11:11:50,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 110 transitions, 314 flow [2025-04-29 11:11:50,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 110 transitions, 306 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:11:50,458 INFO L231 Difference]: Finished difference. Result has 113 places, 103 transitions, 258 flow [2025-04-29 11:11:50,458 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=258, PETRI_PLACES=113, PETRI_TRANSITIONS=103} [2025-04-29 11:11:50,459 INFO L279 CegarLoopForPetriNet]: 103 programPoint places, 10 predicate places. [2025-04-29 11:11:50,459 INFO L485 AbstractCegarLoop]: Abstraction has has 113 places, 103 transitions, 258 flow [2025-04-29 11:11:50,460 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 82.4) internal successors, (412), 5 states have internal predecessors, (412), 0 states have call successors, (0), 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:50,462 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:50,462 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] [2025-04-29 11:11:50,462 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-29 11:11:50,462 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-04-29 11:11:50,462 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:50,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1368650385, now seen corresponding path program 1 times [2025-04-29 11:11:50,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:50,463 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38259560] [2025-04-29 11:11:50,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:50,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:50,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-29 11:11:50,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-29 11:11:50,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:50,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:50,640 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:50,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:50,641 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38259560] [2025-04-29 11:11:50,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38259560] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:50,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:50,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:11:50,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208804062] [2025-04-29 11:11:50,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:50,642 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:11:50,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:50,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:11:50,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:11:50,727 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 101 [2025-04-29 11:11:50,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 103 transitions, 258 flow. Second operand has 6 states, 6 states have (on average 75.5) internal successors, (453), 6 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:50,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:50,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 101 [2025-04-29 11:11:50,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:50,848 INFO L116 PetriNetUnfolderBase]: 298/1262 cut-off events. [2025-04-29 11:11:50,848 INFO L117 PetriNetUnfolderBase]: For 97/97 co-relation queries the response was YES. [2025-04-29 11:11:50,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2064 conditions, 1262 events. 298/1262 cut-off events. For 97/97 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 9535 event pairs, 130 based on Foata normal form. 0/1163 useless extension candidates. Maximal degree in co-relation 955. Up to 371 conditions per place. [2025-04-29 11:11:50,855 INFO L140 encePairwiseOnDemand]: 95/101 looper letters, 37 selfloop transitions, 5 changer transitions 0/118 dead transitions. [2025-04-29 11:11:50,855 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 118 transitions, 372 flow [2025-04-29 11:11:50,855 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:11:50,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:11:50,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 486 transitions. [2025-04-29 11:11:50,856 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.801980198019802 [2025-04-29 11:11:50,856 INFO L175 Difference]: Start difference. First operand has 113 places, 103 transitions, 258 flow. Second operand 6 states and 486 transitions. [2025-04-29 11:11:50,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 118 transitions, 372 flow [2025-04-29 11:11:50,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 118 transitions, 360 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-04-29 11:11:50,859 INFO L231 Difference]: Finished difference. Result has 110 places, 102 transitions, 254 flow [2025-04-29 11:11:50,859 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=254, PETRI_PLACES=110, PETRI_TRANSITIONS=102} [2025-04-29 11:11:50,860 INFO L279 CegarLoopForPetriNet]: 103 programPoint places, 7 predicate places. [2025-04-29 11:11:50,860 INFO L485 AbstractCegarLoop]: Abstraction has has 110 places, 102 transitions, 254 flow [2025-04-29 11:11:50,860 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 75.5) internal successors, (453), 6 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:50,860 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:50,860 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] [2025-04-29 11:11:50,860 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-29 11:11:50,860 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-04-29 11:11:50,861 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:50,861 INFO L85 PathProgramCache]: Analyzing trace with hash -2118483373, now seen corresponding path program 1 times [2025-04-29 11:11:50,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:50,861 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372094553] [2025-04-29 11:11:50,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:50,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:50,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-29 11:11:50,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-29 11:11:50,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:50,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:50,883 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:50,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:50,884 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372094553] [2025-04-29 11:11:50,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372094553] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:50,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:50,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:11:50,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47336384] [2025-04-29 11:11:50,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:50,884 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:11:50,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:50,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:11:50,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:11:50,894 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 101 [2025-04-29 11:11:50,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 102 transitions, 254 flow. Second operand has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 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:50,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:50,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 101 [2025-04-29 11:11:50,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:50,973 INFO L116 PetriNetUnfolderBase]: 170/1018 cut-off events. [2025-04-29 11:11:50,974 INFO L117 PetriNetUnfolderBase]: For 196/323 co-relation queries the response was YES. [2025-04-29 11:11:50,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1594 conditions, 1018 events. 170/1018 cut-off events. For 196/323 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 7278 event pairs, 74 based on Foata normal form. 4/885 useless extension candidates. Maximal degree in co-relation 660. Up to 268 conditions per place. [2025-04-29 11:11:50,978 INFO L140 encePairwiseOnDemand]: 95/101 looper letters, 19 selfloop transitions, 7 changer transitions 0/111 dead transitions. [2025-04-29 11:11:50,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 111 transitions, 338 flow [2025-04-29 11:11:50,979 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:11:50,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:11:50,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 279 transitions. [2025-04-29 11:11:50,980 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9207920792079208 [2025-04-29 11:11:50,980 INFO L175 Difference]: Start difference. First operand has 110 places, 102 transitions, 254 flow. Second operand 3 states and 279 transitions. [2025-04-29 11:11:50,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 111 transitions, 338 flow [2025-04-29 11:11:50,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 111 transitions, 328 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:11:50,982 INFO L231 Difference]: Finished difference. Result has 109 places, 107 transitions, 300 flow [2025-04-29 11:11:50,982 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=300, PETRI_PLACES=109, PETRI_TRANSITIONS=107} [2025-04-29 11:11:50,982 INFO L279 CegarLoopForPetriNet]: 103 programPoint places, 6 predicate places. [2025-04-29 11:11:50,982 INFO L485 AbstractCegarLoop]: Abstraction has has 109 places, 107 transitions, 300 flow [2025-04-29 11:11:50,983 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 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:50,983 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:50,983 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, 1] [2025-04-29 11:11:50,983 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-29 11:11:50,983 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-04-29 11:11:50,983 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:50,983 INFO L85 PathProgramCache]: Analyzing trace with hash -15394260, now seen corresponding path program 1 times [2025-04-29 11:11:50,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:50,983 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589844559] [2025-04-29 11:11:50,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:50,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:50,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-04-29 11:11:50,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-04-29 11:11:50,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:50,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:51,174 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:51,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:51,174 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589844559] [2025-04-29 11:11:51,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589844559] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:51,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:51,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:11:51,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480765452] [2025-04-29 11:11:51,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:51,175 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:11:51,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:51,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:11:51,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:11:51,231 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 101 [2025-04-29 11:11:51,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 107 transitions, 300 flow. Second operand has 6 states, 6 states have (on average 78.16666666666667) internal successors, (469), 6 states have internal predecessors, (469), 0 states have call successors, (0), 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:51,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:51,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 101 [2025-04-29 11:11:51,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:51,397 INFO L116 PetriNetUnfolderBase]: 356/1814 cut-off events. [2025-04-29 11:11:51,397 INFO L117 PetriNetUnfolderBase]: For 302/348 co-relation queries the response was YES. [2025-04-29 11:11:51,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2991 conditions, 1814 events. 356/1814 cut-off events. For 302/348 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 15364 event pairs, 177 based on Foata normal form. 3/1658 useless extension candidates. Maximal degree in co-relation 2425. Up to 360 conditions per place. [2025-04-29 11:11:51,405 INFO L140 encePairwiseOnDemand]: 95/101 looper letters, 34 selfloop transitions, 5 changer transitions 0/122 dead transitions. [2025-04-29 11:11:51,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 122 transitions, 408 flow [2025-04-29 11:11:51,406 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:11:51,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:11:51,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 496 transitions. [2025-04-29 11:11:51,407 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8184818481848185 [2025-04-29 11:11:51,407 INFO L175 Difference]: Start difference. First operand has 109 places, 107 transitions, 300 flow. Second operand 6 states and 496 transitions. [2025-04-29 11:11:51,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 122 transitions, 408 flow [2025-04-29 11:11:51,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 122 transitions, 394 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:11:51,411 INFO L231 Difference]: Finished difference. Result has 111 places, 106 transitions, 294 flow [2025-04-29 11:11:51,412 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=294, PETRI_PLACES=111, PETRI_TRANSITIONS=106} [2025-04-29 11:11:51,412 INFO L279 CegarLoopForPetriNet]: 103 programPoint places, 8 predicate places. [2025-04-29 11:11:51,413 INFO L485 AbstractCegarLoop]: Abstraction has has 111 places, 106 transitions, 294 flow [2025-04-29 11:11:51,413 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 78.16666666666667) internal successors, (469), 6 states have internal predecessors, (469), 0 states have call successors, (0), 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:51,413 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:51,413 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, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:11:51,413 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-29 11:11:51,413 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-04-29 11:11:51,414 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:51,414 INFO L85 PathProgramCache]: Analyzing trace with hash -2032097882, now seen corresponding path program 1 times [2025-04-29 11:11:51,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:51,414 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421428262] [2025-04-29 11:11:51,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:51,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:51,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-04-29 11:11:51,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-04-29 11:11:51,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:51,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:51,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:11:51,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:51,493 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421428262] [2025-04-29 11:11:51,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421428262] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:51,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:51,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 11:11:51,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606568768] [2025-04-29 11:11:51,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:51,493 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:11:51,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:51,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:11:51,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:11:51,581 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 101 [2025-04-29 11:11:51,582 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 106 transitions, 294 flow. Second operand has 6 states, 6 states have (on average 82.16666666666667) internal successors, (493), 6 states have internal predecessors, (493), 0 states have call successors, (0), 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:51,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:51,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 101 [2025-04-29 11:11:51,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:51,669 INFO L116 PetriNetUnfolderBase]: 141/990 cut-off events. [2025-04-29 11:11:51,669 INFO L117 PetriNetUnfolderBase]: For 137/165 co-relation queries the response was YES. [2025-04-29 11:11:51,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1570 conditions, 990 events. 141/990 cut-off events. For 137/165 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 6836 event pairs, 69 based on Foata normal form. 15/941 useless extension candidates. Maximal degree in co-relation 972. Up to 189 conditions per place. [2025-04-29 11:11:51,674 INFO L140 encePairwiseOnDemand]: 94/101 looper letters, 23 selfloop transitions, 6 changer transitions 6/119 dead transitions. [2025-04-29 11:11:51,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 119 transitions, 394 flow [2025-04-29 11:11:51,674 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:11:51,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:11:51,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 516 transitions. [2025-04-29 11:11:51,675 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8514851485148515 [2025-04-29 11:11:51,675 INFO L175 Difference]: Start difference. First operand has 111 places, 106 transitions, 294 flow. Second operand 6 states and 516 transitions. [2025-04-29 11:11:51,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 119 transitions, 394 flow [2025-04-29 11:11:51,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 119 transitions, 382 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:11:51,677 INFO L231 Difference]: Finished difference. Result has 113 places, 106 transitions, 300 flow [2025-04-29 11:11:51,677 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=300, PETRI_PLACES=113, PETRI_TRANSITIONS=106} [2025-04-29 11:11:51,678 INFO L279 CegarLoopForPetriNet]: 103 programPoint places, 10 predicate places. [2025-04-29 11:11:51,678 INFO L485 AbstractCegarLoop]: Abstraction has has 113 places, 106 transitions, 300 flow [2025-04-29 11:11:51,678 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 82.16666666666667) internal successors, (493), 6 states have internal predecessors, (493), 0 states have call successors, (0), 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:51,678 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:51,679 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:11:51,679 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-29 11:11:51,679 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-04-29 11:11:51,679 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:51,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1932754113, now seen corresponding path program 1 times [2025-04-29 11:11:51,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:51,679 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745374420] [2025-04-29 11:11:51,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:51,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:51,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-04-29 11:11:51,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-04-29 11:11:51,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:51,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:51,706 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:11:51,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:51,706 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745374420] [2025-04-29 11:11:51,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745374420] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:51,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:51,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:11:51,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481617981] [2025-04-29 11:11:51,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:51,707 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:11:51,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:51,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:11:51,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:11:51,717 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 101 [2025-04-29 11:11:51,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 106 transitions, 300 flow. Second operand has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 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:51,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:51,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 101 [2025-04-29 11:11:51,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:51,772 INFO L116 PetriNetUnfolderBase]: 56/597 cut-off events. [2025-04-29 11:11:51,773 INFO L117 PetriNetUnfolderBase]: For 214/279 co-relation queries the response was YES. [2025-04-29 11:11:51,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 980 conditions, 597 events. 56/597 cut-off events. For 214/279 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3589 event pairs, 30 based on Foata normal form. 3/577 useless extension candidates. Maximal degree in co-relation 867. Up to 119 conditions per place. [2025-04-29 11:11:51,775 INFO L140 encePairwiseOnDemand]: 95/101 looper letters, 19 selfloop transitions, 7 changer transitions 1/113 dead transitions. [2025-04-29 11:11:51,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 113 transitions, 377 flow [2025-04-29 11:11:51,775 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:11:51,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:11:51,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 278 transitions. [2025-04-29 11:11:51,776 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9174917491749175 [2025-04-29 11:11:51,777 INFO L175 Difference]: Start difference. First operand has 113 places, 106 transitions, 300 flow. Second operand 3 states and 278 transitions. [2025-04-29 11:11:51,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 113 transitions, 377 flow [2025-04-29 11:11:51,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 113 transitions, 369 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-29 11:11:51,779 INFO L231 Difference]: Finished difference. Result has 114 places, 109 transitions, 342 flow [2025-04-29 11:11:51,779 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=342, PETRI_PLACES=114, PETRI_TRANSITIONS=109} [2025-04-29 11:11:51,781 INFO L279 CegarLoopForPetriNet]: 103 programPoint places, 11 predicate places. [2025-04-29 11:11:51,781 INFO L485 AbstractCegarLoop]: Abstraction has has 114 places, 109 transitions, 342 flow [2025-04-29 11:11:51,781 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 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:51,781 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:51,782 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-04-29 11:11:51,782 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-29 11:11:51,782 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-04-29 11:11:51,782 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:51,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1238213042, now seen corresponding path program 1 times [2025-04-29 11:11:51,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:51,782 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480943555] [2025-04-29 11:11:51,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:51,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:51,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-04-29 11:11:51,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-29 11:11:51,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:51,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:11:51,803 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-29 11:11:51,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-04-29 11:11:51,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-29 11:11:51,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:51,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:11:51,820 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-29 11:11:51,820 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-29 11:11:51,820 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2025-04-29 11:11:51,820 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2025-04-29 11:11:51,820 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2025-04-29 11:11:51,820 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2025-04-29 11:11:51,820 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2025-04-29 11:11:51,821 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2025-04-29 11:11:51,821 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2025-04-29 11:11:51,821 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-29 11:11:51,821 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:11:51,822 WARN L247 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-29 11:11:51,822 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-04-29 11:11:51,836 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-29 11:11:51,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 119 transitions, 265 flow [2025-04-29 11:11:51,857 INFO L116 PetriNetUnfolderBase]: 9/320 cut-off events. [2025-04-29 11:11:51,857 INFO L117 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-04-29 11:11:51,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 345 conditions, 320 events. 9/320 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 898 event pairs, 1 based on Foata normal form. 0/284 useless extension candidates. Maximal degree in co-relation 203. Up to 12 conditions per place. [2025-04-29 11:11:51,858 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 119 transitions, 265 flow [2025-04-29 11:11:51,860 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 119 transitions, 265 flow [2025-04-29 11:11:51,861 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:11:51,861 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;@45ac2c5f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:11:51,861 INFO L341 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-04-29 11:11:51,863 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:11:51,863 INFO L116 PetriNetUnfolderBase]: 1/42 cut-off events. [2025-04-29 11:11:51,863 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:11:51,863 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:51,863 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] [2025-04-29 11:11:51,863 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-04-29 11:11:51,863 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:51,863 INFO L85 PathProgramCache]: Analyzing trace with hash -60129843, now seen corresponding path program 1 times [2025-04-29 11:11:51,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:51,864 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104447695] [2025-04-29 11:11:51,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:51,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:51,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-29 11:11:51,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-29 11:11:51,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:51,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:51,876 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:51,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:51,876 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104447695] [2025-04-29 11:11:51,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104447695] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:51,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:51,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:11:51,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597444576] [2025-04-29 11:11:51,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:51,876 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:11:51,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:51,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:11:51,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:11:51,889 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 119 [2025-04-29 11:11:51,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 119 transitions, 265 flow. Second operand has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 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:51,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:51,890 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 119 [2025-04-29 11:11:51,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:52,153 INFO L116 PetriNetUnfolderBase]: 1071/3956 cut-off events. [2025-04-29 11:11:52,154 INFO L117 PetriNetUnfolderBase]: For 337/442 co-relation queries the response was YES. [2025-04-29 11:11:52,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5871 conditions, 3956 events. 1071/3956 cut-off events. For 337/442 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 35838 event pairs, 542 based on Foata normal form. 1/3516 useless extension candidates. Maximal degree in co-relation 4604. Up to 1110 conditions per place. [2025-04-29 11:11:52,177 INFO L140 encePairwiseOnDemand]: 112/119 looper letters, 23 selfloop transitions, 5 changer transitions 1/128 dead transitions. [2025-04-29 11:11:52,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 128 transitions, 339 flow [2025-04-29 11:11:52,178 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:11:52,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:11:52,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 330 transitions. [2025-04-29 11:11:52,179 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9243697478991597 [2025-04-29 11:11:52,179 INFO L175 Difference]: Start difference. First operand has 122 places, 119 transitions, 265 flow. Second operand 3 states and 330 transitions. [2025-04-29 11:11:52,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 128 transitions, 339 flow [2025-04-29 11:11:52,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 128 transitions, 339 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:11:52,182 INFO L231 Difference]: Finished difference. Result has 126 places, 121 transitions, 299 flow [2025-04-29 11:11:52,182 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=299, PETRI_PLACES=126, PETRI_TRANSITIONS=121} [2025-04-29 11:11:52,183 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, 4 predicate places. [2025-04-29 11:11:52,183 INFO L485 AbstractCegarLoop]: Abstraction has has 126 places, 121 transitions, 299 flow [2025-04-29 11:11:52,183 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 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:52,183 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:52,183 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] [2025-04-29 11:11:52,183 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-29 11:11:52,183 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-04-29 11:11:52,183 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:52,184 INFO L85 PathProgramCache]: Analyzing trace with hash -792913873, now seen corresponding path program 1 times [2025-04-29 11:11:52,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:52,184 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060409525] [2025-04-29 11:11:52,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:52,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:52,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-29 11:11:52,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-29 11:11:52,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:52,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:52,219 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:52,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:52,220 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060409525] [2025-04-29 11:11:52,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060409525] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:52,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:52,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:11:52,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384279719] [2025-04-29 11:11:52,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:52,220 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:11:52,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:52,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:11:52,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:11:52,282 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 119 [2025-04-29 11:11:52,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 121 transitions, 299 flow. Second operand has 5 states, 5 states have (on average 96.4) internal successors, (482), 5 states have internal predecessors, (482), 0 states have call successors, (0), 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:52,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:52,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 119 [2025-04-29 11:11:52,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:52,715 INFO L116 PetriNetUnfolderBase]: 1392/6278 cut-off events. [2025-04-29 11:11:52,716 INFO L117 PetriNetUnfolderBase]: For 440/448 co-relation queries the response was YES. [2025-04-29 11:11:52,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9170 conditions, 6278 events. 1392/6278 cut-off events. For 440/448 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 63543 event pairs, 1074 based on Foata normal form. 1/5641 useless extension candidates. Maximal degree in co-relation 5640. Up to 1837 conditions per place. [2025-04-29 11:11:52,755 INFO L140 encePairwiseOnDemand]: 111/119 looper letters, 24 selfloop transitions, 2 changer transitions 5/129 dead transitions. [2025-04-29 11:11:52,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 129 transitions, 377 flow [2025-04-29 11:11:52,755 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:11:52,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:11:52,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 602 transitions. [2025-04-29 11:11:52,757 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8431372549019608 [2025-04-29 11:11:52,757 INFO L175 Difference]: Start difference. First operand has 126 places, 121 transitions, 299 flow. Second operand 6 states and 602 transitions. [2025-04-29 11:11:52,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 129 transitions, 377 flow [2025-04-29 11:11:52,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 129 transitions, 367 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:11:52,762 INFO L231 Difference]: Finished difference. Result has 132 places, 122 transitions, 311 flow [2025-04-29 11:11:52,763 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=289, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=311, PETRI_PLACES=132, PETRI_TRANSITIONS=122} [2025-04-29 11:11:52,763 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, 10 predicate places. [2025-04-29 11:11:52,763 INFO L485 AbstractCegarLoop]: Abstraction has has 132 places, 122 transitions, 311 flow [2025-04-29 11:11:52,763 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 96.4) internal successors, (482), 5 states have internal predecessors, (482), 0 states have call successors, (0), 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:52,763 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:52,763 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] [2025-04-29 11:11:52,763 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-29 11:11:52,764 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-04-29 11:11:52,764 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:52,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1154303121, now seen corresponding path program 1 times [2025-04-29 11:11:52,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:52,764 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679912014] [2025-04-29 11:11:52,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:52,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:52,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-29 11:11:52,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-29 11:11:52,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:52,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:52,888 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:52,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:52,888 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679912014] [2025-04-29 11:11:52,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679912014] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:52,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:52,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:11:52,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731972046] [2025-04-29 11:11:52,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:52,888 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:11:52,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:52,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:11:52,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:11:52,985 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 119 [2025-04-29 11:11:52,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 122 transitions, 311 flow. Second operand has 6 states, 6 states have (on average 89.5) internal successors, (537), 6 states have internal predecessors, (537), 0 states have call successors, (0), 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:52,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:52,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 119 [2025-04-29 11:11:52,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:53,616 INFO L116 PetriNetUnfolderBase]: 2134/6760 cut-off events. [2025-04-29 11:11:53,617 INFO L117 PetriNetUnfolderBase]: For 538/538 co-relation queries the response was YES. [2025-04-29 11:11:53,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11173 conditions, 6760 events. 2134/6760 cut-off events. For 538/538 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 67104 event pairs, 433 based on Foata normal form. 0/6048 useless extension candidates. Maximal degree in co-relation 10875. Up to 2246 conditions per place. [2025-04-29 11:11:53,644 INFO L140 encePairwiseOnDemand]: 113/119 looper letters, 49 selfloop transitions, 5 changer transitions 0/145 dead transitions. [2025-04-29 11:11:53,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 145 transitions, 465 flow [2025-04-29 11:11:53,644 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:11:53,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:11:53,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 582 transitions. [2025-04-29 11:11:53,645 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8151260504201681 [2025-04-29 11:11:53,646 INFO L175 Difference]: Start difference. First operand has 132 places, 122 transitions, 311 flow. Second operand 6 states and 582 transitions. [2025-04-29 11:11:53,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 145 transitions, 465 flow [2025-04-29 11:11:53,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 145 transitions, 453 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-04-29 11:11:53,654 INFO L231 Difference]: Finished difference. Result has 129 places, 121 transitions, 307 flow [2025-04-29 11:11:53,654 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=307, PETRI_PLACES=129, PETRI_TRANSITIONS=121} [2025-04-29 11:11:53,655 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, 7 predicate places. [2025-04-29 11:11:53,655 INFO L485 AbstractCegarLoop]: Abstraction has has 129 places, 121 transitions, 307 flow [2025-04-29 11:11:53,655 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 89.5) internal successors, (537), 6 states have internal predecessors, (537), 0 states have call successors, (0), 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:53,655 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:53,655 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] [2025-04-29 11:11:53,655 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-29 11:11:53,655 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-04-29 11:11:53,656 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:53,656 INFO L85 PathProgramCache]: Analyzing trace with hash 192466115, now seen corresponding path program 1 times [2025-04-29 11:11:53,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:53,656 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176599762] [2025-04-29 11:11:53,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:53,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:53,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-29 11:11:53,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-29 11:11:53,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:53,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:53,674 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:53,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:53,674 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176599762] [2025-04-29 11:11:53,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176599762] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:53,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:53,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:11:53,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678527430] [2025-04-29 11:11:53,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:53,674 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:11:53,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:53,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:11:53,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:11:53,689 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 119 [2025-04-29 11:11:53,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 121 transitions, 307 flow. Second operand has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 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:53,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:53,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 119 [2025-04-29 11:11:53,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:54,147 INFO L116 PetriNetUnfolderBase]: 1740/6505 cut-off events. [2025-04-29 11:11:54,147 INFO L117 PetriNetUnfolderBase]: For 1608/2213 co-relation queries the response was YES. [2025-04-29 11:11:54,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10830 conditions, 6505 events. 1740/6505 cut-off events. For 1608/2213 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 67851 event pairs, 967 based on Foata normal form. 10/5716 useless extension candidates. Maximal degree in co-relation 9068. Up to 2240 conditions per place. [2025-04-29 11:11:54,174 INFO L140 encePairwiseOnDemand]: 112/119 looper letters, 29 selfloop transitions, 9 changer transitions 0/136 dead transitions. [2025-04-29 11:11:54,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 136 transitions, 441 flow [2025-04-29 11:11:54,175 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:11:54,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:11:54,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 328 transitions. [2025-04-29 11:11:54,175 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9187675070028011 [2025-04-29 11:11:54,176 INFO L175 Difference]: Start difference. First operand has 129 places, 121 transitions, 307 flow. Second operand 3 states and 328 transitions. [2025-04-29 11:11:54,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 136 transitions, 441 flow [2025-04-29 11:11:54,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 136 transitions, 431 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:11:54,178 INFO L231 Difference]: Finished difference. Result has 128 places, 128 transitions, 373 flow [2025-04-29 11:11:54,178 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=373, PETRI_PLACES=128, PETRI_TRANSITIONS=128} [2025-04-29 11:11:54,179 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, 6 predicate places. [2025-04-29 11:11:54,179 INFO L485 AbstractCegarLoop]: Abstraction has has 128 places, 128 transitions, 373 flow [2025-04-29 11:11:54,180 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 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:54,180 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:54,180 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, 1] [2025-04-29 11:11:54,180 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-29 11:11:54,180 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-04-29 11:11:54,180 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:54,181 INFO L85 PathProgramCache]: Analyzing trace with hash 2071893427, now seen corresponding path program 1 times [2025-04-29 11:11:54,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:54,181 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324947888] [2025-04-29 11:11:54,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:54,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:54,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-04-29 11:11:54,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-04-29 11:11:54,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:54,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:54,331 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:54,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:54,331 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324947888] [2025-04-29 11:11:54,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324947888] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:54,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:54,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:11:54,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025619448] [2025-04-29 11:11:54,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:54,331 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:11:54,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:54,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:11:54,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:11:54,393 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 119 [2025-04-29 11:11:54,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 128 transitions, 373 flow. Second operand has 6 states, 6 states have (on average 92.16666666666667) internal successors, (553), 6 states have internal predecessors, (553), 0 states have call successors, (0), 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:54,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:54,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 119 [2025-04-29 11:11:54,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:55,069 INFO L116 PetriNetUnfolderBase]: 2856/10237 cut-off events. [2025-04-29 11:11:55,069 INFO L117 PetriNetUnfolderBase]: For 1677/2225 co-relation queries the response was YES. [2025-04-29 11:11:55,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17369 conditions, 10237 events. 2856/10237 cut-off events. For 1677/2225 co-relation queries the response was YES. Maximal size of possible extension queue 462. Compared 113104 event pairs, 1389 based on Foata normal form. 17/9091 useless extension candidates. Maximal degree in co-relation 13882. Up to 2139 conditions per place. [2025-04-29 11:11:55,203 INFO L140 encePairwiseOnDemand]: 113/119 looper letters, 46 selfloop transitions, 5 changer transitions 0/151 dead transitions. [2025-04-29 11:11:55,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 151 transitions, 521 flow [2025-04-29 11:11:55,204 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:11:55,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:11:55,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 592 transitions. [2025-04-29 11:11:55,205 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8291316526610645 [2025-04-29 11:11:55,205 INFO L175 Difference]: Start difference. First operand has 128 places, 128 transitions, 373 flow. Second operand 6 states and 592 transitions. [2025-04-29 11:11:55,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 151 transitions, 521 flow [2025-04-29 11:11:55,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 151 transitions, 503 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:11:55,214 INFO L231 Difference]: Finished difference. Result has 130 places, 127 transitions, 363 flow [2025-04-29 11:11:55,214 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=363, PETRI_PLACES=130, PETRI_TRANSITIONS=127} [2025-04-29 11:11:55,214 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, 8 predicate places. [2025-04-29 11:11:55,214 INFO L485 AbstractCegarLoop]: Abstraction has has 130 places, 127 transitions, 363 flow [2025-04-29 11:11:55,215 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.16666666666667) internal successors, (553), 6 states have internal predecessors, (553), 0 states have call successors, (0), 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:55,215 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:55,215 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, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:11:55,215 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-29 11:11:55,215 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-04-29 11:11:55,215 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:55,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1990806355, now seen corresponding path program 1 times [2025-04-29 11:11:55,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:55,215 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497225281] [2025-04-29 11:11:55,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:55,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:55,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-04-29 11:11:55,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-04-29 11:11:55,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:55,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:55,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:11:55,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:55,275 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497225281] [2025-04-29 11:11:55,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497225281] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:55,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:55,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 11:11:55,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109450017] [2025-04-29 11:11:55,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:55,275 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:11:55,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:55,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:11:55,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:11:55,348 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 119 [2025-04-29 11:11:55,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 127 transitions, 363 flow. Second operand has 6 states, 6 states have (on average 96.16666666666667) internal successors, (577), 6 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:55,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:55,349 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 119 [2025-04-29 11:11:55,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:55,859 INFO L116 PetriNetUnfolderBase]: 1305/6104 cut-off events. [2025-04-29 11:11:55,859 INFO L117 PetriNetUnfolderBase]: For 975/1236 co-relation queries the response was YES. [2025-04-29 11:11:55,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10062 conditions, 6104 events. 1305/6104 cut-off events. For 975/1236 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 63141 event pairs, 532 based on Foata normal form. 65/5597 useless extension candidates. Maximal degree in co-relation 4984. Up to 1228 conditions per place. [2025-04-29 11:11:55,895 INFO L140 encePairwiseOnDemand]: 112/119 looper letters, 38 selfloop transitions, 6 changer transitions 0/146 dead transitions. [2025-04-29 11:11:55,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 146 transitions, 500 flow [2025-04-29 11:11:55,896 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:11:55,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:11:55,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 609 transitions. [2025-04-29 11:11:55,897 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8529411764705882 [2025-04-29 11:11:55,897 INFO L175 Difference]: Start difference. First operand has 130 places, 127 transitions, 363 flow. Second operand 6 states and 609 transitions. [2025-04-29 11:11:55,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 146 transitions, 500 flow [2025-04-29 11:11:55,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 146 transitions, 488 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:11:55,902 INFO L231 Difference]: Finished difference. Result has 132 places, 129 transitions, 379 flow [2025-04-29 11:11:55,902 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=379, PETRI_PLACES=132, PETRI_TRANSITIONS=129} [2025-04-29 11:11:55,903 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, 10 predicate places. [2025-04-29 11:11:55,903 INFO L485 AbstractCegarLoop]: Abstraction has has 132 places, 129 transitions, 379 flow [2025-04-29 11:11:55,903 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 96.16666666666667) internal successors, (577), 6 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:55,903 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:55,903 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:11:55,903 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-29 11:11:55,904 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-04-29 11:11:55,904 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:55,904 INFO L85 PathProgramCache]: Analyzing trace with hash 830713430, now seen corresponding path program 1 times [2025-04-29 11:11:55,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:55,904 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496340031] [2025-04-29 11:11:55,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:55,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:55,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-04-29 11:11:55,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-04-29 11:11:55,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:55,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:55,932 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:11:55,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:55,933 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496340031] [2025-04-29 11:11:55,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496340031] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:55,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:55,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:11:55,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391662378] [2025-04-29 11:11:55,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:55,933 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:11:55,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:55,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:11:55,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:11:55,948 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 119 [2025-04-29 11:11:55,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 129 transitions, 379 flow. Second operand has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 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:55,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:55,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 119 [2025-04-29 11:11:55,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:56,357 INFO L116 PetriNetUnfolderBase]: 1088/4743 cut-off events. [2025-04-29 11:11:56,357 INFO L117 PetriNetUnfolderBase]: For 2466/2684 co-relation queries the response was YES. [2025-04-29 11:11:56,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8845 conditions, 4743 events. 1088/4743 cut-off events. For 2466/2684 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 49344 event pairs, 589 based on Foata normal form. 7/4389 useless extension candidates. Maximal degree in co-relation 8119. Up to 1450 conditions per place. [2025-04-29 11:11:56,374 INFO L140 encePairwiseOnDemand]: 112/119 looper letters, 31 selfloop transitions, 13 changer transitions 0/145 dead transitions. [2025-04-29 11:11:56,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 145 transitions, 540 flow [2025-04-29 11:11:56,375 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:11:56,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:11:56,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 327 transitions. [2025-04-29 11:11:56,376 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9159663865546218 [2025-04-29 11:11:56,376 INFO L175 Difference]: Start difference. First operand has 132 places, 129 transitions, 379 flow. Second operand 3 states and 327 transitions. [2025-04-29 11:11:56,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 145 transitions, 540 flow [2025-04-29 11:11:56,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 145 transitions, 532 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-29 11:11:56,380 INFO L231 Difference]: Finished difference. Result has 133 places, 138 transitions, 489 flow [2025-04-29 11:11:56,380 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=371, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=489, PETRI_PLACES=133, PETRI_TRANSITIONS=138} [2025-04-29 11:11:56,380 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, 11 predicate places. [2025-04-29 11:11:56,380 INFO L485 AbstractCegarLoop]: Abstraction has has 133 places, 138 transitions, 489 flow [2025-04-29 11:11:56,381 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 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:56,381 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:56,381 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:11:56,381 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-29 11:11:56,381 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-04-29 11:11:56,381 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:56,381 INFO L85 PathProgramCache]: Analyzing trace with hash -721269910, now seen corresponding path program 1 times [2025-04-29 11:11:56,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:56,381 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564384217] [2025-04-29 11:11:56,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:56,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:56,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-04-29 11:11:56,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-29 11:11:56,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:56,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:56,427 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:11:56,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:56,427 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564384217] [2025-04-29 11:11:56,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564384217] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:56,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:56,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:11:56,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301980355] [2025-04-29 11:11:56,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:56,428 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:11:56,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:56,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:11:56,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:11:56,435 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 119 [2025-04-29 11:11:56,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 138 transitions, 489 flow. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:56,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:56,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 119 [2025-04-29 11:11:56,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:56,538 INFO L116 PetriNetUnfolderBase]: 117/1530 cut-off events. [2025-04-29 11:11:56,539 INFO L117 PetriNetUnfolderBase]: For 761/887 co-relation queries the response was YES. [2025-04-29 11:11:56,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2545 conditions, 1530 events. 117/1530 cut-off events. For 761/887 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 12551 event pairs, 43 based on Foata normal form. 21/1490 useless extension candidates. Maximal degree in co-relation 2069. Up to 144 conditions per place. [2025-04-29 11:11:56,545 INFO L140 encePairwiseOnDemand]: 113/119 looper letters, 12 selfloop transitions, 6 changer transitions 0/133 dead transitions. [2025-04-29 11:11:56,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 133 transitions, 462 flow [2025-04-29 11:11:56,546 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:11:56,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:11:56,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 336 transitions. [2025-04-29 11:11:56,546 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9411764705882353 [2025-04-29 11:11:56,546 INFO L175 Difference]: Start difference. First operand has 133 places, 138 transitions, 489 flow. Second operand 3 states and 336 transitions. [2025-04-29 11:11:56,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 133 transitions, 462 flow [2025-04-29 11:11:56,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 133 transitions, 448 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-04-29 11:11:56,550 INFO L231 Difference]: Finished difference. Result has 133 places, 128 transitions, 393 flow [2025-04-29 11:11:56,551 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=381, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=393, PETRI_PLACES=133, PETRI_TRANSITIONS=128} [2025-04-29 11:11:56,551 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, 11 predicate places. [2025-04-29 11:11:56,551 INFO L485 AbstractCegarLoop]: Abstraction has has 133 places, 128 transitions, 393 flow [2025-04-29 11:11:56,551 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:56,551 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:56,552 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-04-29 11:11:56,552 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-29 11:11:56,552 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-04-29 11:11:56,552 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:56,552 INFO L85 PathProgramCache]: Analyzing trace with hash 321546274, now seen corresponding path program 1 times [2025-04-29 11:11:56,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:56,552 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98872823] [2025-04-29 11:11:56,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:56,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:56,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-04-29 11:11:56,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-04-29 11:11:56,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:56,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:56,578 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 11:11:56,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:56,579 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98872823] [2025-04-29 11:11:56,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98872823] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:56,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:56,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:11:56,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354616518] [2025-04-29 11:11:56,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:56,579 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:11:56,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:56,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:11:56,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:11:56,591 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 119 [2025-04-29 11:11:56,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 128 transitions, 393 flow. Second operand has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:56,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:56,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 119 [2025-04-29 11:11:56,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:56,713 INFO L116 PetriNetUnfolderBase]: 203/1823 cut-off events. [2025-04-29 11:11:56,713 INFO L117 PetriNetUnfolderBase]: For 1333/1398 co-relation queries the response was YES. [2025-04-29 11:11:56,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3398 conditions, 1823 events. 203/1823 cut-off events. For 1333/1398 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 15942 event pairs, 134 based on Foata normal form. 3/1735 useless extension candidates. Maximal degree in co-relation 2856. Up to 435 conditions per place. [2025-04-29 11:11:56,720 INFO L140 encePairwiseOnDemand]: 114/119 looper letters, 25 selfloop transitions, 5 changer transitions 0/133 dead transitions. [2025-04-29 11:11:56,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 133 transitions, 475 flow [2025-04-29 11:11:56,720 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:11:56,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:11:56,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 320 transitions. [2025-04-29 11:11:56,721 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.896358543417367 [2025-04-29 11:11:56,721 INFO L175 Difference]: Start difference. First operand has 133 places, 128 transitions, 393 flow. Second operand 3 states and 320 transitions. [2025-04-29 11:11:56,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 133 transitions, 475 flow [2025-04-29 11:11:56,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 133 transitions, 469 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:11:56,724 INFO L231 Difference]: Finished difference. Result has 136 places, 131 transitions, 427 flow [2025-04-29 11:11:56,724 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=387, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=427, PETRI_PLACES=136, PETRI_TRANSITIONS=131} [2025-04-29 11:11:56,724 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, 14 predicate places. [2025-04-29 11:11:56,724 INFO L485 AbstractCegarLoop]: Abstraction has has 136 places, 131 transitions, 427 flow [2025-04-29 11:11:56,724 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:56,724 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:56,725 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:11:56,725 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-29 11:11:56,725 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-04-29 11:11:56,725 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:56,725 INFO L85 PathProgramCache]: Analyzing trace with hash -949713967, now seen corresponding path program 1 times [2025-04-29 11:11:56,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:56,725 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321032587] [2025-04-29 11:11:56,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:56,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:56,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-04-29 11:11:56,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-04-29 11:11:56,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:56,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:11:56,741 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-29 11:11:56,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-04-29 11:11:56,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-04-29 11:11:56,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:56,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:11:56,763 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-29 11:11:56,765 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-29 11:11:56,765 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2025-04-29 11:11:56,765 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 8 remaining) [2025-04-29 11:11:56,766 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 8 remaining) [2025-04-29 11:11:56,766 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 8 remaining) [2025-04-29 11:11:56,766 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 8 remaining) [2025-04-29 11:11:56,766 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 8 remaining) [2025-04-29 11:11:56,766 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 8 remaining) [2025-04-29 11:11:56,766 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 8 remaining) [2025-04-29 11:11:56,766 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-29 11:11:56,766 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:11:56,767 WARN L247 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-29 11:11:56,767 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-04-29 11:11:56,786 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-29 11:11:56,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 137 transitions, 314 flow [2025-04-29 11:11:56,821 INFO L116 PetriNetUnfolderBase]: 22/537 cut-off events. [2025-04-29 11:11:56,821 INFO L117 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-04-29 11:11:56,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 588 conditions, 537 events. 22/537 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1973 event pairs, 6 based on Foata normal form. 0/474 useless extension candidates. Maximal degree in co-relation 340. Up to 32 conditions per place. [2025-04-29 11:11:56,823 INFO L82 GeneralOperation]: Start removeDead. Operand has 141 places, 137 transitions, 314 flow [2025-04-29 11:11:56,825 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 141 places, 137 transitions, 314 flow [2025-04-29 11:11:56,826 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:11:56,827 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;@45ac2c5f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:11:56,827 INFO L341 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-04-29 11:11:56,828 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:11:56,828 INFO L116 PetriNetUnfolderBase]: 1/42 cut-off events. [2025-04-29 11:11:56,828 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:11:56,828 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:56,828 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] [2025-04-29 11:11:56,828 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:11:56,829 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:56,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1971353261, now seen corresponding path program 1 times [2025-04-29 11:11:56,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:56,829 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852409496] [2025-04-29 11:11:56,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:56,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:56,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-29 11:11:56,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-29 11:11:56,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:56,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:56,842 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:56,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:56,842 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852409496] [2025-04-29 11:11:56,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852409496] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:56,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:56,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:11:56,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074397763] [2025-04-29 11:11:56,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:56,843 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:11:56,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:56,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:11:56,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:11:56,859 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 137 [2025-04-29 11:11:56,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 137 transitions, 314 flow. Second operand has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 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:56,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:56,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 137 [2025-04-29 11:11:56,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:58,318 INFO L116 PetriNetUnfolderBase]: 7859/23219 cut-off events. [2025-04-29 11:11:58,318 INFO L117 PetriNetUnfolderBase]: For 2355/2706 co-relation queries the response was YES. [2025-04-29 11:11:58,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35569 conditions, 23219 events. 7859/23219 cut-off events. For 2355/2706 co-relation queries the response was YES. Maximal size of possible extension queue 772. Compared 267623 event pairs, 4292 based on Foata normal form. 1/21002 useless extension candidates. Maximal degree in co-relation 28335. Up to 7653 conditions per place. [2025-04-29 11:11:58,431 INFO L140 encePairwiseOnDemand]: 129/137 looper letters, 30 selfloop transitions, 6 changer transitions 1/149 dead transitions. [2025-04-29 11:11:58,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 149 transitions, 410 flow [2025-04-29 11:11:58,431 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:11:58,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:11:58,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 377 transitions. [2025-04-29 11:11:58,432 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9172749391727494 [2025-04-29 11:11:58,432 INFO L175 Difference]: Start difference. First operand has 141 places, 137 transitions, 314 flow. Second operand 3 states and 377 transitions. [2025-04-29 11:11:58,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 149 transitions, 410 flow [2025-04-29 11:11:58,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 149 transitions, 410 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:11:58,435 INFO L231 Difference]: Finished difference. Result has 145 places, 140 transitions, 356 flow [2025-04-29 11:11:58,435 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=356, PETRI_PLACES=145, PETRI_TRANSITIONS=140} [2025-04-29 11:11:58,436 INFO L279 CegarLoopForPetriNet]: 141 programPoint places, 4 predicate places. [2025-04-29 11:11:58,436 INFO L485 AbstractCegarLoop]: Abstraction has has 145 places, 140 transitions, 356 flow [2025-04-29 11:11:58,436 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 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:58,436 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:58,436 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] [2025-04-29 11:11:58,436 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-04-29 11:11:58,436 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:11:58,437 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:58,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1547201071, now seen corresponding path program 1 times [2025-04-29 11:11:58,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:58,437 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149181303] [2025-04-29 11:11:58,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:58,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:58,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-29 11:11:58,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-29 11:11:58,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:58,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:58,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:58,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:58,468 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149181303] [2025-04-29 11:11:58,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149181303] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:58,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:58,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:11:58,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301174000] [2025-04-29 11:11:58,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:58,468 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:11:58,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:58,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:11:58,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:11:58,520 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 137 [2025-04-29 11:11:58,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 140 transitions, 356 flow. Second operand has 5 states, 5 states have (on average 110.4) internal successors, (552), 5 states have internal predecessors, (552), 0 states have call successors, (0), 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:58,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:58,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 137 [2025-04-29 11:11:58,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:12:01,304 INFO L116 PetriNetUnfolderBase]: 8788/32696 cut-off events. [2025-04-29 11:12:01,304 INFO L117 PetriNetUnfolderBase]: For 2411/2507 co-relation queries the response was YES. [2025-04-29 11:12:01,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49080 conditions, 32696 events. 8788/32696 cut-off events. For 2411/2507 co-relation queries the response was YES. Maximal size of possible extension queue 874. Compared 418791 event pairs, 5700 based on Foata normal form. 1/28395 useless extension candidates. Maximal degree in co-relation 27076. Up to 9905 conditions per place. [2025-04-29 11:12:01,489 INFO L140 encePairwiseOnDemand]: 129/137 looper letters, 28 selfloop transitions, 2 changer transitions 5/148 dead transitions. [2025-04-29 11:12:01,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 148 transitions, 442 flow [2025-04-29 11:12:01,490 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:12:01,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:12:01,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 690 transitions. [2025-04-29 11:12:01,491 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8394160583941606 [2025-04-29 11:12:01,491 INFO L175 Difference]: Start difference. First operand has 145 places, 140 transitions, 356 flow. Second operand 6 states and 690 transitions. [2025-04-29 11:12:01,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 148 transitions, 442 flow [2025-04-29 11:12:01,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 148 transitions, 430 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:12:01,538 INFO L231 Difference]: Finished difference. Result has 151 places, 141 transitions, 366 flow [2025-04-29 11:12:01,538 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=366, PETRI_PLACES=151, PETRI_TRANSITIONS=141} [2025-04-29 11:12:01,538 INFO L279 CegarLoopForPetriNet]: 141 programPoint places, 10 predicate places. [2025-04-29 11:12:01,538 INFO L485 AbstractCegarLoop]: Abstraction has has 151 places, 141 transitions, 366 flow [2025-04-29 11:12:01,538 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.4) internal successors, (552), 5 states have internal predecessors, (552), 0 states have call successors, (0), 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:12:01,539 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:01,539 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] [2025-04-29 11:12:01,539 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-04-29 11:12:01,539 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:12:01,539 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:01,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1185811823, now seen corresponding path program 1 times [2025-04-29 11:12:01,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:01,539 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330818415] [2025-04-29 11:12:01,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:01,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:01,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-29 11:12:01,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-29 11:12:01,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:01,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:12:01,650 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:12:01,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:12:01,651 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330818415] [2025-04-29 11:12:01,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330818415] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:12:01,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:12:01,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:12:01,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017560008] [2025-04-29 11:12:01,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:12:01,651 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:12:01,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:12:01,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:12:01,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:12:01,725 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 137 [2025-04-29 11:12:01,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 141 transitions, 366 flow. Second operand has 6 states, 6 states have (on average 103.5) internal successors, (621), 6 states have internal predecessors, (621), 0 states have call successors, (0), 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:12:01,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:12:01,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 137 [2025-04-29 11:12:01,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:12:05,050 INFO L116 PetriNetUnfolderBase]: 13637/35801 cut-off events. [2025-04-29 11:12:05,051 INFO L117 PetriNetUnfolderBase]: For 2948/2948 co-relation queries the response was YES. [2025-04-29 11:12:05,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60178 conditions, 35801 events. 13637/35801 cut-off events. For 2948/2948 co-relation queries the response was YES. Maximal size of possible extension queue 1436. Compared 425682 event pairs, 2788 based on Foata normal form. 0/31448 useless extension candidates. Maximal degree in co-relation 27879. Up to 13301 conditions per place. [2025-04-29 11:12:05,271 INFO L140 encePairwiseOnDemand]: 131/137 looper letters, 61 selfloop transitions, 5 changer transitions 0/172 dead transitions. [2025-04-29 11:12:05,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 172 transitions, 560 flow [2025-04-29 11:12:05,272 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:12:05,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:12:05,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 678 transitions. [2025-04-29 11:12:05,273 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8248175182481752 [2025-04-29 11:12:05,273 INFO L175 Difference]: Start difference. First operand has 151 places, 141 transitions, 366 flow. Second operand 6 states and 678 transitions. [2025-04-29 11:12:05,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 172 transitions, 560 flow [2025-04-29 11:12:05,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 172 transitions, 548 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-04-29 11:12:05,303 INFO L231 Difference]: Finished difference. Result has 148 places, 140 transitions, 362 flow [2025-04-29 11:12:05,303 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=362, PETRI_PLACES=148, PETRI_TRANSITIONS=140} [2025-04-29 11:12:05,304 INFO L279 CegarLoopForPetriNet]: 141 programPoint places, 7 predicate places. [2025-04-29 11:12:05,304 INFO L485 AbstractCegarLoop]: Abstraction has has 148 places, 140 transitions, 362 flow [2025-04-29 11:12:05,304 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 103.5) internal successors, (621), 6 states have internal predecessors, (621), 0 states have call successors, (0), 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:12:05,304 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:05,304 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] [2025-04-29 11:12:05,304 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-04-29 11:12:05,305 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:12:05,305 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:05,305 INFO L85 PathProgramCache]: Analyzing trace with hash -28361149, now seen corresponding path program 1 times [2025-04-29 11:12:05,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:05,305 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915639019] [2025-04-29 11:12:05,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:05,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:05,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-29 11:12:05,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-29 11:12:05,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:05,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:12:05,321 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:12:05,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:12:05,321 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915639019] [2025-04-29 11:12:05,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915639019] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:12:05,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:12:05,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:12:05,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085961365] [2025-04-29 11:12:05,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:12:05,322 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:12:05,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:12:05,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:12:05,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:12:05,338 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 137 [2025-04-29 11:12:05,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 140 transitions, 362 flow. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 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:12:05,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:12:05,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 137 [2025-04-29 11:12:05,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:12:08,547 INFO L116 PetriNetUnfolderBase]: 13629/40860 cut-off events. [2025-04-29 11:12:08,547 INFO L117 PetriNetUnfolderBase]: For 10476/13535 co-relation queries the response was YES. [2025-04-29 11:12:08,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70260 conditions, 40860 events. 13629/40860 cut-off events. For 10476/13535 co-relation queries the response was YES. Maximal size of possible extension queue 1516. Compared 523339 event pairs, 7860 based on Foata normal form. 36/36071 useless extension candidates. Maximal degree in co-relation 58384. Up to 15880 conditions per place. [2025-04-29 11:12:08,844 INFO L140 encePairwiseOnDemand]: 129/137 looper letters, 39 selfloop transitions, 11 changer transitions 0/161 dead transitions. [2025-04-29 11:12:08,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 161 transitions, 548 flow [2025-04-29 11:12:08,846 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:12:08,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:12:08,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 377 transitions. [2025-04-29 11:12:08,847 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9172749391727494 [2025-04-29 11:12:08,847 INFO L175 Difference]: Start difference. First operand has 148 places, 140 transitions, 362 flow. Second operand 3 states and 377 transitions. [2025-04-29 11:12:08,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 161 transitions, 548 flow [2025-04-29 11:12:08,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 161 transitions, 538 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:12:08,852 INFO L231 Difference]: Finished difference. Result has 147 places, 149 transitions, 448 flow [2025-04-29 11:12:08,852 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=448, PETRI_PLACES=147, PETRI_TRANSITIONS=149} [2025-04-29 11:12:08,853 INFO L279 CegarLoopForPetriNet]: 141 programPoint places, 6 predicate places. [2025-04-29 11:12:08,853 INFO L485 AbstractCegarLoop]: Abstraction has has 147 places, 149 transitions, 448 flow [2025-04-29 11:12:08,853 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 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:12:08,853 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:08,854 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, 1] [2025-04-29 11:12:08,854 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-04-29 11:12:08,854 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:12:08,854 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:08,854 INFO L85 PathProgramCache]: Analyzing trace with hash -280110260, now seen corresponding path program 1 times [2025-04-29 11:12:08,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:08,855 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708895840] [2025-04-29 11:12:08,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:08,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:08,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-04-29 11:12:08,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-04-29 11:12:08,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:08,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:12:09,030 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:12:09,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:12:09,031 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708895840] [2025-04-29 11:12:09,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708895840] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:12:09,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:12:09,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:12:09,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741101274] [2025-04-29 11:12:09,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:12:09,031 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:12:09,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:12:09,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:12:09,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:12:09,112 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 137 [2025-04-29 11:12:09,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 149 transitions, 448 flow. Second operand has 6 states, 6 states have (on average 106.16666666666667) internal successors, (637), 6 states have internal predecessors, (637), 0 states have call successors, (0), 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:12:09,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:12:09,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 137 [2025-04-29 11:12:09,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:12:12,924 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([550] L24-4-->L24-5: Formula: (= |v_#race~data~0_4| |v_threadThread3of4ForFork0_#t~nondet2_3|) InVars {threadThread3of4ForFork0_#t~nondet2=|v_threadThread3of4ForFork0_#t~nondet2_3|} OutVars{threadThread3of4ForFork0_#t~nondet2=|v_threadThread3of4ForFork0_#t~nondet2_3|, #race~data~0=|v_#race~data~0_4|} AuxVars[] AssignedVars[#race~data~0][146], [Black: 168#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet2|), 77#L24-5true, 41#L23-3true, 107#L25true, 166#true, 125#L47-1true, 136#true, 171#true, Black: 146#(= |#race~data~0| 0), 140#true, Black: 151#(= |ULTIMATE.start_main_~i~0#1| 0), 141#true, 138#true]) [2025-04-29 11:12:12,924 INFO L286 olderBase$Statistics]: this new event has 144 ancestors and is cut-off event [2025-04-29 11:12:12,925 INFO L289 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2025-04-29 11:12:12,925 INFO L289 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2025-04-29 11:12:12,925 INFO L289 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-04-29 11:12:13,064 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([598] L24-4-->L24-5: Formula: (= |v_threadThread4of4ForFork0_#t~nondet2_3| |v_#race~data~0_4|) InVars {threadThread4of4ForFork0_#t~nondet2=|v_threadThread4of4ForFork0_#t~nondet2_3|} OutVars{threadThread4of4ForFork0_#t~nondet2=|v_threadThread4of4ForFork0_#t~nondet2_3|, #race~data~0=|v_#race~data~0_4|} AuxVars[] AssignedVars[#race~data~0][178], [72#L24-6true, Black: 168#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet2|), 77#L24-5true, 137#true, 166#true, 125#L47-1true, 136#true, 171#true, Black: 146#(= |#race~data~0| 0), 140#true, Black: 151#(= |ULTIMATE.start_main_~i~0#1| 0), 7#L24-5true, 142#true]) [2025-04-29 11:12:13,064 INFO L286 olderBase$Statistics]: this new event has 148 ancestors and is cut-off event [2025-04-29 11:12:13,064 INFO L289 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2025-04-29 11:12:13,064 INFO L289 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2025-04-29 11:12:13,064 INFO L289 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2025-04-29 11:12:13,132 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([550] L24-4-->L24-5: Formula: (= |v_#race~data~0_4| |v_threadThread3of4ForFork0_#t~nondet2_3|) InVars {threadThread3of4ForFork0_#t~nondet2=|v_threadThread3of4ForFork0_#t~nondet2_3|} OutVars{threadThread3of4ForFork0_#t~nondet2=|v_threadThread3of4ForFork0_#t~nondet2_3|, #race~data~0=|v_#race~data~0_4|} AuxVars[] AssignedVars[#race~data~0][146], [Black: 168#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet2|), 18#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 77#L24-5true, 166#true, 125#L47-1true, 136#true, 171#true, Black: 146#(= |#race~data~0| 0), 140#true, Black: 151#(= |ULTIMATE.start_main_~i~0#1| 0), 141#true, 138#true, 48#L24-5true]) [2025-04-29 11:12:13,132 INFO L286 olderBase$Statistics]: this new event has 148 ancestors and is cut-off event [2025-04-29 11:12:13,132 INFO L289 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2025-04-29 11:12:13,132 INFO L289 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2025-04-29 11:12:13,132 INFO L289 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2025-04-29 11:12:13,607 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([598] L24-4-->L24-5: Formula: (= |v_threadThread4of4ForFork0_#t~nondet2_3| |v_#race~data~0_4|) InVars {threadThread4of4ForFork0_#t~nondet2=|v_threadThread4of4ForFork0_#t~nondet2_3|} OutVars{threadThread4of4ForFork0_#t~nondet2=|v_threadThread4of4ForFork0_#t~nondet2_3|, #race~data~0=|v_#race~data~0_4|} AuxVars[] AssignedVars[#race~data~0][173], [Black: 168#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet2|), 77#L24-5true, 137#true, 107#L25true, 166#true, 125#L47-1true, 136#true, 171#true, Black: 146#(= |#race~data~0| 0), 140#true, Black: 151#(= |ULTIMATE.start_main_~i~0#1| 0), 7#L24-5true, 142#true]) [2025-04-29 11:12:13,608 INFO L286 olderBase$Statistics]: this new event has 150 ancestors and is not cut-off event [2025-04-29 11:12:13,608 INFO L289 olderBase$Statistics]: existing Event has 150 ancestors and is not cut-off event [2025-04-29 11:12:13,608 INFO L289 olderBase$Statistics]: existing Event has 150 ancestors and is not cut-off event [2025-04-29 11:12:13,608 INFO L289 olderBase$Statistics]: existing Event has 150 ancestors and is not cut-off event [2025-04-29 11:12:14,063 INFO L116 PetriNetUnfolderBase]: 19867/57265 cut-off events. [2025-04-29 11:12:14,063 INFO L117 PetriNetUnfolderBase]: For 9506/13369 co-relation queries the response was YES. [2025-04-29 11:12:14,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100054 conditions, 57265 events. 19867/57265 cut-off events. For 9506/13369 co-relation queries the response was YES. Maximal size of possible extension queue 1944. Compared 750944 event pairs, 9574 based on Foata normal form. 157/50162 useless extension candidates. Maximal degree in co-relation 79202. Up to 12590 conditions per place. [2025-04-29 11:12:14,781 INFO L140 encePairwiseOnDemand]: 131/137 looper letters, 58 selfloop transitions, 5 changer transitions 0/180 dead transitions. [2025-04-29 11:12:14,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 180 transitions, 636 flow [2025-04-29 11:12:14,782 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:12:14,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:12:14,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 688 transitions. [2025-04-29 11:12:14,783 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8369829683698297 [2025-04-29 11:12:14,783 INFO L175 Difference]: Start difference. First operand has 147 places, 149 transitions, 448 flow. Second operand 6 states and 688 transitions. [2025-04-29 11:12:14,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 180 transitions, 636 flow [2025-04-29 11:12:14,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 180 transitions, 614 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:12:14,839 INFO L231 Difference]: Finished difference. Result has 149 places, 148 transitions, 434 flow [2025-04-29 11:12:14,840 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=434, PETRI_PLACES=149, PETRI_TRANSITIONS=148} [2025-04-29 11:12:14,840 INFO L279 CegarLoopForPetriNet]: 141 programPoint places, 8 predicate places. [2025-04-29 11:12:14,840 INFO L485 AbstractCegarLoop]: Abstraction has has 149 places, 148 transitions, 434 flow [2025-04-29 11:12:14,840 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 106.16666666666667) internal successors, (637), 6 states have internal predecessors, (637), 0 states have call successors, (0), 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:12:14,840 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:14,840 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, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:12:14,840 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-04-29 11:12:14,840 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:12:14,841 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:14,841 INFO L85 PathProgramCache]: Analyzing trace with hash -780175658, now seen corresponding path program 1 times [2025-04-29 11:12:14,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:14,841 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503764573] [2025-04-29 11:12:14,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:14,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:14,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-04-29 11:12:14,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-04-29 11:12:14,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:14,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:12:14,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:12:14,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:12:14,891 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503764573] [2025-04-29 11:12:14,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503764573] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:12:14,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:12:14,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 11:12:14,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111889011] [2025-04-29 11:12:14,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:12:14,892 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:12:14,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:12:14,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:12:14,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:12:14,963 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 137 [2025-04-29 11:12:14,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 148 transitions, 434 flow. Second operand has 6 states, 6 states have (on average 110.16666666666667) internal successors, (661), 6 states have internal predecessors, (661), 0 states have call successors, (0), 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:12:14,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:12:14,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 137 [2025-04-29 11:12:14,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:12:16,834 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([598] L24-4-->L24-5: Formula: (= |v_threadThread4of4ForFork0_#t~nondet2_3| |v_#race~data~0_4|) InVars {threadThread4of4ForFork0_#t~nondet2=|v_threadThread4of4ForFork0_#t~nondet2_3|} OutVars{threadThread4of4ForFork0_#t~nondet2=|v_threadThread4of4ForFork0_#t~nondet2_3|, #race~data~0=|v_#race~data~0_4|} AuxVars[] AssignedVars[#race~data~0][169], [72#L24-6true, Black: 168#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet2|), 77#L24-5true, 137#true, 125#L47-1true, 136#true, 171#true, 140#true, Black: 146#(= |#race~data~0| 0), Black: 151#(= |ULTIMATE.start_main_~i~0#1| 0), 181#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), 7#L24-5true, 142#true]) [2025-04-29 11:12:16,834 INFO L286 olderBase$Statistics]: this new event has 148 ancestors and is cut-off event [2025-04-29 11:12:16,834 INFO L289 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2025-04-29 11:12:16,834 INFO L289 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2025-04-29 11:12:16,835 INFO L289 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2025-04-29 11:12:17,503 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([598] L24-4-->L24-5: Formula: (= |v_threadThread4of4ForFork0_#t~nondet2_3| |v_#race~data~0_4|) InVars {threadThread4of4ForFork0_#t~nondet2=|v_threadThread4of4ForFork0_#t~nondet2_3|} OutVars{threadThread4of4ForFork0_#t~nondet2=|v_threadThread4of4ForFork0_#t~nondet2_3|, #race~data~0=|v_#race~data~0_4|} AuxVars[] AssignedVars[#race~data~0][168], [Black: 168#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet2|), 77#L24-5true, 137#true, 107#L25true, 125#L47-1true, 136#true, 171#true, 140#true, Black: 146#(= |#race~data~0| 0), Black: 151#(= |ULTIMATE.start_main_~i~0#1| 0), 181#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), 7#L24-5true, 142#true]) [2025-04-29 11:12:17,504 INFO L286 olderBase$Statistics]: this new event has 150 ancestors and is not cut-off event [2025-04-29 11:12:17,504 INFO L289 olderBase$Statistics]: existing Event has 150 ancestors and is not cut-off event [2025-04-29 11:12:17,504 INFO L289 olderBase$Statistics]: existing Event has 150 ancestors and is not cut-off event [2025-04-29 11:12:17,504 INFO L289 olderBase$Statistics]: existing Event has 150 ancestors and is not cut-off event [2025-04-29 11:12:17,964 INFO L116 PetriNetUnfolderBase]: 10179/35960 cut-off events. [2025-04-29 11:12:17,964 INFO L117 PetriNetUnfolderBase]: For 6336/8327 co-relation queries the response was YES. [2025-04-29 11:12:18,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61249 conditions, 35960 events. 10179/35960 cut-off events. For 6336/8327 co-relation queries the response was YES. Maximal size of possible extension queue 1063. Compared 468856 event pairs, 5178 based on Foata normal form. 284/32308 useless extension candidates. Maximal degree in co-relation 34481. Up to 7878 conditions per place. [2025-04-29 11:12:18,205 INFO L140 encePairwiseOnDemand]: 130/137 looper letters, 47 selfloop transitions, 6 changer transitions 0/172 dead transitions. [2025-04-29 11:12:18,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 172 transitions, 602 flow [2025-04-29 11:12:18,205 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:12:18,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:12:18,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 702 transitions. [2025-04-29 11:12:18,206 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8540145985401459 [2025-04-29 11:12:18,206 INFO L175 Difference]: Start difference. First operand has 149 places, 148 transitions, 434 flow. Second operand 6 states and 702 transitions. [2025-04-29 11:12:18,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 172 transitions, 602 flow [2025-04-29 11:12:18,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 172 transitions, 590 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:12:18,219 INFO L231 Difference]: Finished difference. Result has 151 places, 150 transitions, 450 flow [2025-04-29 11:12:18,220 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=450, PETRI_PLACES=151, PETRI_TRANSITIONS=150} [2025-04-29 11:12:18,220 INFO L279 CegarLoopForPetriNet]: 141 programPoint places, 10 predicate places. [2025-04-29 11:12:18,220 INFO L485 AbstractCegarLoop]: Abstraction has has 151 places, 150 transitions, 450 flow [2025-04-29 11:12:18,220 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.16666666666667) internal successors, (661), 6 states have internal predecessors, (661), 0 states have call successors, (0), 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:12:18,220 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:18,221 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:12:18,221 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-04-29 11:12:18,221 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:12:18,221 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:18,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1831934031, now seen corresponding path program 1 times [2025-04-29 11:12:18,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:18,221 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438876164] [2025-04-29 11:12:18,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:18,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:18,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-04-29 11:12:18,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-04-29 11:12:18,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:18,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:12:18,243 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:12:18,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:12:18,243 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438876164] [2025-04-29 11:12:18,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438876164] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:12:18,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:12:18,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:12:18,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621201240] [2025-04-29 11:12:18,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:12:18,244 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:12:18,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:12:18,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:12:18,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:12:18,261 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 137 [2025-04-29 11:12:18,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 150 transitions, 450 flow. Second operand has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:12:18,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:12:18,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 137 [2025-04-29 11:12:18,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:12:21,734 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([472] L45-1-->L47: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][152], [72#L24-6true, 139#true, Black: 168#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet2|), Black: 144#true, 108#L25true, 136#true, 38#L47true, Black: 182#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), 185#true, Black: 151#(= |ULTIMATE.start_main_~i~0#1| 0), 141#true, 181#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), 138#true, Black: 179#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2025-04-29 11:12:21,735 INFO L286 olderBase$Statistics]: this new event has 167 ancestors and is cut-off event [2025-04-29 11:12:21,735 INFO L289 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2025-04-29 11:12:21,735 INFO L289 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2025-04-29 11:12:21,735 INFO L289 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2025-04-29 11:12:21,741 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([472] L45-1-->L47: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][152], [72#L24-6true, 139#true, Black: 168#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet2|), 86#L25-3true, Black: 144#true, 38#L47true, 136#true, Black: 182#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), 185#true, Black: 151#(= |ULTIMATE.start_main_~i~0#1| 0), 141#true, 181#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), 138#true, Black: 179#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2025-04-29 11:12:21,741 INFO L286 olderBase$Statistics]: this new event has 168 ancestors and is cut-off event [2025-04-29 11:12:21,741 INFO L289 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-04-29 11:12:21,741 INFO L289 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-04-29 11:12:21,741 INFO L289 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-04-29 11:12:21,777 INFO L116 PetriNetUnfolderBase]: 11773/38286 cut-off events. [2025-04-29 11:12:21,778 INFO L117 PetriNetUnfolderBase]: For 22091/23850 co-relation queries the response was YES. [2025-04-29 11:12:21,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74353 conditions, 38286 events. 11773/38286 cut-off events. For 22091/23850 co-relation queries the response was YES. Maximal size of possible extension queue 1515. Compared 514706 event pairs, 6499 based on Foata normal form. 24/34720 useless extension candidates. Maximal degree in co-relation 67309. Up to 13617 conditions per place. [2025-04-29 11:12:22,029 INFO L140 encePairwiseOnDemand]: 129/137 looper letters, 43 selfloop transitions, 18 changer transitions 0/175 dead transitions. [2025-04-29 11:12:22,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 175 transitions, 695 flow [2025-04-29 11:12:22,030 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:12:22,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:12:22,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 376 transitions. [2025-04-29 11:12:22,030 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9148418491484185 [2025-04-29 11:12:22,030 INFO L175 Difference]: Start difference. First operand has 151 places, 150 transitions, 450 flow. Second operand 3 states and 376 transitions. [2025-04-29 11:12:22,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 175 transitions, 695 flow [2025-04-29 11:12:22,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 175 transitions, 687 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-29 11:12:22,041 INFO L231 Difference]: Finished difference. Result has 152 places, 164 transitions, 620 flow [2025-04-29 11:12:22,041 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=442, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=620, PETRI_PLACES=152, PETRI_TRANSITIONS=164} [2025-04-29 11:12:22,042 INFO L279 CegarLoopForPetriNet]: 141 programPoint places, 11 predicate places. [2025-04-29 11:12:22,042 INFO L485 AbstractCegarLoop]: Abstraction has has 152 places, 164 transitions, 620 flow [2025-04-29 11:12:22,042 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:12:22,042 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:22,042 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:12:22,042 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-04-29 11:12:22,042 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:12:22,042 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:22,042 INFO L85 PathProgramCache]: Analyzing trace with hash 967260355, now seen corresponding path program 1 times [2025-04-29 11:12:22,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:22,042 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866200617] [2025-04-29 11:12:22,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:22,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:22,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-04-29 11:12:22,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-29 11:12:22,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:22,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:12:22,087 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:12:22,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:12:22,087 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866200617] [2025-04-29 11:12:22,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866200617] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:12:22,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:12:22,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:12:22,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040698733] [2025-04-29 11:12:22,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:12:22,088 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:12:22,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:12:22,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:12:22,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:12:22,092 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 137 [2025-04-29 11:12:22,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 164 transitions, 620 flow. Second operand has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 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:12:22,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:12:22,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 137 [2025-04-29 11:12:22,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:12:22,517 INFO L116 PetriNetUnfolderBase]: 660/6287 cut-off events. [2025-04-29 11:12:22,517 INFO L117 PetriNetUnfolderBase]: For 3388/3948 co-relation queries the response was YES. [2025-04-29 11:12:22,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10684 conditions, 6287 events. 660/6287 cut-off events. For 3388/3948 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 72243 event pairs, 237 based on Foata normal form. 177/6087 useless extension candidates. Maximal degree in co-relation 8380. Up to 678 conditions per place. [2025-04-29 11:12:22,545 INFO L140 encePairwiseOnDemand]: 129/137 looper letters, 16 selfloop transitions, 8 changer transitions 0/154 dead transitions. [2025-04-29 11:12:22,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 154 transitions, 553 flow [2025-04-29 11:12:22,546 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:12:22,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:12:22,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 385 transitions. [2025-04-29 11:12:22,546 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9367396593673966 [2025-04-29 11:12:22,546 INFO L175 Difference]: Start difference. First operand has 152 places, 164 transitions, 620 flow. Second operand 3 states and 385 transitions. [2025-04-29 11:12:22,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 154 transitions, 553 flow [2025-04-29 11:12:22,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 154 transitions, 539 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-04-29 11:12:22,553 INFO L231 Difference]: Finished difference. Result has 152 places, 147 transitions, 460 flow [2025-04-29 11:12:22,553 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=444, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=460, PETRI_PLACES=152, PETRI_TRANSITIONS=147} [2025-04-29 11:12:22,554 INFO L279 CegarLoopForPetriNet]: 141 programPoint places, 11 predicate places. [2025-04-29 11:12:22,554 INFO L485 AbstractCegarLoop]: Abstraction has has 152 places, 147 transitions, 460 flow [2025-04-29 11:12:22,554 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 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:12:22,554 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:22,554 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-04-29 11:12:22,554 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-04-29 11:12:22,554 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:12:22,555 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:22,555 INFO L85 PathProgramCache]: Analyzing trace with hash -191009070, now seen corresponding path program 1 times [2025-04-29 11:12:22,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:22,555 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723522861] [2025-04-29 11:12:22,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:22,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:22,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-04-29 11:12:22,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-04-29 11:12:22,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:22,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:12:22,580 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 11:12:22,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:12:22,580 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723522861] [2025-04-29 11:12:22,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723522861] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:12:22,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:12:22,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:12:22,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035502547] [2025-04-29 11:12:22,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:12:22,581 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:12:22,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:12:22,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:12:22,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:12:22,597 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 137 [2025-04-29 11:12:22,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 147 transitions, 460 flow. Second operand has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 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:12:22,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:12:22,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 137 [2025-04-29 11:12:22,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:12:23,373 INFO L116 PetriNetUnfolderBase]: 1114/7638 cut-off events. [2025-04-29 11:12:23,373 INFO L117 PetriNetUnfolderBase]: For 6402/6563 co-relation queries the response was YES. [2025-04-29 11:12:23,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14825 conditions, 7638 events. 1114/7638 cut-off events. For 6402/6563 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 91012 event pairs, 714 based on Foata normal form. 7/7128 useless extension candidates. Maximal degree in co-relation 11704. Up to 2065 conditions per place. [2025-04-29 11:12:23,410 INFO L140 encePairwiseOnDemand]: 132/137 looper letters, 33 selfloop transitions, 5 changer transitions 0/154 dead transitions. [2025-04-29 11:12:23,410 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 154 transitions, 574 flow [2025-04-29 11:12:23,411 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:12:23,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:12:23,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 366 transitions. [2025-04-29 11:12:23,411 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8905109489051095 [2025-04-29 11:12:23,411 INFO L175 Difference]: Start difference. First operand has 152 places, 147 transitions, 460 flow. Second operand 3 states and 366 transitions. [2025-04-29 11:12:23,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 154 transitions, 574 flow [2025-04-29 11:12:23,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 154 transitions, 566 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:12:23,416 INFO L231 Difference]: Finished difference. Result has 155 places, 150 transitions, 492 flow [2025-04-29 11:12:23,416 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=452, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=492, PETRI_PLACES=155, PETRI_TRANSITIONS=150} [2025-04-29 11:12:23,416 INFO L279 CegarLoopForPetriNet]: 141 programPoint places, 14 predicate places. [2025-04-29 11:12:23,416 INFO L485 AbstractCegarLoop]: Abstraction has has 155 places, 150 transitions, 492 flow [2025-04-29 11:12:23,417 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 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:12:23,417 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:23,417 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:12:23,417 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-04-29 11:12:23,417 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:12:23,417 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:23,417 INFO L85 PathProgramCache]: Analyzing trace with hash -307872802, now seen corresponding path program 1 times [2025-04-29 11:12:23,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:23,417 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897999405] [2025-04-29 11:12:23,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:23,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:23,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-04-29 11:12:23,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-04-29 11:12:23,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:23,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:12:23,447 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-29 11:12:23,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:12:23,448 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897999405] [2025-04-29 11:12:23,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897999405] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:12:23,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:12:23,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:12:23,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733634294] [2025-04-29 11:12:23,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:12:23,448 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:12:23,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:12:23,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:12:23,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:12:23,462 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 137 [2025-04-29 11:12:23,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 150 transitions, 492 flow. Second operand has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 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:12:23,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:12:23,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 137 [2025-04-29 11:12:23,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:12:24,240 INFO L116 PetriNetUnfolderBase]: 1121/7924 cut-off events. [2025-04-29 11:12:24,240 INFO L117 PetriNetUnfolderBase]: For 8503/8655 co-relation queries the response was YES. [2025-04-29 11:12:24,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15847 conditions, 7924 events. 1121/7924 cut-off events. For 8503/8655 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 95354 event pairs, 707 based on Foata normal form. 4/7478 useless extension candidates. Maximal degree in co-relation 12732. Up to 2095 conditions per place. [2025-04-29 11:12:24,282 INFO L140 encePairwiseOnDemand]: 132/137 looper letters, 33 selfloop transitions, 5 changer transitions 0/156 dead transitions. [2025-04-29 11:12:24,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 156 transitions, 597 flow [2025-04-29 11:12:24,283 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:12:24,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:12:24,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 365 transitions. [2025-04-29 11:12:24,283 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8880778588807786 [2025-04-29 11:12:24,283 INFO L175 Difference]: Start difference. First operand has 155 places, 150 transitions, 492 flow. Second operand 3 states and 365 transitions. [2025-04-29 11:12:24,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 156 transitions, 597 flow [2025-04-29 11:12:24,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 156 transitions, 583 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-04-29 11:12:24,290 INFO L231 Difference]: Finished difference. Result has 157 places, 153 transitions, 520 flow [2025-04-29 11:12:24,290 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=520, PETRI_PLACES=157, PETRI_TRANSITIONS=153} [2025-04-29 11:12:24,291 INFO L279 CegarLoopForPetriNet]: 141 programPoint places, 16 predicate places. [2025-04-29 11:12:24,291 INFO L485 AbstractCegarLoop]: Abstraction has has 157 places, 153 transitions, 520 flow [2025-04-29 11:12:24,291 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 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:12:24,291 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:24,291 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:24,291 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-04-29 11:12:24,291 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:12:24,291 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:24,291 INFO L85 PathProgramCache]: Analyzing trace with hash -91396816, now seen corresponding path program 1 times [2025-04-29 11:12:24,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:24,292 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562322608] [2025-04-29 11:12:24,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:24,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:24,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-04-29 11:12:24,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-04-29 11:12:24,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:24,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:12:24,310 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-29 11:12:24,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-04-29 11:12:24,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-04-29 11:12:24,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:24,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:12:24,340 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-29 11:12:24,341 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-29 11:12:24,341 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (8 of 9 remaining) [2025-04-29 11:12:24,341 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2025-04-29 11:12:24,341 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2025-04-29 11:12:24,341 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2025-04-29 11:12:24,341 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 9 remaining) [2025-04-29 11:12:24,341 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2025-04-29 11:12:24,341 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2025-04-29 11:12:24,341 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2025-04-29 11:12:24,342 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2025-04-29 11:12:24,342 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-04-29 11:12:24,342 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:12:24,431 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 4 thread instances [2025-04-29 11:12:24,431 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-29 11:12:24,440 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.04 11:12:24 BasicIcfg [2025-04-29 11:12:24,440 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-29 11:12:24,441 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-29 11:12:24,441 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-29 11:12:24,441 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-29 11:12:24,442 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:11:47" (3/4) ... [2025-04-29 11:12:24,443 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-04-29 11:12:24,520 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 9. [2025-04-29 11:12:24,558 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-29 11:12:24,558 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-29 11:12:24,558 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-29 11:12:24,559 INFO L158 Benchmark]: Toolchain (without parser) took 37266.07ms. Allocated memory was 142.6MB in the beginning and 11.7GB in the end (delta: 11.5GB). Free memory was 112.4MB in the beginning and 8.4GB in the end (delta: -8.3GB). Peak memory consumption was 3.3GB. Max. memory is 16.1GB. [2025-04-29 11:12:24,559 INFO L158 Benchmark]: CDTParser took 0.73ms. Allocated memory is still 201.3MB. Free memory is still 122.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:12:24,559 INFO L158 Benchmark]: CACSL2BoogieTranslator took 206.10ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 98.4MB in the end (delta: 14.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-29 11:12:24,559 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.37ms. Allocated memory is still 142.6MB. Free memory was 98.4MB in the beginning and 96.9MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-29 11:12:24,560 INFO L158 Benchmark]: Boogie Preprocessor took 25.87ms. Allocated memory is still 142.6MB. Free memory was 96.9MB in the beginning and 95.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:12:24,560 INFO L158 Benchmark]: RCFGBuilder took 319.58ms. Allocated memory is still 142.6MB. Free memory was 95.4MB in the beginning and 81.5MB in the end (delta: 13.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-29 11:12:24,560 INFO L158 Benchmark]: TraceAbstraction took 36564.51ms. Allocated memory was 142.6MB in the beginning and 11.7GB in the end (delta: 11.5GB). Free memory was 80.6MB in the beginning and 8.4GB in the end (delta: -8.4GB). Peak memory consumption was 3.2GB. Max. memory is 16.1GB. [2025-04-29 11:12:24,561 INFO L158 Benchmark]: Witness Printer took 116.83ms. Allocated memory is still 11.7GB. Free memory was 8.4GB in the beginning and 8.4GB in the end (delta: 29.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-04-29 11:12:24,563 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.73ms. Allocated memory is still 201.3MB. Free memory is still 122.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 206.10ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 98.4MB in the end (delta: 14.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.37ms. Allocated memory is still 142.6MB. Free memory was 98.4MB in the beginning and 96.9MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.87ms. Allocated memory is still 142.6MB. Free memory was 96.9MB in the beginning and 95.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 319.58ms. Allocated memory is still 142.6MB. Free memory was 95.4MB in the beginning and 81.5MB in the end (delta: 13.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 36564.51ms. Allocated memory was 142.6MB in the beginning and 11.7GB in the end (delta: 11.5GB). Free memory was 80.6MB in the beginning and 8.4GB in the end (delta: -8.4GB). Peak memory consumption was 3.2GB. Max. memory is 16.1GB. * Witness Printer took 116.83ms. Allocated memory is still 11.7GB. Free memory was 8.4GB in the beginning and 8.4GB in the end (delta: 29.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 24]: Data race detected Data race detected The following path leads to a data race: [L19] 0 int data = 0; VAL [data=0] [L20] 0 pthread_mutex_t data_mutex = PTHREAD_MUTEX_INITIALIZER; VAL [data=0, data_mutex={1:0}] [L30] 0 int threads_total = __VERIFIER_nondet_int(); VAL [data=0, data_mutex={1:0}, threads_total=2] [L31] CALL 0 assume_abort_if_not(threads_total >= 0) [L15] COND FALSE 0 !(!cond) VAL [\at(cond, Pre)=1, cond=1, data=0, data_mutex={1:0}] [L31] RET 0 assume_abort_if_not(threads_total >= 0) [L33] 0 pthread_t *tids = malloc(threads_total * sizeof(pthread_t)); VAL [data=0, data_mutex={1:0}, threads_total=2, tids={-2:0}] [L36] 0 int i = 0; VAL [data=0, data_mutex={1:0}, i=0, threads_total=2, tids={-2:0}] [L36] COND TRUE 0 i < threads_total VAL [data=0, data_mutex={1:0}] [L37] 0 pthread_create(&tids[i], NULL, &thread, NULL) VAL [data=0, data_mutex={1:0}, i=0, threads_total=2, tids={-2:0}] [L37] FCALL, FORK 0 pthread_create(&tids[i], NULL, &thread, NULL) VAL [\at(arg, Pre)={0:0}, data=0, data_mutex={1:0}, i=0, threads_total=2, tids={-2:0}] [L36] 0 i++ VAL [\at(arg, Pre)={0:0}, data=0, data_mutex={1:0}, i=1, threads_total=2, tids={-2:0}] [L36] COND TRUE 0 i < threads_total VAL [\at(arg, Pre)={0:0}, data=0, data_mutex={1:0}] [L37] 0 pthread_create(&tids[i], NULL, &thread, NULL) VAL [\at(arg, Pre)={0:0}, data=0, data_mutex={1:0}, i=1, threads_total=2, tids={-2:0}] [L37] FCALL, FORK 0 pthread_create(&tids[i], NULL, &thread, NULL) VAL [\at(arg, Pre)={0:0}, data=0, data_mutex={1:0}, i=1, threads_total=2, tids={-2:0}] [L24] 1 data = __VERIFIER_nondet_int() VAL [\at(arg, Pre)={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L36] 0 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=2, tids={-2:0}] [L36] COND FALSE 0 !(i < threads_total) VAL [\at(arg, Pre)={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L41] 0 int i = 0; VAL [\at(arg, Pre)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=0, threads_total=2, tids={-2:0}] [L41] COND TRUE 0 i < threads_total VAL [\at(arg, Pre)={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L42] EXPR 0 tids[i] VAL [\at(arg, Pre)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=0, threads_total=2, tids={-2:0}] [L42] 0 pthread_join(tids[i], NULL) VAL [\at(arg, Pre)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=0, threads_total=2, tids={-2:0}] [L26] 1 return NULL; VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L42] FCALL, JOIN 1 pthread_join(tids[i], NULL) VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=0, threads_total=2, tids={-2:0}] [L24] 2 data = __VERIFIER_nondet_int() VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L41] 0 i += 2 VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=2, tids={-2:0}] [L41] COND FALSE 0 !(i < threads_total) VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L47] 0 return data; VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, threads_total=2, tids={-2:0}] [L24] 2 data = __VERIFIER_nondet_int() VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}] Now there is a data race on ~data~0 between C: return data; [47] and C: data = __VERIFIER_nondet_int() [24] - UnprovableResult [Line: 47]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 42]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 37]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 37]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 99 locations, 101 edges, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.0s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 262 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 169 mSDsluCounter, 93 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 53 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 412 IncrementalHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 40 mSDtfsCounter, 412 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=209occurred in iteration=4, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 235 NumberOfCodeBlocks, 235 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 180 ConstructedInterpolants, 0 QuantifiedInterpolants, 426 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 1/1 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 116 locations, 119 edges, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.9s, OverallIterations: 8, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 467 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 301 mSDsluCounter, 242 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 136 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 733 IncrementalHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 106 mSDtfsCounter, 733 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=342occurred in iteration=7, InterpolantAutomatonStates: 33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 366 NumberOfCodeBlocks, 366 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 292 ConstructedInterpolants, 0 QuantifiedInterpolants, 642 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 3/3 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 3 thread instances CFG has 5 procedures, 133 locations, 137 edges, 8 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.9s, OverallIterations: 10, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 538 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 353 mSDsluCounter, 159 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 110 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 911 IncrementalHoareTripleChecker+Invalid, 938 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 49 mSDtfsCounter, 911 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=489occurred in iteration=7, InterpolantAutomatonStates: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 526 NumberOfCodeBlocks, 526 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 433 ConstructedInterpolants, 0 QuantifiedInterpolants, 827 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 8/8 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 4 thread instances CFG has 6 procedures, 150 locations, 155 edges, 9 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 27.6s, OverallIterations: 11, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 26.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 702 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 434 mSDsluCounter, 200 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 134 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1118 IncrementalHoareTripleChecker+Invalid, 1145 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 66 mSDtfsCounter, 1118 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=620occurred in iteration=7, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 632 NumberOfCodeBlocks, 632 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 525 ConstructedInterpolants, 0 QuantifiedInterpolants, 921 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 12/12 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-04-29 11:12:24,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(DATA-RACE)