./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/pthread-race-challenges/thread-join-array-const-race-2.i --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-const-race-2.i -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 860528881155a718438c0581485d42cc235131c30c9ba38f0a976304f206e75d --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:30:09,122 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:30:09,167 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-04-30 10:30:09,173 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:30:09,174 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:30:09,193 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:30:09,193 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:30:09,193 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:30:09,194 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:30:09,194 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:30:09,195 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:30:09,195 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:30:09,195 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:30:09,195 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:30:09,196 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-30 10:30:09,196 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:30:09,196 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:30:09,196 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:30:09,196 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:30:09,196 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-30 10:30:09,196 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:30:09,196 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-30 10:30:09,196 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-04-30 10:30:09,196 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:30:09,196 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:30:09,197 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-30 10:30:09,197 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:30:09,197 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:30:09,197 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:30:09,197 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:30:09,197 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:30:09,197 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:30:09,197 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:30:09,197 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:30:09,197 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:30:09,197 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:30:09,198 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:30:09,198 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:30:09,198 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-30 10:30:09,198 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-30 10:30:09,198 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:30:09,198 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:30:09,198 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:30:09,198 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:30:09,198 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:30:09,198 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 -> 860528881155a718438c0581485d42cc235131c30c9ba38f0a976304f206e75d [2025-04-30 10:30:09,403 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:30:09,408 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:30:09,410 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:30:09,410 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:30:09,410 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:30:09,411 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-const-race-2.i [2025-04-30 10:30:10,639 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea37635ce/7d7d188f51b94f6fadb4475586bb1dfa/FLAG9a2021991 [2025-04-30 10:30:10,913 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:30:10,920 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-race-challenges/thread-join-array-const-race-2.i [2025-04-30 10:30:10,935 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea37635ce/7d7d188f51b94f6fadb4475586bb1dfa/FLAG9a2021991 [2025-04-30 10:30:11,641 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea37635ce/7d7d188f51b94f6fadb4475586bb1dfa [2025-04-30 10:30:11,643 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:30:11,644 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:30:11,644 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:30:11,644 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:30:11,647 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:30:11,648 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:30:11" (1/1) ... [2025-04-30 10:30:11,648 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28968a70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:30:11, skipping insertion in model container [2025-04-30 10:30:11,648 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:30:11" (1/1) ... [2025-04-30 10:30:11,665 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:30:11,951 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:30:11,965 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:30:12,028 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:30:12,060 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:30:12,060 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:30:12 WrapperNode [2025-04-30 10:30:12,061 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:30:12,062 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:30:12,062 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:30:12,063 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:30:12,068 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:30:12" (1/1) ... [2025-04-30 10:30:12,078 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:30:12" (1/1) ... [2025-04-30 10:30:12,097 INFO L138 Inliner]: procedures = 158, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 53 [2025-04-30 10:30:12,097 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:30:12,098 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:30:12,098 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:30:12,098 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:30:12,102 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:30:12" (1/1) ... [2025-04-30 10:30:12,102 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:30:12" (1/1) ... [2025-04-30 10:30:12,104 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:30:12" (1/1) ... [2025-04-30 10:30:12,105 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:30:12" (1/1) ... [2025-04-30 10:30:12,108 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:30:12" (1/1) ... [2025-04-30 10:30:12,108 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:30:12" (1/1) ... [2025-04-30 10:30:12,110 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:30:12" (1/1) ... [2025-04-30 10:30:12,111 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:30:12" (1/1) ... [2025-04-30 10:30:12,111 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:30:12" (1/1) ... [2025-04-30 10:30:12,114 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:30:12,117 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:30:12,118 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:30:12,118 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:30:12,119 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:30:12" (1/1) ... [2025-04-30 10:30:12,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:30:12,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:30:12,141 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-30 10:30:12,145 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-30 10:30:12,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-30 10:30:12,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-30 10:30:12,161 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-30 10:30:12,161 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:30:12,161 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-30 10:30:12,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-30 10:30:12,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-30 10:30:12,161 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-04-30 10:30:12,161 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-04-30 10:30:12,161 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-30 10:30:12,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:30:12,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:30:12,162 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-30 10:30:12,252 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:30:12,253 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:30:12,360 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-30 10:30:12,360 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:30:12,372 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:30:12,372 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-30 10:30:12,373 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:30:12 BoogieIcfgContainer [2025-04-30 10:30:12,373 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:30:12,374 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:30:12,374 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:30:12,377 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:30:12,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:30:11" (1/3) ... [2025-04-30 10:30:12,378 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41ade0ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:30:12, skipping insertion in model container [2025-04-30 10:30:12,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:30:12" (2/3) ... [2025-04-30 10:30:12,378 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41ade0ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:30:12, skipping insertion in model container [2025-04-30 10:30:12,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:30:12" (3/3) ... [2025-04-30 10:30:12,379 INFO L128 eAbstractionObserver]: Analyzing ICFG thread-join-array-const-race-2.i [2025-04-30 10:30:12,388 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:30:12,390 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG thread-join-array-const-race-2.i that has 2 procedures, 74 locations, 74 edges, 1 initial locations, 2 loop locations, and 4 error locations. [2025-04-30 10:30:12,390 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-30 10:30:12,429 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-04-30 10:30:12,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 75 transitions, 157 flow [2025-04-30 10:30:12,494 INFO L116 PetriNetUnfolderBase]: 1/108 cut-off events. [2025-04-30 10:30:12,498 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-30 10:30:12,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 108 events. 1/108 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 213 event pairs, 0 based on Foata normal form. 0/97 useless extension candidates. Maximal degree in co-relation 2. Up to 3 conditions per place. [2025-04-30 10:30:12,500 INFO L82 GeneralOperation]: Start removeDead. Operand has 77 places, 75 transitions, 157 flow [2025-04-30 10:30:12,503 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 77 places, 75 transitions, 157 flow [2025-04-30 10:30:12,508 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:30:12,516 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;@224d1f49, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:30:12,516 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-30 10:30:12,525 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-30 10:30:12,528 INFO L116 PetriNetUnfolderBase]: 0/30 cut-off events. [2025-04-30 10:30:12,528 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:30:12,528 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:12,529 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] [2025-04-30 10:30:12,530 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-30 10:30:12,534 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:12,534 INFO L85 PathProgramCache]: Analyzing trace with hash -914278586, now seen corresponding path program 1 times [2025-04-30 10:30:12,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:12,540 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051177803] [2025-04-30 10:30:12,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:12,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:12,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-30 10:30:12,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-30 10:30:12,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:12,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:12,780 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-30 10:30:12,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:12,780 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051177803] [2025-04-30 10:30:12,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051177803] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:12,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:12,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:30:12,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442344113] [2025-04-30 10:30:12,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:12,788 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:30:12,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:12,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:30:12,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:30:12,853 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 75 [2025-04-30 10:30:12,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 75 transitions, 157 flow. Second operand has 4 states, 4 states have (on average 65.25) internal successors, (261), 4 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-30 10:30:12,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:12,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 75 [2025-04-30 10:30:12,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:12,924 INFO L116 PetriNetUnfolderBase]: 8/185 cut-off events. [2025-04-30 10:30:12,924 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-30 10:30:12,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 185 events. 8/185 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 561 event pairs, 0 based on Foata normal form. 1/166 useless extension candidates. Maximal degree in co-relation 155. Up to 17 conditions per place. [2025-04-30 10:30:12,927 INFO L140 encePairwiseOnDemand]: 70/75 looper letters, 10 selfloop transitions, 4 changer transitions 1/79 dead transitions. [2025-04-30 10:30:12,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 79 transitions, 195 flow [2025-04-30 10:30:12,928 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:30:12,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-30 10:30:12,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 272 transitions. [2025-04-30 10:30:12,937 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9066666666666666 [2025-04-30 10:30:12,938 INFO L175 Difference]: Start difference. First operand has 77 places, 75 transitions, 157 flow. Second operand 4 states and 272 transitions. [2025-04-30 10:30:12,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 79 transitions, 195 flow [2025-04-30 10:30:12,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 79 transitions, 195 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:30:12,944 INFO L231 Difference]: Finished difference. Result has 81 places, 75 transitions, 169 flow [2025-04-30 10:30:12,946 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=169, PETRI_PLACES=81, PETRI_TRANSITIONS=75} [2025-04-30 10:30:12,948 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 4 predicate places. [2025-04-30 10:30:12,948 INFO L485 AbstractCegarLoop]: Abstraction has has 81 places, 75 transitions, 169 flow [2025-04-30 10:30:12,948 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 65.25) internal successors, (261), 4 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-30 10:30:12,948 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:12,949 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] [2025-04-30 10:30:12,949 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:30:12,949 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-30 10:30:12,949 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:12,950 INFO L85 PathProgramCache]: Analyzing trace with hash 2067098048, now seen corresponding path program 1 times [2025-04-30 10:30:12,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:12,950 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479331121] [2025-04-30 10:30:12,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:12,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:12,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-30 10:30:12,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-30 10:30:12,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:12,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:13,340 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-30 10:30:13,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:13,340 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479331121] [2025-04-30 10:30:13,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479331121] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:13,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:13,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:30:13,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142743079] [2025-04-30 10:30:13,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:13,343 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:30:13,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:13,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:30:13,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:30:13,459 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 75 [2025-04-30 10:30:13,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 75 transitions, 169 flow. Second operand has 6 states, 6 states have (on average 53.5) internal successors, (321), 6 states have internal predecessors, (321), 0 states have call successors, (0), 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-30 10:30:13,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:13,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 75 [2025-04-30 10:30:13,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:13,537 INFO L116 PetriNetUnfolderBase]: 30/209 cut-off events. [2025-04-30 10:30:13,540 INFO L117 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-04-30 10:30:13,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 326 conditions, 209 events. 30/209 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 853 event pairs, 4 based on Foata normal form. 0/194 useless extension candidates. Maximal degree in co-relation 247. Up to 62 conditions per place. [2025-04-30 10:30:13,542 INFO L140 encePairwiseOnDemand]: 69/75 looper letters, 25 selfloop transitions, 5 changer transitions 0/82 dead transitions. [2025-04-30 10:30:13,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 82 transitions, 243 flow [2025-04-30 10:30:13,545 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:30:13,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:30:13,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 343 transitions. [2025-04-30 10:30:13,546 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7622222222222222 [2025-04-30 10:30:13,546 INFO L175 Difference]: Start difference. First operand has 81 places, 75 transitions, 169 flow. Second operand 6 states and 343 transitions. [2025-04-30 10:30:13,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 82 transitions, 243 flow [2025-04-30 10:30:13,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 82 transitions, 235 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-30 10:30:13,549 INFO L231 Difference]: Finished difference. Result has 82 places, 74 transitions, 169 flow [2025-04-30 10:30:13,549 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=169, PETRI_PLACES=82, PETRI_TRANSITIONS=74} [2025-04-30 10:30:13,549 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 5 predicate places. [2025-04-30 10:30:13,549 INFO L485 AbstractCegarLoop]: Abstraction has has 82 places, 74 transitions, 169 flow [2025-04-30 10:30:13,550 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 53.5) internal successors, (321), 6 states have internal predecessors, (321), 0 states have call successors, (0), 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-30 10:30:13,550 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:13,550 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] [2025-04-30 10:30:13,550 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-30 10:30:13,550 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-04-30 10:30:13,551 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:13,551 INFO L85 PathProgramCache]: Analyzing trace with hash 882565076, now seen corresponding path program 1 times [2025-04-30 10:30:13,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:13,551 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025195867] [2025-04-30 10:30:13,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:13,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:13,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-30 10:30:13,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-30 10:30:13,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:13,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:13,596 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-30 10:30:13,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:13,596 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025195867] [2025-04-30 10:30:13,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025195867] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:13,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:13,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:30:13,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247697110] [2025-04-30 10:30:13,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:13,597 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:30:13,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:13,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:30:13,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:30:13,607 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 75 [2025-04-30 10:30:13,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 74 transitions, 169 flow. Second operand has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 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-30 10:30:13,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:13,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 75 [2025-04-30 10:30:13,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:13,632 INFO L116 PetriNetUnfolderBase]: 6/141 cut-off events. [2025-04-30 10:30:13,632 INFO L117 PetriNetUnfolderBase]: For 10/16 co-relation queries the response was YES. [2025-04-30 10:30:13,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 141 events. 6/141 cut-off events. For 10/16 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 375 event pairs, 4 based on Foata normal form. 1/129 useless extension candidates. Maximal degree in co-relation 134. Up to 21 conditions per place. [2025-04-30 10:30:13,634 INFO L140 encePairwiseOnDemand]: 70/75 looper letters, 9 selfloop transitions, 4 changer transitions 0/77 dead transitions. [2025-04-30 10:30:13,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 77 transitions, 201 flow [2025-04-30 10:30:13,635 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:30:13,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:30:13,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 209 transitions. [2025-04-30 10:30:13,638 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9288888888888889 [2025-04-30 10:30:13,638 INFO L175 Difference]: Start difference. First operand has 82 places, 74 transitions, 169 flow. Second operand 3 states and 209 transitions. [2025-04-30 10:30:13,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 77 transitions, 201 flow [2025-04-30 10:30:13,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 77 transitions, 191 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:30:13,641 INFO L231 Difference]: Finished difference. Result has 81 places, 77 transitions, 189 flow [2025-04-30 10:30:13,641 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=189, PETRI_PLACES=81, PETRI_TRANSITIONS=77} [2025-04-30 10:30:13,642 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 4 predicate places. [2025-04-30 10:30:13,642 INFO L485 AbstractCegarLoop]: Abstraction has has 81 places, 77 transitions, 189 flow [2025-04-30 10:30:13,643 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 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-30 10:30:13,643 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:13,643 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] [2025-04-30 10:30:13,643 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:30:13,643 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-04-30 10:30:13,643 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:13,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1119309273, now seen corresponding path program 1 times [2025-04-30 10:30:13,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:13,644 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583708395] [2025-04-30 10:30:13,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:13,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:13,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-30 10:30:13,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-30 10:30:13,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:13,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:13,720 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-30 10:30:13,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:13,721 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583708395] [2025-04-30 10:30:13,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583708395] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:13,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:13,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:30:13,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045550297] [2025-04-30 10:30:13,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:13,722 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:30:13,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:13,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:30:13,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:30:13,754 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 75 [2025-04-30 10:30:13,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 77 transitions, 189 flow. Second operand has 4 states, 4 states have (on average 65.5) internal successors, (262), 4 states have internal predecessors, (262), 0 states have call successors, (0), 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-30 10:30:13,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:13,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 75 [2025-04-30 10:30:13,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:13,782 INFO L116 PetriNetUnfolderBase]: 2/106 cut-off events. [2025-04-30 10:30:13,783 INFO L117 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-04-30 10:30:13,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 106 events. 2/106 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 152 event pairs, 0 based on Foata normal form. 3/104 useless extension candidates. Maximal degree in co-relation 82. Up to 7 conditions per place. [2025-04-30 10:30:13,783 INFO L140 encePairwiseOnDemand]: 70/75 looper letters, 9 selfloop transitions, 3 changer transitions 7/75 dead transitions. [2025-04-30 10:30:13,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 75 transitions, 199 flow [2025-04-30 10:30:13,784 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:30:13,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-30 10:30:13,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 270 transitions. [2025-04-30 10:30:13,785 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9 [2025-04-30 10:30:13,785 INFO L175 Difference]: Start difference. First operand has 81 places, 77 transitions, 189 flow. Second operand 4 states and 270 transitions. [2025-04-30 10:30:13,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 75 transitions, 199 flow [2025-04-30 10:30:13,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 75 transitions, 187 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-04-30 10:30:13,788 INFO L231 Difference]: Finished difference. Result has 80 places, 66 transitions, 153 flow [2025-04-30 10:30:13,789 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=153, PETRI_PLACES=80, PETRI_TRANSITIONS=66} [2025-04-30 10:30:13,789 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 3 predicate places. [2025-04-30 10:30:13,790 INFO L485 AbstractCegarLoop]: Abstraction has has 80 places, 66 transitions, 153 flow [2025-04-30 10:30:13,790 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 65.5) internal successors, (262), 4 states have internal predecessors, (262), 0 states have call successors, (0), 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-30 10:30:13,790 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:13,790 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-30 10:30:13,790 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-30 10:30:13,790 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-30 10:30:13,791 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:13,791 INFO L85 PathProgramCache]: Analyzing trace with hash -2009717222, now seen corresponding path program 1 times [2025-04-30 10:30:13,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:13,791 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417748947] [2025-04-30 10:30:13,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:13,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:13,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-30 10:30:13,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-30 10:30:13,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:13,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:13,893 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-30 10:30:13,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:13,894 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417748947] [2025-04-30 10:30:13,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417748947] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:13,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:13,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:30:13,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370791014] [2025-04-30 10:30:13,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:13,895 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:30:13,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:13,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:30:13,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:30:13,953 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 75 [2025-04-30 10:30:13,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 66 transitions, 153 flow. Second operand has 6 states, 6 states have (on average 63.5) internal successors, (381), 6 states have internal predecessors, (381), 0 states have call successors, (0), 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-30 10:30:13,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:13,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 75 [2025-04-30 10:30:13,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:14,002 INFO L116 PetriNetUnfolderBase]: 6/87 cut-off events. [2025-04-30 10:30:14,002 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-30 10:30:14,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 87 events. 6/87 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 137 event pairs, 0 based on Foata normal form. 3/89 useless extension candidates. Maximal degree in co-relation 114. Up to 5 conditions per place. [2025-04-30 10:30:14,003 INFO L140 encePairwiseOnDemand]: 69/75 looper letters, 10 selfloop transitions, 5 changer transitions 0/54 dead transitions. [2025-04-30 10:30:14,003 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 54 transitions, 146 flow [2025-04-30 10:30:14,003 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:30:14,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-30 10:30:14,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 450 transitions. [2025-04-30 10:30:14,004 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8571428571428571 [2025-04-30 10:30:14,004 INFO L175 Difference]: Start difference. First operand has 80 places, 66 transitions, 153 flow. Second operand 7 states and 450 transitions. [2025-04-30 10:30:14,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 54 transitions, 146 flow [2025-04-30 10:30:14,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 54 transitions, 143 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:30:14,005 INFO L231 Difference]: Finished difference. Result has 59 places, 48 transitions, 111 flow [2025-04-30 10:30:14,006 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=111, PETRI_PLACES=59, PETRI_TRANSITIONS=48} [2025-04-30 10:30:14,006 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, -18 predicate places. [2025-04-30 10:30:14,006 INFO L485 AbstractCegarLoop]: Abstraction has has 59 places, 48 transitions, 111 flow [2025-04-30 10:30:14,006 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 63.5) internal successors, (381), 6 states have internal predecessors, (381), 0 states have call successors, (0), 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-30 10:30:14,007 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:14,007 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] [2025-04-30 10:30:14,007 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-30 10:30:14,007 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-30 10:30:14,007 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:14,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1733620086, now seen corresponding path program 1 times [2025-04-30 10:30:14,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:14,008 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535830225] [2025-04-30 10:30:14,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:14,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:14,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-30 10:30:14,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-30 10:30:14,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:14,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:30:14,024 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-30 10:30:14,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-30 10:30:14,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-30 10:30:14,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:14,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:30:14,052 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-30 10:30:14,052 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-30 10:30:14,052 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-04-30 10:30:14,054 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 6 remaining) [2025-04-30 10:30:14,055 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (3 of 6 remaining) [2025-04-30 10:30:14,055 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (2 of 6 remaining) [2025-04-30 10:30:14,055 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 6 remaining) [2025-04-30 10:30:14,055 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 6 remaining) [2025-04-30 10:30:14,055 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-30 10:30:14,055 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-04-30 10:30:14,057 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-30 10:30:14,057 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-30 10:30:14,076 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-30 10:30:14,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 93 transitions, 202 flow [2025-04-30 10:30:14,092 INFO L116 PetriNetUnfolderBase]: 3/190 cut-off events. [2025-04-30 10:30:14,093 INFO L117 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-04-30 10:30:14,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 190 events. 3/190 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 447 event pairs, 0 based on Foata normal form. 0/170 useless extension candidates. Maximal degree in co-relation 110. Up to 6 conditions per place. [2025-04-30 10:30:14,094 INFO L82 GeneralOperation]: Start removeDead. Operand has 96 places, 93 transitions, 202 flow [2025-04-30 10:30:14,095 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 96 places, 93 transitions, 202 flow [2025-04-30 10:30:14,096 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:30:14,096 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;@224d1f49, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:30:14,097 INFO L341 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-04-30 10:30:14,100 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-30 10:30:14,100 INFO L116 PetriNetUnfolderBase]: 0/30 cut-off events. [2025-04-30 10:30:14,100 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:30:14,100 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:14,100 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] [2025-04-30 10:30:14,101 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-30 10:30:14,101 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:14,101 INFO L85 PathProgramCache]: Analyzing trace with hash 797007654, now seen corresponding path program 1 times [2025-04-30 10:30:14,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:14,101 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798040077] [2025-04-30 10:30:14,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:14,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:14,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-30 10:30:14,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-30 10:30:14,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:14,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:14,135 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-30 10:30:14,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:14,135 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798040077] [2025-04-30 10:30:14,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798040077] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:14,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:14,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:30:14,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439791195] [2025-04-30 10:30:14,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:14,136 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:30:14,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:14,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:30:14,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:30:14,162 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 93 [2025-04-30 10:30:14,162 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 93 transitions, 202 flow. Second operand has 4 states, 4 states have (on average 79.25) internal successors, (317), 4 states have internal predecessors, (317), 0 states have call successors, (0), 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-30 10:30:14,162 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:14,162 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 93 [2025-04-30 10:30:14,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:14,231 INFO L116 PetriNetUnfolderBase]: 72/571 cut-off events. [2025-04-30 10:30:14,232 INFO L117 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2025-04-30 10:30:14,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 737 conditions, 571 events. 72/571 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 3304 event pairs, 35 based on Foata normal form. 1/523 useless extension candidates. Maximal degree in co-relation 336. Up to 106 conditions per place. [2025-04-30 10:30:14,235 INFO L140 encePairwiseOnDemand]: 88/93 looper letters, 18 selfloop transitions, 4 changer transitions 0/100 dead transitions. [2025-04-30 10:30:14,235 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 100 transitions, 260 flow [2025-04-30 10:30:14,235 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:30:14,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-30 10:30:14,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 335 transitions. [2025-04-30 10:30:14,236 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9005376344086021 [2025-04-30 10:30:14,236 INFO L175 Difference]: Start difference. First operand has 96 places, 93 transitions, 202 flow. Second operand 4 states and 335 transitions. [2025-04-30 10:30:14,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 100 transitions, 260 flow [2025-04-30 10:30:14,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 100 transitions, 260 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:30:14,238 INFO L231 Difference]: Finished difference. Result has 100 places, 94 transitions, 218 flow [2025-04-30 10:30:14,238 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=218, PETRI_PLACES=100, PETRI_TRANSITIONS=94} [2025-04-30 10:30:14,239 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 4 predicate places. [2025-04-30 10:30:14,239 INFO L485 AbstractCegarLoop]: Abstraction has has 100 places, 94 transitions, 218 flow [2025-04-30 10:30:14,239 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 79.25) internal successors, (317), 4 states have internal predecessors, (317), 0 states have call successors, (0), 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-30 10:30:14,239 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:14,239 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] [2025-04-30 10:30:14,239 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-30 10:30:14,239 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-04-30 10:30:14,240 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:14,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1733762717, now seen corresponding path program 1 times [2025-04-30 10:30:14,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:14,240 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579661269] [2025-04-30 10:30:14,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:14,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:14,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-30 10:30:14,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-30 10:30:14,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:14,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:14,395 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-30 10:30:14,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:14,395 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579661269] [2025-04-30 10:30:14,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579661269] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:14,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:14,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:30:14,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229841915] [2025-04-30 10:30:14,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:14,395 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:30:14,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:14,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:30:14,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:30:14,464 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 93 [2025-04-30 10:30:14,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 94 transitions, 218 flow. Second operand has 6 states, 6 states have (on average 67.5) internal successors, (405), 6 states have internal predecessors, (405), 0 states have call successors, (0), 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-30 10:30:14,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:14,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 93 [2025-04-30 10:30:14,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:14,602 INFO L116 PetriNetUnfolderBase]: 236/941 cut-off events. [2025-04-30 10:30:14,602 INFO L117 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2025-04-30 10:30:14,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1476 conditions, 941 events. 236/941 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 6576 event pairs, 91 based on Foata normal form. 0/875 useless extension candidates. Maximal degree in co-relation 443. Up to 313 conditions per place. [2025-04-30 10:30:14,608 INFO L140 encePairwiseOnDemand]: 87/93 looper letters, 38 selfloop transitions, 5 changer transitions 0/109 dead transitions. [2025-04-30 10:30:14,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 109 transitions, 334 flow [2025-04-30 10:30:14,609 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:30:14,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:30:14,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 439 transitions. [2025-04-30 10:30:14,611 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7867383512544803 [2025-04-30 10:30:14,612 INFO L175 Difference]: Start difference. First operand has 100 places, 94 transitions, 218 flow. Second operand 6 states and 439 transitions. [2025-04-30 10:30:14,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 109 transitions, 334 flow [2025-04-30 10:30:14,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 109 transitions, 328 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:30:14,616 INFO L231 Difference]: Finished difference. Result has 102 places, 93 transitions, 220 flow [2025-04-30 10:30:14,616 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=220, PETRI_PLACES=102, PETRI_TRANSITIONS=93} [2025-04-30 10:30:14,617 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 6 predicate places. [2025-04-30 10:30:14,617 INFO L485 AbstractCegarLoop]: Abstraction has has 102 places, 93 transitions, 220 flow [2025-04-30 10:30:14,618 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 67.5) internal successors, (405), 6 states have internal predecessors, (405), 0 states have call successors, (0), 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-30 10:30:14,618 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:14,618 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] [2025-04-30 10:30:14,618 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-30 10:30:14,618 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-04-30 10:30:14,618 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:14,618 INFO L85 PathProgramCache]: Analyzing trace with hash -81190783, now seen corresponding path program 1 times [2025-04-30 10:30:14,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:14,619 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975599573] [2025-04-30 10:30:14,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:14,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:14,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-30 10:30:14,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-30 10:30:14,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:14,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:14,651 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-30 10:30:14,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:14,651 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975599573] [2025-04-30 10:30:14,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975599573] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:14,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:14,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:30:14,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267771852] [2025-04-30 10:30:14,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:14,652 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:30:14,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:14,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:30:14,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:30:14,661 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 93 [2025-04-30 10:30:14,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 93 transitions, 220 flow. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 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-30 10:30:14,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:14,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 93 [2025-04-30 10:30:14,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:14,733 INFO L116 PetriNetUnfolderBase]: 116/707 cut-off events. [2025-04-30 10:30:14,733 INFO L117 PetriNetUnfolderBase]: For 120/165 co-relation queries the response was YES. [2025-04-30 10:30:14,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1005 conditions, 707 events. 116/707 cut-off events. For 120/165 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 4576 event pairs, 58 based on Foata normal form. 4/621 useless extension candidates. Maximal degree in co-relation 463. Up to 185 conditions per place. [2025-04-30 10:30:14,737 INFO L140 encePairwiseOnDemand]: 87/93 looper letters, 18 selfloop transitions, 5 changer transitions 0/101 dead transitions. [2025-04-30 10:30:14,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 101 transitions, 290 flow [2025-04-30 10:30:14,738 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:30:14,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:30:14,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 258 transitions. [2025-04-30 10:30:14,738 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9247311827956989 [2025-04-30 10:30:14,739 INFO L175 Difference]: Start difference. First operand has 102 places, 93 transitions, 220 flow. Second operand 3 states and 258 transitions. [2025-04-30 10:30:14,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 101 transitions, 290 flow [2025-04-30 10:30:14,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 101 transitions, 280 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:30:14,740 INFO L231 Difference]: Finished difference. Result has 101 places, 97 transitions, 248 flow [2025-04-30 10:30:14,741 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=248, PETRI_PLACES=101, PETRI_TRANSITIONS=97} [2025-04-30 10:30:14,741 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 5 predicate places. [2025-04-30 10:30:14,741 INFO L485 AbstractCegarLoop]: Abstraction has has 101 places, 97 transitions, 248 flow [2025-04-30 10:30:14,741 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 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-30 10:30:14,741 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:14,741 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] [2025-04-30 10:30:14,742 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-30 10:30:14,742 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-04-30 10:30:14,742 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:14,742 INFO L85 PathProgramCache]: Analyzing trace with hash 476611476, now seen corresponding path program 1 times [2025-04-30 10:30:14,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:14,742 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619700064] [2025-04-30 10:30:14,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:14,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:14,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-30 10:30:14,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-30 10:30:14,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:14,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:14,799 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-30 10:30:14,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:14,799 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619700064] [2025-04-30 10:30:14,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619700064] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:14,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:14,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:30:14,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279679792] [2025-04-30 10:30:14,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:14,800 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:30:14,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:14,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:30:14,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:30:14,828 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 93 [2025-04-30 10:30:14,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 97 transitions, 248 flow. Second operand has 4 states, 4 states have (on average 79.5) internal successors, (318), 4 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:30:14,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:14,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 93 [2025-04-30 10:30:14,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:14,907 INFO L116 PetriNetUnfolderBase]: 63/580 cut-off events. [2025-04-30 10:30:14,908 INFO L117 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2025-04-30 10:30:14,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 810 conditions, 580 events. 63/580 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 3208 event pairs, 24 based on Foata normal form. 15/544 useless extension candidates. Maximal degree in co-relation 632. Up to 72 conditions per place. [2025-04-30 10:30:14,912 INFO L140 encePairwiseOnDemand]: 88/93 looper letters, 19 selfloop transitions, 4 changer transitions 3/108 dead transitions. [2025-04-30 10:30:14,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 108 transitions, 328 flow [2025-04-30 10:30:14,912 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:30:14,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-30 10:30:14,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 339 transitions. [2025-04-30 10:30:14,914 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9112903225806451 [2025-04-30 10:30:14,914 INFO L175 Difference]: Start difference. First operand has 101 places, 97 transitions, 248 flow. Second operand 4 states and 339 transitions. [2025-04-30 10:30:14,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 108 transitions, 328 flow [2025-04-30 10:30:14,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 108 transitions, 318 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:30:14,916 INFO L231 Difference]: Finished difference. Result has 103 places, 98 transitions, 254 flow [2025-04-30 10:30:14,917 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=254, PETRI_PLACES=103, PETRI_TRANSITIONS=98} [2025-04-30 10:30:14,917 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 7 predicate places. [2025-04-30 10:30:14,917 INFO L485 AbstractCegarLoop]: Abstraction has has 103 places, 98 transitions, 254 flow [2025-04-30 10:30:14,917 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 79.5) internal successors, (318), 4 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:30:14,918 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:14,918 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-30 10:30:14,918 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-30 10:30:14,918 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-30 10:30:14,918 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:14,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1072409162, now seen corresponding path program 1 times [2025-04-30 10:30:14,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:14,919 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922410560] [2025-04-30 10:30:14,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:14,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:14,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-30 10:30:14,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-30 10:30:14,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:14,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:14,995 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-30 10:30:14,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:14,995 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922410560] [2025-04-30 10:30:14,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922410560] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:14,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:14,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:30:14,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420871719] [2025-04-30 10:30:14,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:14,996 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:30:14,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:14,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:30:14,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:30:15,058 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 93 [2025-04-30 10:30:15,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 98 transitions, 254 flow. Second operand has 6 states, 6 states have (on average 77.5) internal successors, (465), 6 states have internal predecessors, (465), 0 states have call successors, (0), 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-30 10:30:15,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:15,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 93 [2025-04-30 10:30:15,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:15,177 INFO L116 PetriNetUnfolderBase]: 111/852 cut-off events. [2025-04-30 10:30:15,177 INFO L117 PetriNetUnfolderBase]: For 89/89 co-relation queries the response was YES. [2025-04-30 10:30:15,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1213 conditions, 852 events. 111/852 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 5381 event pairs, 21 based on Foata normal form. 3/781 useless extension candidates. Maximal degree in co-relation 742. Up to 125 conditions per place. [2025-04-30 10:30:15,180 INFO L140 encePairwiseOnDemand]: 86/93 looper letters, 24 selfloop transitions, 7 changer transitions 3/114 dead transitions. [2025-04-30 10:30:15,180 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 114 transitions, 354 flow [2025-04-30 10:30:15,181 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:30:15,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-30 10:30:15,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 567 transitions. [2025-04-30 10:30:15,182 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8709677419354839 [2025-04-30 10:30:15,182 INFO L175 Difference]: Start difference. First operand has 103 places, 98 transitions, 254 flow. Second operand 7 states and 567 transitions. [2025-04-30 10:30:15,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 114 transitions, 354 flow [2025-04-30 10:30:15,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 114 transitions, 348 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:30:15,184 INFO L231 Difference]: Finished difference. Result has 110 places, 100 transitions, 278 flow [2025-04-30 10:30:15,184 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=278, PETRI_PLACES=110, PETRI_TRANSITIONS=100} [2025-04-30 10:30:15,185 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 14 predicate places. [2025-04-30 10:30:15,185 INFO L485 AbstractCegarLoop]: Abstraction has has 110 places, 100 transitions, 278 flow [2025-04-30 10:30:15,185 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 77.5) internal successors, (465), 6 states have internal predecessors, (465), 0 states have call successors, (0), 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-30 10:30:15,185 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:15,185 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] [2025-04-30 10:30:15,185 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-30 10:30:15,186 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-30 10:30:15,186 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:15,186 INFO L85 PathProgramCache]: Analyzing trace with hash -595163134, now seen corresponding path program 1 times [2025-04-30 10:30:15,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:15,186 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965884286] [2025-04-30 10:30:15,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:15,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:15,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-04-30 10:30:15,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-04-30 10:30:15,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:15,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:15,214 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-30 10:30:15,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:15,214 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965884286] [2025-04-30 10:30:15,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965884286] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:15,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:15,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:30:15,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598490388] [2025-04-30 10:30:15,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:15,214 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:30:15,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:15,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:30:15,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:30:15,223 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 93 [2025-04-30 10:30:15,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 100 transitions, 278 flow. Second operand has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 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-30 10:30:15,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:15,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 93 [2025-04-30 10:30:15,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:15,282 INFO L116 PetriNetUnfolderBase]: 58/570 cut-off events. [2025-04-30 10:30:15,283 INFO L117 PetriNetUnfolderBase]: For 156/208 co-relation queries the response was YES. [2025-04-30 10:30:15,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 868 conditions, 570 events. 58/570 cut-off events. For 156/208 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 3281 event pairs, 32 based on Foata normal form. 3/527 useless extension candidates. Maximal degree in co-relation 758. Up to 111 conditions per place. [2025-04-30 10:30:15,286 INFO L140 encePairwiseOnDemand]: 87/93 looper letters, 18 selfloop transitions, 6 changer transitions 0/107 dead transitions. [2025-04-30 10:30:15,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 107 transitions, 347 flow [2025-04-30 10:30:15,286 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:30:15,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:30:15,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 257 transitions. [2025-04-30 10:30:15,287 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.921146953405018 [2025-04-30 10:30:15,287 INFO L175 Difference]: Start difference. First operand has 110 places, 100 transitions, 278 flow. Second operand 3 states and 257 transitions. [2025-04-30 10:30:15,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 107 transitions, 347 flow [2025-04-30 10:30:15,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 107 transitions, 337 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-04-30 10:30:15,290 INFO L231 Difference]: Finished difference. Result has 111 places, 104 transitions, 314 flow [2025-04-30 10:30:15,290 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=314, PETRI_PLACES=111, PETRI_TRANSITIONS=104} [2025-04-30 10:30:15,291 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 15 predicate places. [2025-04-30 10:30:15,291 INFO L485 AbstractCegarLoop]: Abstraction has has 111 places, 104 transitions, 314 flow [2025-04-30 10:30:15,292 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 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-30 10:30:15,292 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:15,292 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] [2025-04-30 10:30:15,292 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-30 10:30:15,292 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-04-30 10:30:15,292 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:15,292 INFO L85 PathProgramCache]: Analyzing trace with hash -264492615, now seen corresponding path program 1 times [2025-04-30 10:30:15,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:15,292 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256441143] [2025-04-30 10:30:15,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:15,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:15,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-04-30 10:30:15,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-04-30 10:30:15,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:15,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:15,417 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-30 10:30:15,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:15,419 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256441143] [2025-04-30 10:30:15,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256441143] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:15,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:15,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-30 10:30:15,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332261968] [2025-04-30 10:30:15,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:15,419 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:30:15,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:15,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:30:15,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:30:15,480 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 93 [2025-04-30 10:30:15,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 104 transitions, 314 flow. Second operand has 8 states, 8 states have (on average 77.625) internal successors, (621), 8 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-30 10:30:15,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:15,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 93 [2025-04-30 10:30:15,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:15,596 INFO L116 PetriNetUnfolderBase]: 71/470 cut-off events. [2025-04-30 10:30:15,596 INFO L117 PetriNetUnfolderBase]: For 97/101 co-relation queries the response was YES. [2025-04-30 10:30:15,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 753 conditions, 470 events. 71/470 cut-off events. For 97/101 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2529 event pairs, 1 based on Foata normal form. 14/473 useless extension candidates. Maximal degree in co-relation 741. Up to 32 conditions per place. [2025-04-30 10:30:15,599 INFO L140 encePairwiseOnDemand]: 87/93 looper letters, 25 selfloop transitions, 8 changer transitions 0/93 dead transitions. [2025-04-30 10:30:15,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 93 transitions, 328 flow [2025-04-30 10:30:15,599 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-30 10:30:15,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-30 10:30:15,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 794 transitions. [2025-04-30 10:30:15,601 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.853763440860215 [2025-04-30 10:30:15,601 INFO L175 Difference]: Start difference. First operand has 111 places, 104 transitions, 314 flow. Second operand 10 states and 794 transitions. [2025-04-30 10:30:15,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 93 transitions, 328 flow [2025-04-30 10:30:15,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 93 transitions, 314 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-30 10:30:15,602 INFO L231 Difference]: Finished difference. Result has 91 places, 75 transitions, 228 flow [2025-04-30 10:30:15,602 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=228, PETRI_PLACES=91, PETRI_TRANSITIONS=75} [2025-04-30 10:30:15,603 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, -5 predicate places. [2025-04-30 10:30:15,603 INFO L485 AbstractCegarLoop]: Abstraction has has 91 places, 75 transitions, 228 flow [2025-04-30 10:30:15,603 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 77.625) internal successors, (621), 8 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-30 10:30:15,603 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:15,603 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] [2025-04-30 10:30:15,603 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-30 10:30:15,603 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-30 10:30:15,604 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:15,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1008164, now seen corresponding path program 1 times [2025-04-30 10:30:15,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:15,604 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205309067] [2025-04-30 10:30:15,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:15,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:15,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-04-30 10:30:15,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-04-30 10:30:15,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:15,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:30:15,621 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-30 10:30:15,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-04-30 10:30:15,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-04-30 10:30:15,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:15,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:30:15,640 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-30 10:30:15,640 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-30 10:30:15,640 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2025-04-30 10:30:15,640 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2025-04-30 10:30:15,640 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2025-04-30 10:30:15,640 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2025-04-30 10:30:15,640 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2025-04-30 10:30:15,640 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2025-04-30 10:30:15,641 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2025-04-30 10:30:15,641 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-30 10:30:15,641 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:30:15,641 WARN L247 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-30 10:30:15,642 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-04-30 10:30:15,657 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-30 10:30:15,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 111 transitions, 249 flow [2025-04-30 10:30:15,679 INFO L116 PetriNetUnfolderBase]: 8/319 cut-off events. [2025-04-30 10:30:15,680 INFO L117 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-04-30 10:30:15,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 344 conditions, 319 events. 8/319 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 909 event pairs, 1 based on Foata normal form. 0/284 useless extension candidates. Maximal degree in co-relation 198. Up to 12 conditions per place. [2025-04-30 10:30:15,680 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 111 transitions, 249 flow [2025-04-30 10:30:15,682 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 115 places, 111 transitions, 249 flow [2025-04-30 10:30:15,683 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:30:15,683 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;@224d1f49, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:30:15,684 INFO L341 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-04-30 10:30:15,685 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-30 10:30:15,685 INFO L116 PetriNetUnfolderBase]: 0/30 cut-off events. [2025-04-30 10:30:15,685 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:30:15,685 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:15,685 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] [2025-04-30 10:30:15,686 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-30 10:30:15,686 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:15,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1039814714, now seen corresponding path program 1 times [2025-04-30 10:30:15,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:15,686 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858518658] [2025-04-30 10:30:15,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:15,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:15,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-30 10:30:15,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-30 10:30:15,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:15,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:15,715 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-30 10:30:15,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:15,716 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858518658] [2025-04-30 10:30:15,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858518658] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:15,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:15,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:30:15,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451281242] [2025-04-30 10:30:15,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:15,716 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:30:15,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:15,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:30:15,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:30:15,740 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 111 [2025-04-30 10:30:15,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 111 transitions, 249 flow. Second operand has 4 states, 4 states have (on average 93.25) internal successors, (373), 4 states have internal predecessors, (373), 0 states have call successors, (0), 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-30 10:30:15,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:15,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 111 [2025-04-30 10:30:15,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:15,911 INFO L116 PetriNetUnfolderBase]: 413/2179 cut-off events. [2025-04-30 10:30:15,912 INFO L117 PetriNetUnfolderBase]: For 232/232 co-relation queries the response was YES. [2025-04-30 10:30:15,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2953 conditions, 2179 events. 413/2179 cut-off events. For 232/232 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 17325 event pairs, 232 based on Foata normal form. 1/1993 useless extension candidates. Maximal degree in co-relation 1327. Up to 496 conditions per place. [2025-04-30 10:30:15,924 INFO L140 encePairwiseOnDemand]: 106/111 looper letters, 24 selfloop transitions, 4 changer transitions 0/120 dead transitions. [2025-04-30 10:30:15,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 120 transitions, 323 flow [2025-04-30 10:30:15,924 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:30:15,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-30 10:30:15,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 397 transitions. [2025-04-30 10:30:15,925 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8941441441441441 [2025-04-30 10:30:15,925 INFO L175 Difference]: Start difference. First operand has 115 places, 111 transitions, 249 flow. Second operand 4 states and 397 transitions. [2025-04-30 10:30:15,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 120 transitions, 323 flow [2025-04-30 10:30:15,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 120 transitions, 323 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:30:15,928 INFO L231 Difference]: Finished difference. Result has 119 places, 112 transitions, 265 flow [2025-04-30 10:30:15,928 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=265, PETRI_PLACES=119, PETRI_TRANSITIONS=112} [2025-04-30 10:30:15,928 INFO L279 CegarLoopForPetriNet]: 115 programPoint places, 4 predicate places. [2025-04-30 10:30:15,928 INFO L485 AbstractCegarLoop]: Abstraction has has 119 places, 112 transitions, 265 flow [2025-04-30 10:30:15,929 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 93.25) internal successors, (373), 4 states have internal predecessors, (373), 0 states have call successors, (0), 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-30 10:30:15,929 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:15,929 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] [2025-04-30 10:30:15,929 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-30 10:30:15,929 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-04-30 10:30:15,930 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:15,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1157941108, now seen corresponding path program 1 times [2025-04-30 10:30:15,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:15,930 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786593463] [2025-04-30 10:30:15,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:15,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:15,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-30 10:30:15,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-30 10:30:15,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:15,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:16,086 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-30 10:30:16,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:16,086 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786593463] [2025-04-30 10:30:16,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786593463] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:16,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:16,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:30:16,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313781569] [2025-04-30 10:30:16,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:16,087 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:30:16,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:16,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:30:16,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:30:16,198 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 111 [2025-04-30 10:30:16,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 112 transitions, 265 flow. Second operand has 6 states, 6 states have (on average 81.5) internal successors, (489), 6 states have internal predecessors, (489), 0 states have call successors, (0), 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-30 10:30:16,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:16,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 111 [2025-04-30 10:30:16,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:16,573 INFO L116 PetriNetUnfolderBase]: 1292/3917 cut-off events. [2025-04-30 10:30:16,573 INFO L117 PetriNetUnfolderBase]: For 314/314 co-relation queries the response was YES. [2025-04-30 10:30:16,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6266 conditions, 3917 events. 1292/3917 cut-off events. For 314/314 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 34298 event pairs, 412 based on Foata normal form. 0/3662 useless extension candidates. Maximal degree in co-relation 2056. Up to 1483 conditions per place. [2025-04-30 10:30:16,599 INFO L140 encePairwiseOnDemand]: 105/111 looper letters, 50 selfloop transitions, 5 changer transitions 0/135 dead transitions. [2025-04-30 10:30:16,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 135 transitions, 421 flow [2025-04-30 10:30:16,600 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:30:16,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:30:16,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 535 transitions. [2025-04-30 10:30:16,602 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8033033033033034 [2025-04-30 10:30:16,602 INFO L175 Difference]: Start difference. First operand has 119 places, 112 transitions, 265 flow. Second operand 6 states and 535 transitions. [2025-04-30 10:30:16,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 135 transitions, 421 flow [2025-04-30 10:30:16,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 135 transitions, 415 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:30:16,605 INFO L231 Difference]: Finished difference. Result has 121 places, 111 transitions, 267 flow [2025-04-30 10:30:16,606 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=267, PETRI_PLACES=121, PETRI_TRANSITIONS=111} [2025-04-30 10:30:16,606 INFO L279 CegarLoopForPetriNet]: 115 programPoint places, 6 predicate places. [2025-04-30 10:30:16,606 INFO L485 AbstractCegarLoop]: Abstraction has has 121 places, 111 transitions, 267 flow [2025-04-30 10:30:16,607 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 81.5) internal successors, (489), 6 states have internal predecessors, (489), 0 states have call successors, (0), 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-30 10:30:16,607 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:16,607 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] [2025-04-30 10:30:16,607 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-30 10:30:16,607 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-04-30 10:30:16,607 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:16,607 INFO L85 PathProgramCache]: Analyzing trace with hash -84380896, now seen corresponding path program 1 times [2025-04-30 10:30:16,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:16,607 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554085476] [2025-04-30 10:30:16,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:16,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:16,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-30 10:30:16,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-30 10:30:16,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:16,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:16,632 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-30 10:30:16,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:16,632 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554085476] [2025-04-30 10:30:16,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554085476] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:16,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:16,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:30:16,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437447747] [2025-04-30 10:30:16,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:16,633 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:30:16,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:16,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:30:16,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:30:16,645 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 111 [2025-04-30 10:30:16,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 111 transitions, 267 flow. Second operand has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 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-30 10:30:16,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:16,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 111 [2025-04-30 10:30:16,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:16,968 INFO L116 PetriNetUnfolderBase]: 1023/4159 cut-off events. [2025-04-30 10:30:16,968 INFO L117 PetriNetUnfolderBase]: For 676/938 co-relation queries the response was YES. [2025-04-30 10:30:16,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6131 conditions, 4159 events. 1023/4159 cut-off events. For 676/938 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 39816 event pairs, 581 based on Foata normal form. 7/3617 useless extension candidates. Maximal degree in co-relation 2112. Up to 1329 conditions per place. [2025-04-30 10:30:16,994 INFO L140 encePairwiseOnDemand]: 104/111 looper letters, 27 selfloop transitions, 6 changer transitions 0/124 dead transitions. [2025-04-30 10:30:16,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 124 transitions, 377 flow [2025-04-30 10:30:16,995 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:30:16,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:30:16,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 307 transitions. [2025-04-30 10:30:16,996 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9219219219219219 [2025-04-30 10:30:16,996 INFO L175 Difference]: Start difference. First operand has 121 places, 111 transitions, 267 flow. Second operand 3 states and 307 transitions. [2025-04-30 10:30:16,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 124 transitions, 377 flow [2025-04-30 10:30:16,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 124 transitions, 367 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:30:16,998 INFO L231 Difference]: Finished difference. Result has 120 places, 116 transitions, 303 flow [2025-04-30 10:30:16,998 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=303, PETRI_PLACES=120, PETRI_TRANSITIONS=116} [2025-04-30 10:30:16,999 INFO L279 CegarLoopForPetriNet]: 115 programPoint places, 5 predicate places. [2025-04-30 10:30:16,999 INFO L485 AbstractCegarLoop]: Abstraction has has 120 places, 116 transitions, 303 flow [2025-04-30 10:30:16,999 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 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-30 10:30:16,999 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:17,000 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] [2025-04-30 10:30:17,000 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-30 10:30:17,000 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-04-30 10:30:17,000 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:17,000 INFO L85 PathProgramCache]: Analyzing trace with hash -486493613, now seen corresponding path program 1 times [2025-04-30 10:30:17,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:17,000 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746778436] [2025-04-30 10:30:17,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:17,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:17,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-30 10:30:17,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-30 10:30:17,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:17,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:17,039 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-30 10:30:17,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:17,039 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746778436] [2025-04-30 10:30:17,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746778436] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:17,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:17,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:30:17,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213127212] [2025-04-30 10:30:17,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:17,039 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:30:17,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:17,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:30:17,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:30:17,061 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 111 [2025-04-30 10:30:17,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 116 transitions, 303 flow. Second operand has 4 states, 4 states have (on average 93.5) internal successors, (374), 4 states have internal predecessors, (374), 0 states have call successors, (0), 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-30 10:30:17,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:17,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 111 [2025-04-30 10:30:17,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:17,317 INFO L116 PetriNetUnfolderBase]: 662/3141 cut-off events. [2025-04-30 10:30:17,317 INFO L117 PetriNetUnfolderBase]: For 430/450 co-relation queries the response was YES. [2025-04-30 10:30:17,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4682 conditions, 3141 events. 662/3141 cut-off events. For 430/450 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 28398 event pairs, 320 based on Foata normal form. 63/2852 useless extension candidates. Maximal degree in co-relation 3788. Up to 540 conditions per place. [2025-04-30 10:30:17,334 INFO L140 encePairwiseOnDemand]: 106/111 looper letters, 31 selfloop transitions, 4 changer transitions 0/132 dead transitions. [2025-04-30 10:30:17,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 132 transitions, 414 flow [2025-04-30 10:30:17,334 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:30:17,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-30 10:30:17,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 404 transitions. [2025-04-30 10:30:17,335 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9099099099099099 [2025-04-30 10:30:17,335 INFO L175 Difference]: Start difference. First operand has 120 places, 116 transitions, 303 flow. Second operand 4 states and 404 transitions. [2025-04-30 10:30:17,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 132 transitions, 414 flow [2025-04-30 10:30:17,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 132 transitions, 402 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:30:17,338 INFO L231 Difference]: Finished difference. Result has 122 places, 117 transitions, 307 flow [2025-04-30 10:30:17,338 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=291, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=307, PETRI_PLACES=122, PETRI_TRANSITIONS=117} [2025-04-30 10:30:17,339 INFO L279 CegarLoopForPetriNet]: 115 programPoint places, 7 predicate places. [2025-04-30 10:30:17,339 INFO L485 AbstractCegarLoop]: Abstraction has has 122 places, 117 transitions, 307 flow [2025-04-30 10:30:17,340 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 93.5) internal successors, (374), 4 states have internal predecessors, (374), 0 states have call successors, (0), 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-30 10:30:17,340 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:17,340 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-30 10:30:17,340 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-30 10:30:17,340 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-30 10:30:17,340 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:17,340 INFO L85 PathProgramCache]: Analyzing trace with hash -409649734, now seen corresponding path program 1 times [2025-04-30 10:30:17,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:17,340 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191769112] [2025-04-30 10:30:17,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:17,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:17,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-30 10:30:17,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-30 10:30:17,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:17,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:17,410 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-30 10:30:17,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:17,411 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191769112] [2025-04-30 10:30:17,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191769112] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:17,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:17,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:30:17,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627397276] [2025-04-30 10:30:17,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:17,412 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:30:17,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:17,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:30:17,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:30:17,466 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 111 [2025-04-30 10:30:17,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 117 transitions, 307 flow. Second operand has 6 states, 6 states have (on average 91.5) internal successors, (549), 6 states have internal predecessors, (549), 0 states have call successors, (0), 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-30 10:30:17,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:17,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 111 [2025-04-30 10:30:17,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:17,976 INFO L116 PetriNetUnfolderBase]: 950/4761 cut-off events. [2025-04-30 10:30:17,977 INFO L117 PetriNetUnfolderBase]: For 649/649 co-relation queries the response was YES. [2025-04-30 10:30:17,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6986 conditions, 4761 events. 950/4761 cut-off events. For 649/649 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 47710 event pairs, 310 based on Foata normal form. 3/4187 useless extension candidates. Maximal degree in co-relation 3734. Up to 1100 conditions per place. [2025-04-30 10:30:17,997 INFO L140 encePairwiseOnDemand]: 104/111 looper letters, 35 selfloop transitions, 7 changer transitions 0/137 dead transitions. [2025-04-30 10:30:17,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 137 transitions, 433 flow [2025-04-30 10:30:17,998 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:30:17,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-30 10:30:17,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 673 transitions. [2025-04-30 10:30:17,999 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8661518661518661 [2025-04-30 10:30:17,999 INFO L175 Difference]: Start difference. First operand has 122 places, 117 transitions, 307 flow. Second operand 7 states and 673 transitions. [2025-04-30 10:30:17,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 137 transitions, 433 flow [2025-04-30 10:30:18,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 137 transitions, 427 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:30:18,004 INFO L231 Difference]: Finished difference. Result has 129 places, 120 transitions, 337 flow [2025-04-30 10:30:18,004 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=337, PETRI_PLACES=129, PETRI_TRANSITIONS=120} [2025-04-30 10:30:18,004 INFO L279 CegarLoopForPetriNet]: 115 programPoint places, 14 predicate places. [2025-04-30 10:30:18,004 INFO L485 AbstractCegarLoop]: Abstraction has has 129 places, 120 transitions, 337 flow [2025-04-30 10:30:18,005 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 91.5) internal successors, (549), 6 states have internal predecessors, (549), 0 states have call successors, (0), 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-30 10:30:18,005 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:18,005 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] [2025-04-30 10:30:18,005 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-30 10:30:18,005 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-30 10:30:18,005 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:18,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1944991426, now seen corresponding path program 1 times [2025-04-30 10:30:18,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:18,006 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759988415] [2025-04-30 10:30:18,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:18,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:18,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-04-30 10:30:18,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-04-30 10:30:18,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:18,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:18,028 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-30 10:30:18,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:18,028 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759988415] [2025-04-30 10:30:18,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759988415] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:18,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:18,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:30:18,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210255674] [2025-04-30 10:30:18,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:18,029 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:30:18,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:18,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:30:18,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:30:18,044 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 111 [2025-04-30 10:30:18,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 120 transitions, 337 flow. Second operand has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 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-30 10:30:18,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:18,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 111 [2025-04-30 10:30:18,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:18,368 INFO L116 PetriNetUnfolderBase]: 938/3984 cut-off events. [2025-04-30 10:30:18,368 INFO L117 PetriNetUnfolderBase]: For 1268/1479 co-relation queries the response was YES. [2025-04-30 10:30:18,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6761 conditions, 3984 events. 938/3984 cut-off events. For 1268/1479 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 39630 event pairs, 546 based on Foata normal form. 7/3596 useless extension candidates. Maximal degree in co-relation 6424. Up to 1216 conditions per place. [2025-04-30 10:30:18,388 INFO L140 encePairwiseOnDemand]: 104/111 looper letters, 28 selfloop transitions, 9 changer transitions 0/134 dead transitions. [2025-04-30 10:30:18,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 134 transitions, 462 flow [2025-04-30 10:30:18,389 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:30:18,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:30:18,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 306 transitions. [2025-04-30 10:30:18,389 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.918918918918919 [2025-04-30 10:30:18,389 INFO L175 Difference]: Start difference. First operand has 129 places, 120 transitions, 337 flow. Second operand 3 states and 306 transitions. [2025-04-30 10:30:18,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 134 transitions, 462 flow [2025-04-30 10:30:18,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 134 transitions, 452 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-04-30 10:30:18,393 INFO L231 Difference]: Finished difference. Result has 130 places, 127 transitions, 403 flow [2025-04-30 10:30:18,393 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=327, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=403, PETRI_PLACES=130, PETRI_TRANSITIONS=127} [2025-04-30 10:30:18,393 INFO L279 CegarLoopForPetriNet]: 115 programPoint places, 15 predicate places. [2025-04-30 10:30:18,393 INFO L485 AbstractCegarLoop]: Abstraction has has 130 places, 127 transitions, 403 flow [2025-04-30 10:30:18,393 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 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-30 10:30:18,394 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:18,394 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] [2025-04-30 10:30:18,394 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-30 10:30:18,394 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-04-30 10:30:18,394 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:18,394 INFO L85 PathProgramCache]: Analyzing trace with hash 803493320, now seen corresponding path program 1 times [2025-04-30 10:30:18,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:18,394 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197089051] [2025-04-30 10:30:18,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:18,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:18,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-04-30 10:30:18,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-04-30 10:30:18,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:18,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:18,496 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-30 10:30:18,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:18,496 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197089051] [2025-04-30 10:30:18,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197089051] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:18,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:18,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-30 10:30:18,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937267414] [2025-04-30 10:30:18,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:18,496 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:30:18,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:18,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:30:18,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:30:18,573 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 111 [2025-04-30 10:30:18,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 127 transitions, 403 flow. Second operand has 8 states, 8 states have (on average 91.625) internal successors, (733), 8 states have internal predecessors, (733), 0 states have call successors, (0), 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-30 10:30:18,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:18,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 111 [2025-04-30 10:30:18,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:19,116 INFO L116 PetriNetUnfolderBase]: 1255/6166 cut-off events. [2025-04-30 10:30:19,117 INFO L117 PetriNetUnfolderBase]: For 1542/2552 co-relation queries the response was YES. [2025-04-30 10:30:19,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9875 conditions, 6166 events. 1255/6166 cut-off events. For 1542/2552 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 65433 event pairs, 161 based on Foata normal form. 16/5425 useless extension candidates. Maximal degree in co-relation 5439. Up to 961 conditions per place. [2025-04-30 10:30:19,201 INFO L140 encePairwiseOnDemand]: 104/111 looper letters, 47 selfloop transitions, 10 changer transitions 0/159 dead transitions. [2025-04-30 10:30:19,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 159 transitions, 585 flow [2025-04-30 10:30:19,201 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-30 10:30:19,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-30 10:30:19,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 958 transitions. [2025-04-30 10:30:19,203 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.863063063063063 [2025-04-30 10:30:19,204 INFO L175 Difference]: Start difference. First operand has 130 places, 127 transitions, 403 flow. Second operand 10 states and 958 transitions. [2025-04-30 10:30:19,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 159 transitions, 585 flow [2025-04-30 10:30:19,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 159 transitions, 567 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:30:19,209 INFO L231 Difference]: Finished difference. Result has 140 places, 129 transitions, 425 flow [2025-04-30 10:30:19,209 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=425, PETRI_PLACES=140, PETRI_TRANSITIONS=129} [2025-04-30 10:30:19,210 INFO L279 CegarLoopForPetriNet]: 115 programPoint places, 25 predicate places. [2025-04-30 10:30:19,210 INFO L485 AbstractCegarLoop]: Abstraction has has 140 places, 129 transitions, 425 flow [2025-04-30 10:30:19,210 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 91.625) internal successors, (733), 8 states have internal predecessors, (733), 0 states have call successors, (0), 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-30 10:30:19,210 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:19,211 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] [2025-04-30 10:30:19,211 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-30 10:30:19,211 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-30 10:30:19,211 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:19,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1533558378, now seen corresponding path program 1 times [2025-04-30 10:30:19,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:19,212 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348407938] [2025-04-30 10:30:19,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:19,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:19,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-04-30 10:30:19,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-04-30 10:30:19,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:19,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:19,276 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-30 10:30:19,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:19,276 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348407938] [2025-04-30 10:30:19,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348407938] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:19,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:19,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:30:19,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651424272] [2025-04-30 10:30:19,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:19,277 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:30:19,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:19,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:30:19,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:30:19,287 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 111 [2025-04-30 10:30:19,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 129 transitions, 425 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-30 10:30:19,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:19,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 111 [2025-04-30 10:30:19,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:19,408 INFO L116 PetriNetUnfolderBase]: 91/1220 cut-off events. [2025-04-30 10:30:19,408 INFO L117 PetriNetUnfolderBase]: For 292/352 co-relation queries the response was YES. [2025-04-30 10:30:19,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1838 conditions, 1220 events. 91/1220 cut-off events. For 292/352 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 8809 event pairs, 48 based on Foata normal form. 20/1135 useless extension candidates. Maximal degree in co-relation 1574. Up to 106 conditions per place. [2025-04-30 10:30:19,414 INFO L140 encePairwiseOnDemand]: 105/111 looper letters, 12 selfloop transitions, 6 changer transitions 0/128 dead transitions. [2025-04-30 10:30:19,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 128 transitions, 456 flow [2025-04-30 10:30:19,415 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:30:19,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:30:19,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 315 transitions. [2025-04-30 10:30:19,415 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9459459459459459 [2025-04-30 10:30:19,415 INFO L175 Difference]: Start difference. First operand has 140 places, 129 transitions, 425 flow. Second operand 3 states and 315 transitions. [2025-04-30 10:30:19,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 128 transitions, 456 flow [2025-04-30 10:30:19,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 128 transitions, 430 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-04-30 10:30:19,420 INFO L231 Difference]: Finished difference. Result has 136 places, 123 transitions, 375 flow [2025-04-30 10:30:19,420 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=363, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=375, PETRI_PLACES=136, PETRI_TRANSITIONS=123} [2025-04-30 10:30:19,420 INFO L279 CegarLoopForPetriNet]: 115 programPoint places, 21 predicate places. [2025-04-30 10:30:19,421 INFO L485 AbstractCegarLoop]: Abstraction has has 136 places, 123 transitions, 375 flow [2025-04-30 10:30:19,421 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-30 10:30:19,421 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:19,421 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] [2025-04-30 10:30:19,421 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-30 10:30:19,421 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-30 10:30:19,422 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:19,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1108774495, now seen corresponding path program 1 times [2025-04-30 10:30:19,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:19,422 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575947808] [2025-04-30 10:30:19,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:19,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:19,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-04-30 10:30:19,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-30 10:30:19,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:19,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:19,458 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-30 10:30:19,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:19,458 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575947808] [2025-04-30 10:30:19,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575947808] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:19,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:19,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:30:19,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857970339] [2025-04-30 10:30:19,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:19,458 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:30:19,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:19,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:30:19,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:30:19,474 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 111 [2025-04-30 10:30:19,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 123 transitions, 375 flow. Second operand has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 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-30 10:30:19,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:19,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 111 [2025-04-30 10:30:19,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:19,613 INFO L116 PetriNetUnfolderBase]: 177/1401 cut-off events. [2025-04-30 10:30:19,613 INFO L117 PetriNetUnfolderBase]: For 701/749 co-relation queries the response was YES. [2025-04-30 10:30:19,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2420 conditions, 1401 events. 177/1401 cut-off events. For 701/749 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 10845 event pairs, 135 based on Foata normal form. 3/1290 useless extension candidates. Maximal degree in co-relation 2120. Up to 336 conditions per place. [2025-04-30 10:30:19,621 INFO L140 encePairwiseOnDemand]: 106/111 looper letters, 23 selfloop transitions, 4 changer transitions 0/128 dead transitions. [2025-04-30 10:30:19,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 128 transitions, 449 flow [2025-04-30 10:30:19,621 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:30:19,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:30:19,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 299 transitions. [2025-04-30 10:30:19,622 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8978978978978979 [2025-04-30 10:30:19,622 INFO L175 Difference]: Start difference. First operand has 136 places, 123 transitions, 375 flow. Second operand 3 states and 299 transitions. [2025-04-30 10:30:19,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 128 transitions, 449 flow [2025-04-30 10:30:19,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 128 transitions, 443 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:30:19,625 INFO L231 Difference]: Finished difference. Result has 139 places, 126 transitions, 403 flow [2025-04-30 10:30:19,625 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=369, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=403, PETRI_PLACES=139, PETRI_TRANSITIONS=126} [2025-04-30 10:30:19,625 INFO L279 CegarLoopForPetriNet]: 115 programPoint places, 24 predicate places. [2025-04-30 10:30:19,626 INFO L485 AbstractCegarLoop]: Abstraction has has 139 places, 126 transitions, 403 flow [2025-04-30 10:30:19,626 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 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-30 10:30:19,626 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:19,626 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-04-30 10:30:19,626 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-30 10:30:19,626 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-04-30 10:30:19,626 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:19,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1833728379, now seen corresponding path program 1 times [2025-04-30 10:30:19,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:19,627 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281726828] [2025-04-30 10:30:19,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:19,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:19,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-04-30 10:30:19,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-04-30 10:30:19,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:19,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:19,772 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-30 10:30:19,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:19,772 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281726828] [2025-04-30 10:30:19,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281726828] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:19,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:19,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-30 10:30:19,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770564818] [2025-04-30 10:30:19,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:19,773 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:30:19,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:19,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:30:19,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:30:19,841 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 111 [2025-04-30 10:30:19,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 126 transitions, 403 flow. Second operand has 10 states, 10 states have (on average 91.0) internal successors, (910), 10 states have internal predecessors, (910), 0 states have call successors, (0), 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-30 10:30:19,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:19,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 111 [2025-04-30 10:30:19,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:20,069 INFO L116 PetriNetUnfolderBase]: 151/816 cut-off events. [2025-04-30 10:30:20,069 INFO L117 PetriNetUnfolderBase]: For 393/393 co-relation queries the response was YES. [2025-04-30 10:30:20,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1499 conditions, 816 events. 151/816 cut-off events. For 393/393 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 4788 event pairs, 4 based on Foata normal form. 20/817 useless extension candidates. Maximal degree in co-relation 1481. Up to 88 conditions per place. [2025-04-30 10:30:20,073 INFO L140 encePairwiseOnDemand]: 105/111 looper letters, 50 selfloop transitions, 11 changer transitions 0/125 dead transitions. [2025-04-30 10:30:20,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 125 transitions, 498 flow [2025-04-30 10:30:20,074 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-30 10:30:20,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-30 10:30:20,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1219 transitions. [2025-04-30 10:30:20,078 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8447678447678447 [2025-04-30 10:30:20,078 INFO L175 Difference]: Start difference. First operand has 139 places, 126 transitions, 403 flow. Second operand 13 states and 1219 transitions. [2025-04-30 10:30:20,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 125 transitions, 498 flow [2025-04-30 10:30:20,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 125 transitions, 460 flow, removed 8 selfloop flow, removed 11 redundant places. [2025-04-30 10:30:20,081 INFO L231 Difference]: Finished difference. Result has 112 places, 86 transitions, 246 flow [2025-04-30 10:30:20,082 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=246, PETRI_PLACES=112, PETRI_TRANSITIONS=86} [2025-04-30 10:30:20,082 INFO L279 CegarLoopForPetriNet]: 115 programPoint places, -3 predicate places. [2025-04-30 10:30:20,082 INFO L485 AbstractCegarLoop]: Abstraction has has 112 places, 86 transitions, 246 flow [2025-04-30 10:30:20,083 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 91.0) internal successors, (910), 10 states have internal predecessors, (910), 0 states have call successors, (0), 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-30 10:30:20,083 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:20,083 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] [2025-04-30 10:30:20,083 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-30 10:30:20,084 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-04-30 10:30:20,084 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:20,084 INFO L85 PathProgramCache]: Analyzing trace with hash 621349665, now seen corresponding path program 1 times [2025-04-30 10:30:20,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:20,084 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609464678] [2025-04-30 10:30:20,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:20,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:20,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-04-30 10:30:20,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-04-30 10:30:20,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:20,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:30:20,103 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-30 10:30:20,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-04-30 10:30:20,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-04-30 10:30:20,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:20,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:30:20,118 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-30 10:30:20,119 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-30 10:30:20,119 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2025-04-30 10:30:20,119 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 8 remaining) [2025-04-30 10:30:20,119 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 8 remaining) [2025-04-30 10:30:20,119 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 8 remaining) [2025-04-30 10:30:20,119 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 8 remaining) [2025-04-30 10:30:20,119 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 8 remaining) [2025-04-30 10:30:20,119 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 8 remaining) [2025-04-30 10:30:20,119 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 8 remaining) [2025-04-30 10:30:20,120 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-04-30 10:30:20,120 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:30:20,120 WARN L247 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-30 10:30:20,120 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-04-30 10:30:20,138 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-30 10:30:20,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 129 transitions, 298 flow [2025-04-30 10:30:20,171 INFO L116 PetriNetUnfolderBase]: 21/544 cut-off events. [2025-04-30 10:30:20,171 INFO L117 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-04-30 10:30:20,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 595 conditions, 544 events. 21/544 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2058 event pairs, 6 based on Foata normal form. 0/482 useless extension candidates. Maximal degree in co-relation 339. Up to 32 conditions per place. [2025-04-30 10:30:20,173 INFO L82 GeneralOperation]: Start removeDead. Operand has 134 places, 129 transitions, 298 flow [2025-04-30 10:30:20,176 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 134 places, 129 transitions, 298 flow [2025-04-30 10:30:20,177 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:30:20,178 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;@224d1f49, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:30:20,178 INFO L341 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-04-30 10:30:20,179 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-30 10:30:20,179 INFO L116 PetriNetUnfolderBase]: 0/30 cut-off events. [2025-04-30 10:30:20,179 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:30:20,179 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:20,179 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] [2025-04-30 10:30:20,179 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-30 10:30:20,179 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:20,179 INFO L85 PathProgramCache]: Analyzing trace with hash -2129778394, now seen corresponding path program 1 times [2025-04-30 10:30:20,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:20,179 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949506103] [2025-04-30 10:30:20,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:20,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:20,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-30 10:30:20,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-30 10:30:20,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:20,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:20,205 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-30 10:30:20,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:20,206 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949506103] [2025-04-30 10:30:20,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949506103] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:20,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:20,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:30:20,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983412714] [2025-04-30 10:30:20,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:20,206 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:30:20,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:20,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:30:20,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:30:20,230 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 129 [2025-04-30 10:30:20,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 129 transitions, 298 flow. Second operand has 4 states, 4 states have (on average 107.25) internal successors, (429), 4 states have internal predecessors, (429), 0 states have call successors, (0), 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-30 10:30:20,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:20,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 129 [2025-04-30 10:30:20,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:20,784 INFO L116 PetriNetUnfolderBase]: 2017/8193 cut-off events. [2025-04-30 10:30:20,785 INFO L117 PetriNetUnfolderBase]: For 1213/1213 co-relation queries the response was YES. [2025-04-30 10:30:20,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11594 conditions, 8193 events. 2017/8193 cut-off events. For 1213/1213 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 83753 event pairs, 1191 based on Foata normal form. 1/7482 useless extension candidates. Maximal degree in co-relation 5267. Up to 2119 conditions per place. [2025-04-30 10:30:20,885 INFO L140 encePairwiseOnDemand]: 124/129 looper letters, 30 selfloop transitions, 4 changer transitions 0/140 dead transitions. [2025-04-30 10:30:20,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 140 transitions, 388 flow [2025-04-30 10:30:20,886 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:30:20,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-30 10:30:20,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 459 transitions. [2025-04-30 10:30:20,887 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8895348837209303 [2025-04-30 10:30:20,887 INFO L175 Difference]: Start difference. First operand has 134 places, 129 transitions, 298 flow. Second operand 4 states and 459 transitions. [2025-04-30 10:30:20,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 140 transitions, 388 flow [2025-04-30 10:30:20,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 140 transitions, 388 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:30:20,889 INFO L231 Difference]: Finished difference. Result has 138 places, 130 transitions, 314 flow [2025-04-30 10:30:20,889 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=314, PETRI_PLACES=138, PETRI_TRANSITIONS=130} [2025-04-30 10:30:20,890 INFO L279 CegarLoopForPetriNet]: 134 programPoint places, 4 predicate places. [2025-04-30 10:30:20,890 INFO L485 AbstractCegarLoop]: Abstraction has has 138 places, 130 transitions, 314 flow [2025-04-30 10:30:20,890 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.25) internal successors, (429), 4 states have internal predecessors, (429), 0 states have call successors, (0), 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-30 10:30:20,890 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:20,890 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] [2025-04-30 10:30:20,890 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-04-30 10:30:20,890 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-30 10:30:20,890 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:20,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1981921165, now seen corresponding path program 1 times [2025-04-30 10:30:20,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:20,890 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104758100] [2025-04-30 10:30:20,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:20,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:20,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-30 10:30:20,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-30 10:30:20,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:20,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:20,996 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-30 10:30:20,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:20,997 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104758100] [2025-04-30 10:30:20,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104758100] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:20,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:20,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:30:20,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549982829] [2025-04-30 10:30:20,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:20,997 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:30:20,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:20,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:30:20,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:30:21,055 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 129 [2025-04-30 10:30:21,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 130 transitions, 314 flow. Second operand has 6 states, 6 states have (on average 95.5) internal successors, (573), 6 states have internal predecessors, (573), 0 states have call successors, (0), 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-30 10:30:21,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:21,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 129 [2025-04-30 10:30:21,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:22,264 INFO L116 PetriNetUnfolderBase]: 6248/15544 cut-off events. [2025-04-30 10:30:22,264 INFO L117 PetriNetUnfolderBase]: For 1589/1589 co-relation queries the response was YES. [2025-04-30 10:30:22,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25620 conditions, 15544 events. 6248/15544 cut-off events. For 1589/1589 co-relation queries the response was YES. Maximal size of possible extension queue 637. Compared 158434 event pairs, 808 based on Foata normal form. 0/14506 useless extension candidates. Maximal degree in co-relation 8838. Up to 6781 conditions per place. [2025-04-30 10:30:22,363 INFO L140 encePairwiseOnDemand]: 123/129 looper letters, 62 selfloop transitions, 5 changer transitions 0/161 dead transitions. [2025-04-30 10:30:22,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 161 transitions, 510 flow [2025-04-30 10:30:22,363 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:30:22,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:30:22,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 631 transitions. [2025-04-30 10:30:22,365 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8152454780361758 [2025-04-30 10:30:22,365 INFO L175 Difference]: Start difference. First operand has 138 places, 130 transitions, 314 flow. Second operand 6 states and 631 transitions. [2025-04-30 10:30:22,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 161 transitions, 510 flow [2025-04-30 10:30:22,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 161 transitions, 504 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:30:22,373 INFO L231 Difference]: Finished difference. Result has 140 places, 129 transitions, 316 flow [2025-04-30 10:30:22,373 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=316, PETRI_PLACES=140, PETRI_TRANSITIONS=129} [2025-04-30 10:30:22,373 INFO L279 CegarLoopForPetriNet]: 134 programPoint places, 6 predicate places. [2025-04-30 10:30:22,373 INFO L485 AbstractCegarLoop]: Abstraction has has 140 places, 129 transitions, 316 flow [2025-04-30 10:30:22,374 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 95.5) internal successors, (573), 6 states have internal predecessors, (573), 0 states have call successors, (0), 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-30 10:30:22,374 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:22,374 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] [2025-04-30 10:30:22,374 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-04-30 10:30:22,374 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-30 10:30:22,374 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:22,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1397030753, now seen corresponding path program 1 times [2025-04-30 10:30:22,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:22,374 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637546663] [2025-04-30 10:30:22,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:22,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:22,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-30 10:30:22,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-30 10:30:22,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:22,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:22,394 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-30 10:30:22,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:22,395 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637546663] [2025-04-30 10:30:22,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637546663] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:22,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:22,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:30:22,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611875859] [2025-04-30 10:30:22,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:22,395 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:30:22,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:22,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:30:22,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:30:22,414 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 129 [2025-04-30 10:30:22,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 129 transitions, 316 flow. Second operand has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 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-30 10:30:22,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:22,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 129 [2025-04-30 10:30:22,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:24,329 INFO L116 PetriNetUnfolderBase]: 7160/22223 cut-off events. [2025-04-30 10:30:24,329 INFO L117 PetriNetUnfolderBase]: For 5067/5662 co-relation queries the response was YES. [2025-04-30 10:30:24,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34212 conditions, 22223 events. 7160/22223 cut-off events. For 5067/5662 co-relation queries the response was YES. Maximal size of possible extension queue 863. Compared 266185 event pairs, 5035 based on Foata normal form. 10/19757 useless extension candidates. Maximal degree in co-relation 27383. Up to 8447 conditions per place. [2025-04-30 10:30:24,450 INFO L140 encePairwiseOnDemand]: 121/129 looper letters, 36 selfloop transitions, 7 changer transitions 0/147 dead transitions. [2025-04-30 10:30:24,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 147 transitions, 468 flow [2025-04-30 10:30:24,451 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:30:24,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:30:24,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 356 transitions. [2025-04-30 10:30:24,452 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9198966408268734 [2025-04-30 10:30:24,452 INFO L175 Difference]: Start difference. First operand has 140 places, 129 transitions, 316 flow. Second operand 3 states and 356 transitions. [2025-04-30 10:30:24,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 147 transitions, 468 flow [2025-04-30 10:30:24,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 147 transitions, 458 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:30:24,458 INFO L231 Difference]: Finished difference. Result has 139 places, 135 transitions, 360 flow [2025-04-30 10:30:24,458 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=360, PETRI_PLACES=139, PETRI_TRANSITIONS=135} [2025-04-30 10:30:24,458 INFO L279 CegarLoopForPetriNet]: 134 programPoint places, 5 predicate places. [2025-04-30 10:30:24,458 INFO L485 AbstractCegarLoop]: Abstraction has has 139 places, 135 transitions, 360 flow [2025-04-30 10:30:24,459 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 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-30 10:30:24,459 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:24,459 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] [2025-04-30 10:30:24,459 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-04-30 10:30:24,459 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-30 10:30:24,459 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:24,459 INFO L85 PathProgramCache]: Analyzing trace with hash 286342756, now seen corresponding path program 1 times [2025-04-30 10:30:24,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:24,459 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881644394] [2025-04-30 10:30:24,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:24,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:24,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-30 10:30:24,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-30 10:30:24,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:24,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:24,496 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-30 10:30:24,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:24,497 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881644394] [2025-04-30 10:30:24,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881644394] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:24,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:24,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:30:24,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653269439] [2025-04-30 10:30:24,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:24,497 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:30:24,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:24,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:30:24,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:30:24,520 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 129 [2025-04-30 10:30:24,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 135 transitions, 360 flow. Second operand has 4 states, 4 states have (on average 107.5) internal successors, (430), 4 states have internal predecessors, (430), 0 states have call successors, (0), 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-30 10:30:24,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:24,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 129 [2025-04-30 10:30:24,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:25,796 INFO L116 PetriNetUnfolderBase]: 4968/18140 cut-off events. [2025-04-30 10:30:25,796 INFO L117 PetriNetUnfolderBase]: For 2733/2797 co-relation queries the response was YES. [2025-04-30 10:30:25,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28074 conditions, 18140 events. 4968/18140 cut-off events. For 2733/2797 co-relation queries the response was YES. Maximal size of possible extension queue 719. Compared 220497 event pairs, 2078 based on Foata normal form. 259/16273 useless extension candidates. Maximal degree in co-relation 22754. Up to 3640 conditions per place. [2025-04-30 10:30:25,932 INFO L140 encePairwiseOnDemand]: 124/129 looper letters, 40 selfloop transitions, 4 changer transitions 0/156 dead transitions. [2025-04-30 10:30:25,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 156 transitions, 502 flow [2025-04-30 10:30:25,932 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:30:25,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-30 10:30:25,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 469 transitions. [2025-04-30 10:30:25,933 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9089147286821705 [2025-04-30 10:30:25,933 INFO L175 Difference]: Start difference. First operand has 139 places, 135 transitions, 360 flow. Second operand 4 states and 469 transitions. [2025-04-30 10:30:25,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 156 transitions, 502 flow [2025-04-30 10:30:25,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 156 transitions, 488 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:30:25,943 INFO L231 Difference]: Finished difference. Result has 141 places, 136 transitions, 362 flow [2025-04-30 10:30:25,943 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=362, PETRI_PLACES=141, PETRI_TRANSITIONS=136} [2025-04-30 10:30:25,944 INFO L279 CegarLoopForPetriNet]: 134 programPoint places, 7 predicate places. [2025-04-30 10:30:25,944 INFO L485 AbstractCegarLoop]: Abstraction has has 141 places, 136 transitions, 362 flow [2025-04-30 10:30:25,944 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.5) internal successors, (430), 4 states have internal predecessors, (430), 0 states have call successors, (0), 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-30 10:30:25,944 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:25,944 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-30 10:30:25,944 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-04-30 10:30:25,944 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-30 10:30:25,944 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:25,945 INFO L85 PathProgramCache]: Analyzing trace with hash 2134040682, now seen corresponding path program 1 times [2025-04-30 10:30:25,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:25,945 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627738409] [2025-04-30 10:30:25,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:25,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:25,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-30 10:30:25,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-30 10:30:25,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:25,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:25,989 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-30 10:30:25,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:25,989 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627738409] [2025-04-30 10:30:25,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627738409] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:25,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:25,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:30:25,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275213931] [2025-04-30 10:30:25,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:25,990 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:30:25,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:25,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:30:25,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:30:26,024 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 129 [2025-04-30 10:30:26,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 136 transitions, 362 flow. Second operand has 6 states, 6 states have (on average 105.5) internal successors, (633), 6 states have internal predecessors, (633), 0 states have call successors, (0), 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-30 10:30:26,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:26,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 129 [2025-04-30 10:30:26,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:28,293 INFO L116 PetriNetUnfolderBase]: 6364/23537 cut-off events. [2025-04-30 10:30:28,293 INFO L117 PetriNetUnfolderBase]: For 3160/3160 co-relation queries the response was YES. [2025-04-30 10:30:28,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35945 conditions, 23537 events. 6364/23537 cut-off events. For 3160/3160 co-relation queries the response was YES. Maximal size of possible extension queue 883. Compared 298207 event pairs, 2751 based on Foata normal form. 3/20176 useless extension candidates. Maximal degree in co-relation 20507. Up to 5703 conditions per place. [2025-04-30 10:30:28,526 INFO L140 encePairwiseOnDemand]: 122/129 looper letters, 41 selfloop transitions, 7 changer transitions 0/158 dead transitions. [2025-04-30 10:30:28,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 158 transitions, 504 flow [2025-04-30 10:30:28,526 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:30:28,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-30 10:30:28,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 777 transitions. [2025-04-30 10:30:28,527 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8604651162790697 [2025-04-30 10:30:28,527 INFO L175 Difference]: Start difference. First operand has 141 places, 136 transitions, 362 flow. Second operand 7 states and 777 transitions. [2025-04-30 10:30:28,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 158 transitions, 504 flow [2025-04-30 10:30:28,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 158 transitions, 498 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:30:28,536 INFO L231 Difference]: Finished difference. Result has 148 places, 139 transitions, 392 flow [2025-04-30 10:30:28,536 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=392, PETRI_PLACES=148, PETRI_TRANSITIONS=139} [2025-04-30 10:30:28,536 INFO L279 CegarLoopForPetriNet]: 134 programPoint places, 14 predicate places. [2025-04-30 10:30:28,537 INFO L485 AbstractCegarLoop]: Abstraction has has 148 places, 139 transitions, 392 flow [2025-04-30 10:30:28,537 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 105.5) internal successors, (633), 6 states have internal predecessors, (633), 0 states have call successors, (0), 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-30 10:30:28,537 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:28,537 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] [2025-04-30 10:30:28,537 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-04-30 10:30:28,537 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-30 10:30:28,538 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:28,538 INFO L85 PathProgramCache]: Analyzing trace with hash 648038418, now seen corresponding path program 1 times [2025-04-30 10:30:28,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:28,538 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348767013] [2025-04-30 10:30:28,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:28,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:28,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-04-30 10:30:28,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-04-30 10:30:28,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:28,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:28,564 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-30 10:30:28,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:28,564 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348767013] [2025-04-30 10:30:28,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348767013] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:28,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:28,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:30:28,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783461043] [2025-04-30 10:30:28,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:28,564 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:30:28,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:28,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:30:28,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:30:28,584 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 129 [2025-04-30 10:30:28,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 139 transitions, 392 flow. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:30:28,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:28,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 129 [2025-04-30 10:30:28,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:30,833 INFO L116 PetriNetUnfolderBase]: 8620/30231 cut-off events. [2025-04-30 10:30:30,834 INFO L117 PetriNetUnfolderBase]: For 11543/13599 co-relation queries the response was YES. [2025-04-30 10:30:31,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51447 conditions, 30231 events. 8620/30231 cut-off events. For 11543/13599 co-relation queries the response was YES. Maximal size of possible extension queue 1078. Compared 394813 event pairs, 4986 based on Foata normal form. 38/26916 useless extension candidates. Maximal degree in co-relation 50164. Up to 9839 conditions per place. [2025-04-30 10:30:31,178 INFO L140 encePairwiseOnDemand]: 121/129 looper letters, 38 selfloop transitions, 11 changer transitions 0/159 dead transitions. [2025-04-30 10:30:31,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 159 transitions, 569 flow [2025-04-30 10:30:31,178 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:30:31,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:30:31,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 355 transitions. [2025-04-30 10:30:31,179 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.917312661498708 [2025-04-30 10:30:31,179 INFO L175 Difference]: Start difference. First operand has 148 places, 139 transitions, 392 flow. Second operand 3 states and 355 transitions. [2025-04-30 10:30:31,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 159 transitions, 569 flow [2025-04-30 10:30:31,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 159 transitions, 559 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-04-30 10:30:31,207 INFO L231 Difference]: Finished difference. Result has 149 places, 148 transitions, 478 flow [2025-04-30 10:30:31,208 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=382, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=478, PETRI_PLACES=149, PETRI_TRANSITIONS=148} [2025-04-30 10:30:31,208 INFO L279 CegarLoopForPetriNet]: 134 programPoint places, 15 predicate places. [2025-04-30 10:30:31,208 INFO L485 AbstractCegarLoop]: Abstraction has has 149 places, 148 transitions, 478 flow [2025-04-30 10:30:31,208 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:30:31,208 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:31,208 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] [2025-04-30 10:30:31,208 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-04-30 10:30:31,208 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-30 10:30:31,209 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:31,209 INFO L85 PathProgramCache]: Analyzing trace with hash -644953943, now seen corresponding path program 1 times [2025-04-30 10:30:31,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:31,209 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214188638] [2025-04-30 10:30:31,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:31,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:31,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-04-30 10:30:31,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-04-30 10:30:31,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:31,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:31,304 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-30 10:30:31,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:31,304 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214188638] [2025-04-30 10:30:31,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214188638] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:31,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:31,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-30 10:30:31,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391856472] [2025-04-30 10:30:31,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:31,305 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:30:31,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:31,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:30:31,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:30:31,358 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 129 [2025-04-30 10:30:31,358 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 148 transitions, 478 flow. Second operand has 8 states, 8 states have (on average 105.625) internal successors, (845), 8 states have internal predecessors, (845), 0 states have call successors, (0), 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-30 10:30:31,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:31,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 129 [2025-04-30 10:30:31,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:34,484 INFO L116 PetriNetUnfolderBase]: 9234/35955 cut-off events. [2025-04-30 10:30:34,484 INFO L117 PetriNetUnfolderBase]: For 10338/19342 co-relation queries the response was YES. [2025-04-30 10:30:34,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59421 conditions, 35955 events. 9234/35955 cut-off events. For 10338/19342 co-relation queries the response was YES. Maximal size of possible extension queue 1149. Compared 494963 event pairs, 2450 based on Foata normal form. 33/30935 useless extension candidates. Maximal degree in co-relation 28392. Up to 8114 conditions per place. [2025-04-30 10:30:34,744 INFO L140 encePairwiseOnDemand]: 122/129 looper letters, 55 selfloop transitions, 10 changer transitions 0/184 dead transitions. [2025-04-30 10:30:34,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 184 transitions, 690 flow [2025-04-30 10:30:34,745 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-30 10:30:34,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-30 10:30:34,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1106 transitions. [2025-04-30 10:30:34,746 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8573643410852713 [2025-04-30 10:30:34,746 INFO L175 Difference]: Start difference. First operand has 149 places, 148 transitions, 478 flow. Second operand 10 states and 1106 transitions. [2025-04-30 10:30:34,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 184 transitions, 690 flow [2025-04-30 10:30:34,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 184 transitions, 668 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:30:34,776 INFO L231 Difference]: Finished difference. Result has 159 places, 151 transitions, 504 flow [2025-04-30 10:30:34,777 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=504, PETRI_PLACES=159, PETRI_TRANSITIONS=151} [2025-04-30 10:30:34,777 INFO L279 CegarLoopForPetriNet]: 134 programPoint places, 25 predicate places. [2025-04-30 10:30:34,777 INFO L485 AbstractCegarLoop]: Abstraction has has 159 places, 151 transitions, 504 flow [2025-04-30 10:30:34,778 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 105.625) internal successors, (845), 8 states have internal predecessors, (845), 0 states have call successors, (0), 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-30 10:30:34,778 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:34,778 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] [2025-04-30 10:30:34,778 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-04-30 10:30:34,778 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-30 10:30:34,779 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:34,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1578994502, now seen corresponding path program 1 times [2025-04-30 10:30:34,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:34,780 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482068800] [2025-04-30 10:30:34,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:34,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:34,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-04-30 10:30:34,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-04-30 10:30:34,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:34,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:34,817 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-30 10:30:34,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:34,817 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482068800] [2025-04-30 10:30:34,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482068800] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:34,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:34,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:30:34,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097303195] [2025-04-30 10:30:34,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:34,818 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:30:34,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:34,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:30:34,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:30:34,826 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 129 [2025-04-30 10:30:34,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 151 transitions, 504 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-30 10:30:34,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:34,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 129 [2025-04-30 10:30:34,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:35,140 INFO L116 PetriNetUnfolderBase]: 472/4722 cut-off events. [2025-04-30 10:30:35,140 INFO L117 PetriNetUnfolderBase]: For 1435/1689 co-relation queries the response was YES. [2025-04-30 10:30:35,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7181 conditions, 4722 events. 472/4722 cut-off events. For 1435/1689 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 50707 event pairs, 234 based on Foata normal form. 128/4386 useless extension candidates. Maximal degree in co-relation 6326. Up to 454 conditions per place. [2025-04-30 10:30:35,165 INFO L140 encePairwiseOnDemand]: 121/129 looper letters, 16 selfloop transitions, 8 changer transitions 0/149 dead transitions. [2025-04-30 10:30:35,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 149 transitions, 545 flow [2025-04-30 10:30:35,165 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:30:35,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:30:35,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 364 transitions. [2025-04-30 10:30:35,166 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9405684754521964 [2025-04-30 10:30:35,166 INFO L175 Difference]: Start difference. First operand has 159 places, 151 transitions, 504 flow. Second operand 3 states and 364 transitions. [2025-04-30 10:30:35,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 149 transitions, 545 flow [2025-04-30 10:30:35,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 149 transitions, 519 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-04-30 10:30:35,174 INFO L231 Difference]: Finished difference. Result has 155 places, 142 transitions, 440 flow [2025-04-30 10:30:35,174 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=440, PETRI_PLACES=155, PETRI_TRANSITIONS=142} [2025-04-30 10:30:35,174 INFO L279 CegarLoopForPetriNet]: 134 programPoint places, 21 predicate places. [2025-04-30 10:30:35,174 INFO L485 AbstractCegarLoop]: Abstraction has has 155 places, 142 transitions, 440 flow [2025-04-30 10:30:35,174 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-30 10:30:35,174 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:35,175 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] [2025-04-30 10:30:35,175 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-04-30 10:30:35,175 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-30 10:30:35,175 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:35,175 INFO L85 PathProgramCache]: Analyzing trace with hash 199470736, now seen corresponding path program 1 times [2025-04-30 10:30:35,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:35,175 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669096751] [2025-04-30 10:30:35,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:35,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:35,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-04-30 10:30:35,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-30 10:30:35,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:35,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:35,196 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-30 10:30:35,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:35,197 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669096751] [2025-04-30 10:30:35,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669096751] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:35,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:35,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:30:35,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089070032] [2025-04-30 10:30:35,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:35,197 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:30:35,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:35,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:30:35,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:30:35,211 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 129 [2025-04-30 10:30:35,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 142 transitions, 440 flow. Second operand has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:30:35,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:35,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 129 [2025-04-30 10:30:35,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:35,828 INFO L116 PetriNetUnfolderBase]: 934/5912 cut-off events. [2025-04-30 10:30:35,828 INFO L117 PetriNetUnfolderBase]: For 3710/3812 co-relation queries the response was YES. [2025-04-30 10:30:35,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10479 conditions, 5912 events. 934/5912 cut-off events. For 3710/3812 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 66768 event pairs, 666 based on Foata normal form. 4/5387 useless extension candidates. Maximal degree in co-relation 3816. Up to 1548 conditions per place. [2025-04-30 10:30:35,848 INFO L140 encePairwiseOnDemand]: 124/129 looper letters, 30 selfloop transitions, 4 changer transitions 0/149 dead transitions. [2025-04-30 10:30:35,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 149 transitions, 544 flow [2025-04-30 10:30:35,848 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:30:35,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:30:35,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 345 transitions. [2025-04-30 10:30:35,849 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8914728682170543 [2025-04-30 10:30:35,849 INFO L175 Difference]: Start difference. First operand has 155 places, 142 transitions, 440 flow. Second operand 3 states and 345 transitions. [2025-04-30 10:30:35,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 149 transitions, 544 flow [2025-04-30 10:30:35,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 149 transitions, 536 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:30:35,852 INFO L231 Difference]: Finished difference. Result has 158 places, 145 transitions, 466 flow [2025-04-30 10:30:35,852 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=432, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=466, PETRI_PLACES=158, PETRI_TRANSITIONS=145} [2025-04-30 10:30:35,852 INFO L279 CegarLoopForPetriNet]: 134 programPoint places, 24 predicate places. [2025-04-30 10:30:35,852 INFO L485 AbstractCegarLoop]: Abstraction has has 158 places, 145 transitions, 466 flow [2025-04-30 10:30:35,852 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:30:35,852 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:35,852 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-04-30 10:30:35,852 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-04-30 10:30:35,853 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-30 10:30:35,853 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:35,853 INFO L85 PathProgramCache]: Analyzing trace with hash 101737547, now seen corresponding path program 1 times [2025-04-30 10:30:35,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:35,853 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18438458] [2025-04-30 10:30:35,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:35,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:35,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-04-30 10:30:35,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-04-30 10:30:35,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:35,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:35,948 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-30 10:30:35,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:35,949 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18438458] [2025-04-30 10:30:35,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18438458] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:35,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:35,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-30 10:30:35,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797351826] [2025-04-30 10:30:35,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:35,949 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:30:35,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:35,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:30:35,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:30:36,020 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 129 [2025-04-30 10:30:36,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 145 transitions, 466 flow. Second operand has 10 states, 10 states have (on average 105.0) internal successors, (1050), 10 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:30:36,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:36,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 129 [2025-04-30 10:30:36,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:36,721 INFO L116 PetriNetUnfolderBase]: 1216/8139 cut-off events. [2025-04-30 10:30:36,721 INFO L117 PetriNetUnfolderBase]: For 3365/3612 co-relation queries the response was YES. [2025-04-30 10:30:36,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13552 conditions, 8139 events. 1216/8139 cut-off events. For 3365/3612 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 88403 event pairs, 223 based on Foata normal form. 20/7402 useless extension candidates. Maximal degree in co-relation 5488. Up to 893 conditions per place. [2025-04-30 10:30:36,771 INFO L140 encePairwiseOnDemand]: 121/129 looper letters, 76 selfloop transitions, 14 changer transitions 1/203 dead transitions. [2025-04-30 10:30:36,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 203 transitions, 824 flow [2025-04-30 10:30:36,772 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-30 10:30:36,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-30 10:30:36,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1431 transitions. [2025-04-30 10:30:36,773 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.853309481216458 [2025-04-30 10:30:36,773 INFO L175 Difference]: Start difference. First operand has 158 places, 145 transitions, 466 flow. Second operand 13 states and 1431 transitions. [2025-04-30 10:30:36,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 203 transitions, 824 flow [2025-04-30 10:30:36,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 203 transitions, 812 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-04-30 10:30:36,779 INFO L231 Difference]: Finished difference. Result has 172 places, 148 transitions, 516 flow [2025-04-30 10:30:36,779 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=454, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=516, PETRI_PLACES=172, PETRI_TRANSITIONS=148} [2025-04-30 10:30:36,779 INFO L279 CegarLoopForPetriNet]: 134 programPoint places, 38 predicate places. [2025-04-30 10:30:36,779 INFO L485 AbstractCegarLoop]: Abstraction has has 172 places, 148 transitions, 516 flow [2025-04-30 10:30:36,780 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 105.0) internal successors, (1050), 10 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:30:36,780 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:36,780 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] [2025-04-30 10:30:36,780 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-04-30 10:30:36,780 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-30 10:30:36,780 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:36,781 INFO L85 PathProgramCache]: Analyzing trace with hash 2000552193, now seen corresponding path program 1 times [2025-04-30 10:30:36,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:36,781 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222110947] [2025-04-30 10:30:36,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:36,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:36,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-04-30 10:30:36,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-04-30 10:30:36,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:36,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:36,807 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-30 10:30:36,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:36,807 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222110947] [2025-04-30 10:30:36,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222110947] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:36,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:36,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:30:36,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706677805] [2025-04-30 10:30:36,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:36,808 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:30:36,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:36,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:30:36,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:30:36,823 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 129 [2025-04-30 10:30:36,823 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 148 transitions, 516 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-30 10:30:36,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:36,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 129 [2025-04-30 10:30:36,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:37,286 INFO L116 PetriNetUnfolderBase]: 883/5630 cut-off events. [2025-04-30 10:30:37,288 INFO L117 PetriNetUnfolderBase]: For 4117/4213 co-relation queries the response was YES. [2025-04-30 10:30:37,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10508 conditions, 5630 events. 883/5630 cut-off events. For 4117/4213 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 61690 event pairs, 677 based on Foata normal form. 4/5132 useless extension candidates. Maximal degree in co-relation 9689. Up to 1476 conditions per place. [2025-04-30 10:30:37,342 INFO L140 encePairwiseOnDemand]: 124/129 looper letters, 30 selfloop transitions, 4 changer transitions 0/154 dead transitions. [2025-04-30 10:30:37,342 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 154 transitions, 611 flow [2025-04-30 10:30:37,342 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:30:37,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:30:37,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 344 transitions. [2025-04-30 10:30:37,344 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8888888888888888 [2025-04-30 10:30:37,344 INFO L175 Difference]: Start difference. First operand has 172 places, 148 transitions, 516 flow. Second operand 3 states and 344 transitions. [2025-04-30 10:30:37,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 154 transitions, 611 flow [2025-04-30 10:30:37,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 154 transitions, 581 flow, removed 7 selfloop flow, removed 8 redundant places. [2025-04-30 10:30:37,352 INFO L231 Difference]: Finished difference. Result has 168 places, 151 transitions, 522 flow [2025-04-30 10:30:37,353 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=522, PETRI_PLACES=168, PETRI_TRANSITIONS=151} [2025-04-30 10:30:37,353 INFO L279 CegarLoopForPetriNet]: 134 programPoint places, 34 predicate places. [2025-04-30 10:30:37,353 INFO L485 AbstractCegarLoop]: Abstraction has has 168 places, 151 transitions, 522 flow [2025-04-30 10:30:37,353 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-30 10:30:37,353 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:37,353 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 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-30 10:30:37,353 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-04-30 10:30:37,354 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-30 10:30:37,354 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:37,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1418927850, now seen corresponding path program 1 times [2025-04-30 10:30:37,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:37,354 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281948057] [2025-04-30 10:30:37,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:37,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:37,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-04-30 10:30:37,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-04-30 10:30:37,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:37,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:37,538 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-30 10:30:37,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:37,538 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281948057] [2025-04-30 10:30:37,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281948057] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:37,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:37,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:30:37,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150950727] [2025-04-30 10:30:37,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:37,539 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:30:37,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:37,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:30:37,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:30:37,609 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 129 [2025-04-30 10:30:37,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 151 transitions, 522 flow. Second operand has 6 states, 6 states have (on average 98.66666666666667) internal successors, (592), 6 states have internal predecessors, (592), 0 states have call successors, (0), 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-30 10:30:37,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:37,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 129 [2025-04-30 10:30:37,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:38,515 INFO L116 PetriNetUnfolderBase]: 2726/11128 cut-off events. [2025-04-30 10:30:38,515 INFO L117 PetriNetUnfolderBase]: For 4376/4680 co-relation queries the response was YES. [2025-04-30 10:30:38,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21466 conditions, 11128 events. 2726/11128 cut-off events. For 4376/4680 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 122138 event pairs, 1342 based on Foata normal form. 0/10424 useless extension candidates. Maximal degree in co-relation 19173. Up to 2509 conditions per place. [2025-04-30 10:30:38,574 INFO L140 encePairwiseOnDemand]: 123/129 looper letters, 59 selfloop transitions, 6 changer transitions 0/182 dead transitions. [2025-04-30 10:30:38,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 182 transitions, 746 flow [2025-04-30 10:30:38,575 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:30:38,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:30:38,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 641 transitions. [2025-04-30 10:30:38,576 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8281653746770026 [2025-04-30 10:30:38,576 INFO L175 Difference]: Start difference. First operand has 168 places, 151 transitions, 522 flow. Second operand 6 states and 641 transitions. [2025-04-30 10:30:38,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 182 transitions, 746 flow [2025-04-30 10:30:38,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 182 transitions, 732 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-04-30 10:30:38,594 INFO L231 Difference]: Finished difference. Result has 170 places, 150 transitions, 518 flow [2025-04-30 10:30:38,594 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=518, PETRI_PLACES=170, PETRI_TRANSITIONS=150} [2025-04-30 10:30:38,595 INFO L279 CegarLoopForPetriNet]: 134 programPoint places, 36 predicate places. [2025-04-30 10:30:38,595 INFO L485 AbstractCegarLoop]: Abstraction has has 170 places, 150 transitions, 518 flow [2025-04-30 10:30:38,595 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.66666666666667) internal successors, (592), 6 states have internal predecessors, (592), 0 states have call successors, (0), 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-30 10:30:38,595 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:38,595 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:30:38,595 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-04-30 10:30:38,595 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-30 10:30:38,596 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:38,596 INFO L85 PathProgramCache]: Analyzing trace with hash 647435299, now seen corresponding path program 1 times [2025-04-30 10:30:38,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:38,596 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475342277] [2025-04-30 10:30:38,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:38,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:38,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-04-30 10:30:38,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-04-30 10:30:38,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:38,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:38,712 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-30 10:30:38,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:38,713 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475342277] [2025-04-30 10:30:38,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475342277] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:38,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:38,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-30 10:30:38,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843773757] [2025-04-30 10:30:38,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:38,713 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-30 10:30:38,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:38,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-30 10:30:38,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-04-30 10:30:38,842 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 129 [2025-04-30 10:30:38,843 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 150 transitions, 518 flow. Second operand has 12 states, 12 states have (on average 105.0) internal successors, (1260), 12 states have internal predecessors, (1260), 0 states have call successors, (0), 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-30 10:30:38,843 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:38,843 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 129 [2025-04-30 10:30:38,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:39,671 INFO L116 PetriNetUnfolderBase]: 1190/7524 cut-off events. [2025-04-30 10:30:39,672 INFO L117 PetriNetUnfolderBase]: For 3998/4226 co-relation queries the response was YES. [2025-04-30 10:30:39,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14306 conditions, 7524 events. 1190/7524 cut-off events. For 3998/4226 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 80736 event pairs, 159 based on Foata normal form. 48/7004 useless extension candidates. Maximal degree in co-relation 4960. Up to 557 conditions per place. [2025-04-30 10:30:39,715 INFO L140 encePairwiseOnDemand]: 121/129 looper letters, 90 selfloop transitions, 16 changer transitions 8/227 dead transitions. [2025-04-30 10:30:39,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 227 transitions, 974 flow [2025-04-30 10:30:39,716 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-30 10:30:39,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-30 10:30:39,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1763 transitions. [2025-04-30 10:30:39,717 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8541666666666666 [2025-04-30 10:30:39,717 INFO L175 Difference]: Start difference. First operand has 170 places, 150 transitions, 518 flow. Second operand 16 states and 1763 transitions. [2025-04-30 10:30:39,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 227 transitions, 974 flow [2025-04-30 10:30:39,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 227 transitions, 954 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-04-30 10:30:39,727 INFO L231 Difference]: Finished difference. Result has 176 places, 148 transitions, 518 flow [2025-04-30 10:30:39,727 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=518, PETRI_PLACES=176, PETRI_TRANSITIONS=148} [2025-04-30 10:30:39,728 INFO L279 CegarLoopForPetriNet]: 134 programPoint places, 42 predicate places. [2025-04-30 10:30:39,728 INFO L485 AbstractCegarLoop]: Abstraction has has 176 places, 148 transitions, 518 flow [2025-04-30 10:30:39,728 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 105.0) internal successors, (1260), 12 states have internal predecessors, (1260), 0 states have call successors, (0), 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-30 10:30:39,728 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:39,728 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 10:30:39,728 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-04-30 10:30:39,728 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-30 10:30:39,729 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:39,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1808224759, now seen corresponding path program 1 times [2025-04-30 10:30:39,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:39,729 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538598587] [2025-04-30 10:30:39,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:39,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:39,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-04-30 10:30:39,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-04-30 10:30:39,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:39,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:39,762 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-30 10:30:39,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:39,762 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538598587] [2025-04-30 10:30:39,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538598587] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:39,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:39,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:30:39,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819368544] [2025-04-30 10:30:39,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:39,762 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:30:39,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:39,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:30:39,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:30:39,775 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 129 [2025-04-30 10:30:39,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 148 transitions, 518 flow. Second operand has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 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-30 10:30:39,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:39,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 129 [2025-04-30 10:30:39,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:40,506 INFO L116 PetriNetUnfolderBase]: 1353/8854 cut-off events. [2025-04-30 10:30:40,506 INFO L117 PetriNetUnfolderBase]: For 5201/5285 co-relation queries the response was YES. [2025-04-30 10:30:40,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16720 conditions, 8854 events. 1353/8854 cut-off events. For 5201/5285 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 105791 event pairs, 605 based on Foata normal form. 0/8294 useless extension candidates. Maximal degree in co-relation 15933. Up to 1591 conditions per place. [2025-04-30 10:30:40,539 INFO L140 encePairwiseOnDemand]: 122/129 looper letters, 30 selfloop transitions, 9 changer transitions 1/161 dead transitions. [2025-04-30 10:30:40,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 161 transitions, 652 flow [2025-04-30 10:30:40,539 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:30:40,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:30:40,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 355 transitions. [2025-04-30 10:30:40,540 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.917312661498708 [2025-04-30 10:30:40,540 INFO L175 Difference]: Start difference. First operand has 176 places, 148 transitions, 518 flow. Second operand 3 states and 355 transitions. [2025-04-30 10:30:40,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 161 transitions, 652 flow [2025-04-30 10:30:40,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 161 transitions, 584 flow, removed 6 selfloop flow, removed 21 redundant places. [2025-04-30 10:30:40,571 INFO L231 Difference]: Finished difference. Result has 159 places, 152 transitions, 526 flow [2025-04-30 10:30:40,571 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=450, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=526, PETRI_PLACES=159, PETRI_TRANSITIONS=152} [2025-04-30 10:30:40,571 INFO L279 CegarLoopForPetriNet]: 134 programPoint places, 25 predicate places. [2025-04-30 10:30:40,571 INFO L485 AbstractCegarLoop]: Abstraction has has 159 places, 152 transitions, 526 flow [2025-04-30 10:30:40,572 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 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-30 10:30:40,572 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:40,572 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 10:30:40,572 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-04-30 10:30:40,572 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-30 10:30:40,572 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:40,572 INFO L85 PathProgramCache]: Analyzing trace with hash 997206334, now seen corresponding path program 1 times [2025-04-30 10:30:40,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:40,572 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816897104] [2025-04-30 10:30:40,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:40,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:40,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-04-30 10:30:40,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-04-30 10:30:40,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:40,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:40,666 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-30 10:30:40,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:40,666 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816897104] [2025-04-30 10:30:40,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816897104] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:40,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:40,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:30:40,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145768066] [2025-04-30 10:30:40,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:40,667 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:30:40,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:40,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:30:40,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:30:40,703 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 129 [2025-04-30 10:30:40,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 152 transitions, 526 flow. Second operand has 5 states, 5 states have (on average 108.8) internal successors, (544), 5 states have internal predecessors, (544), 0 states have call successors, (0), 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-30 10:30:40,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:40,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 129 [2025-04-30 10:30:40,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:41,263 INFO L116 PetriNetUnfolderBase]: 806/5317 cut-off events. [2025-04-30 10:30:41,263 INFO L117 PetriNetUnfolderBase]: For 3437/3639 co-relation queries the response was YES. [2025-04-30 10:30:41,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9815 conditions, 5317 events. 806/5317 cut-off events. For 3437/3639 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 53070 event pairs, 221 based on Foata normal form. 80/5250 useless extension candidates. Maximal degree in co-relation 9151. Up to 610 conditions per place. [2025-04-30 10:30:41,287 INFO L140 encePairwiseOnDemand]: 124/129 looper letters, 44 selfloop transitions, 5 changer transitions 8/185 dead transitions. [2025-04-30 10:30:41,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 185 transitions, 752 flow [2025-04-30 10:30:41,289 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:30:41,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-30 10:30:41,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 588 transitions. [2025-04-30 10:30:41,289 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9116279069767442 [2025-04-30 10:30:41,289 INFO L175 Difference]: Start difference. First operand has 159 places, 152 transitions, 526 flow. Second operand 5 states and 588 transitions. [2025-04-30 10:30:41,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 185 transitions, 752 flow [2025-04-30 10:30:41,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 185 transitions, 734 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:30:41,296 INFO L231 Difference]: Finished difference. Result has 162 places, 153 transitions, 528 flow [2025-04-30 10:30:41,296 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=528, PETRI_PLACES=162, PETRI_TRANSITIONS=153} [2025-04-30 10:30:41,296 INFO L279 CegarLoopForPetriNet]: 134 programPoint places, 28 predicate places. [2025-04-30 10:30:41,296 INFO L485 AbstractCegarLoop]: Abstraction has has 162 places, 153 transitions, 528 flow [2025-04-30 10:30:41,296 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.8) internal successors, (544), 5 states have internal predecessors, (544), 0 states have call successors, (0), 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-30 10:30:41,296 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:41,296 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1] [2025-04-30 10:30:41,296 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-04-30 10:30:41,297 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-30 10:30:41,297 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:41,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1258422098, now seen corresponding path program 1 times [2025-04-30 10:30:41,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:41,297 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733733387] [2025-04-30 10:30:41,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:41,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:41,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-04-30 10:30:41,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-04-30 10:30:41,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:41,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:42,192 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-30 10:30:42,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:42,192 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733733387] [2025-04-30 10:30:42,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733733387] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:30:42,192 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101166423] [2025-04-30 10:30:42,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:42,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:30:42,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:30:42,195 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:30:42,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-30 10:30:42,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-04-30 10:30:42,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-04-30 10:30:42,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:42,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:42,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-30 10:30:42,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:30:42,688 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-30 10:30:42,846 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:30:42,847 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-04-30 10:30:43,126 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-04-30 10:30:43,151 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-30 10:30:43,151 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:30:43,569 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2025-04-30 10:30:43,573 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2025-04-30 10:30:43,845 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-30 10:30:43,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [101166423] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:30:43,846 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:30:43,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19, 18] total 54 [2025-04-30 10:30:43,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560007198] [2025-04-30 10:30:43,846 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:30:43,846 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2025-04-30 10:30:43,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:43,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2025-04-30 10:30:43,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=2608, Unknown=0, NotChecked=0, Total=2862 [2025-04-30 10:30:48,139 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 129 [2025-04-30 10:30:48,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 153 transitions, 528 flow. Second operand has 54 states, 54 states have (on average 96.74074074074075) internal successors, (5224), 54 states have internal predecessors, (5224), 0 states have call successors, (0), 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-30 10:30:48,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:48,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 129 [2025-04-30 10:30:48,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:49,982 INFO L116 PetriNetUnfolderBase]: 1748/7105 cut-off events. [2025-04-30 10:30:49,982 INFO L117 PetriNetUnfolderBase]: For 3818/4014 co-relation queries the response was YES. [2025-04-30 10:30:50,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14382 conditions, 7105 events. 1748/7105 cut-off events. For 3818/4014 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 69470 event pairs, 87 based on Foata normal form. 24/6917 useless extension candidates. Maximal degree in co-relation 6034. Up to 893 conditions per place. [2025-04-30 10:30:50,013 INFO L140 encePairwiseOnDemand]: 111/129 looper letters, 135 selfloop transitions, 28 changer transitions 8/278 dead transitions. [2025-04-30 10:30:50,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 278 transitions, 1239 flow [2025-04-30 10:30:50,014 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-30 10:30:50,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-04-30 10:30:50,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 2521 transitions. [2025-04-30 10:30:50,015 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7817054263565891 [2025-04-30 10:30:50,015 INFO L175 Difference]: Start difference. First operand has 162 places, 153 transitions, 528 flow. Second operand 25 states and 2521 transitions. [2025-04-30 10:30:50,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 278 transitions, 1239 flow [2025-04-30 10:30:50,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 278 transitions, 1229 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-04-30 10:30:50,023 INFO L231 Difference]: Finished difference. Result has 191 places, 161 transitions, 626 flow [2025-04-30 10:30:50,023 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=518, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=626, PETRI_PLACES=191, PETRI_TRANSITIONS=161} [2025-04-30 10:30:50,023 INFO L279 CegarLoopForPetriNet]: 134 programPoint places, 57 predicate places. [2025-04-30 10:30:50,023 INFO L485 AbstractCegarLoop]: Abstraction has has 191 places, 161 transitions, 626 flow [2025-04-30 10:30:50,025 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 96.74074074074075) internal successors, (5224), 54 states have internal predecessors, (5224), 0 states have call successors, (0), 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-30 10:30:50,025 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:50,025 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1] [2025-04-30 10:30:50,031 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-30 10:30:50,229 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:30:50,229 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-30 10:30:50,230 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:50,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1633583648, now seen corresponding path program 2 times [2025-04-30 10:30:50,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:50,230 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864572792] [2025-04-30 10:30:50,230 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:30:50,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:50,242 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 148 statements into 2 equivalence classes. [2025-04-30 10:30:50,254 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 148 of 148 statements. [2025-04-30 10:30:50,254 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:30:50,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:51,262 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-30 10:30:51,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:51,263 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864572792] [2025-04-30 10:30:51,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864572792] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:30:51,263 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [887619867] [2025-04-30 10:30:51,263 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:30:51,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:30:51,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:30:51,265 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:30:51,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-30 10:30:51,349 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 148 statements into 2 equivalence classes. [2025-04-30 10:30:51,638 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 148 of 148 statements. [2025-04-30 10:30:51,638 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:30:51,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:51,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-04-30 10:30:51,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:30:52,020 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-30 10:30:52,149 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:30:52,150 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-04-30 10:30:52,306 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-04-30 10:30:52,327 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-30 10:30:52,327 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:30:52,606 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2025-04-30 10:30:52,609 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2025-04-30 10:30:52,904 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-30 10:30:52,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [887619867] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:30:52,905 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:30:52,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 20, 19] total 56 [2025-04-30 10:30:52,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191329522] [2025-04-30 10:30:52,905 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:30:52,905 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2025-04-30 10:30:52,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:52,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2025-04-30 10:30:52,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=2869, Unknown=0, NotChecked=0, Total=3080 [2025-04-30 10:31:00,966 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 129 [2025-04-30 10:31:00,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 161 transitions, 626 flow. Second operand has 56 states, 56 states have (on average 97.51785714285714) internal successors, (5461), 56 states have internal predecessors, (5461), 0 states have call successors, (0), 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-30 10:31:00,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:31:00,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 129 [2025-04-30 10:31:00,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:31:03,363 INFO L116 PetriNetUnfolderBase]: 1366/5545 cut-off events. [2025-04-30 10:31:03,364 INFO L117 PetriNetUnfolderBase]: For 3832/3940 co-relation queries the response was YES. [2025-04-30 10:31:03,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12004 conditions, 5545 events. 1366/5545 cut-off events. For 3832/3940 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 49879 event pairs, 32 based on Foata normal form. 36/5479 useless extension candidates. Maximal degree in co-relation 6662. Up to 713 conditions per place. [2025-04-30 10:31:03,396 INFO L140 encePairwiseOnDemand]: 110/129 looper letters, 150 selfloop transitions, 38 changer transitions 8/304 dead transitions. [2025-04-30 10:31:03,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 304 transitions, 1465 flow [2025-04-30 10:31:03,397 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-30 10:31:03,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2025-04-30 10:31:03,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 3332 transitions. [2025-04-30 10:31:03,398 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7827108292224572 [2025-04-30 10:31:03,398 INFO L175 Difference]: Start difference. First operand has 191 places, 161 transitions, 626 flow. Second operand 33 states and 3332 transitions. [2025-04-30 10:31:03,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 304 transitions, 1465 flow [2025-04-30 10:31:03,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 304 transitions, 1423 flow, removed 1 selfloop flow, removed 17 redundant places. [2025-04-30 10:31:03,408 INFO L231 Difference]: Finished difference. Result has 210 places, 168 transitions, 712 flow [2025-04-30 10:31:03,409 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=584, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=712, PETRI_PLACES=210, PETRI_TRANSITIONS=168} [2025-04-30 10:31:03,409 INFO L279 CegarLoopForPetriNet]: 134 programPoint places, 76 predicate places. [2025-04-30 10:31:03,409 INFO L485 AbstractCegarLoop]: Abstraction has has 210 places, 168 transitions, 712 flow [2025-04-30 10:31:03,410 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 97.51785714285714) internal successors, (5461), 56 states have internal predecessors, (5461), 0 states have call successors, (0), 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-30 10:31:03,410 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:03,411 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1] [2025-04-30 10:31:03,417 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-30 10:31:03,611 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2025-04-30 10:31:03,611 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-30 10:31:03,612 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:03,612 INFO L85 PathProgramCache]: Analyzing trace with hash -384249833, now seen corresponding path program 1 times [2025-04-30 10:31:03,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:03,612 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630987757] [2025-04-30 10:31:03,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:03,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:03,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-04-30 10:31:03,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-04-30 10:31:03,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:03,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:31:03,638 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-30 10:31:03,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-04-30 10:31:03,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-04-30 10:31:03,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:03,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:31:03,672 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-30 10:31:03,673 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-30 10:31:03,673 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (8 of 9 remaining) [2025-04-30 10:31:03,673 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2025-04-30 10:31:03,673 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2025-04-30 10:31:03,673 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2025-04-30 10:31:03,673 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 9 remaining) [2025-04-30 10:31:03,673 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2025-04-30 10:31:03,673 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2025-04-30 10:31:03,673 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2025-04-30 10:31:03,674 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2025-04-30 10:31:03,674 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-04-30 10:31:03,674 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:31:03,778 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 4 thread instances [2025-04-30 10:31:03,778 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-30 10:31:03,784 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.04 10:31:03 BasicIcfg [2025-04-30 10:31:03,784 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-30 10:31:03,784 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-30 10:31:03,784 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-30 10:31:03,785 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-30 10:31:03,785 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:30:12" (3/4) ... [2025-04-30 10:31:03,786 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-04-30 10:31:03,873 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 9. [2025-04-30 10:31:03,914 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-30 10:31:03,915 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-30 10:31:03,915 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-30 10:31:03,916 INFO L158 Benchmark]: Toolchain (without parser) took 52271.71ms. Allocated memory was 142.6MB in the beginning and 4.2GB in the end (delta: 4.0GB). Free memory was 113.9MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 2.8GB. Max. memory is 16.1GB. [2025-04-30 10:31:03,916 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:31:03,917 INFO L158 Benchmark]: CACSL2BoogieTranslator took 416.76ms. Allocated memory is still 142.6MB. Free memory was 113.9MB in the beginning and 91.8MB in the end (delta: 22.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-30 10:31:03,917 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.79ms. Allocated memory is still 142.6MB. Free memory was 91.8MB in the beginning and 90.0MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-30 10:31:03,917 INFO L158 Benchmark]: Boogie Preprocessor took 18.95ms. Allocated memory is still 142.6MB. Free memory was 90.0MB in the beginning and 88.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:31:03,918 INFO L158 Benchmark]: RCFGBuilder took 255.36ms. Allocated memory is still 142.6MB. Free memory was 88.5MB in the beginning and 73.7MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-30 10:31:03,918 INFO L158 Benchmark]: TraceAbstraction took 51409.93ms. Allocated memory was 142.6MB in the beginning and 4.2GB in the end (delta: 4.0GB). Free memory was 72.7MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 2.7GB. Max. memory is 16.1GB. [2025-04-30 10:31:03,919 INFO L158 Benchmark]: Witness Printer took 130.26ms. Allocated memory is still 4.2GB. Free memory was 1.4GB in the beginning and 1.3GB in the end (delta: 58.7MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-04-30 10:31:03,919 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.19ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 416.76ms. Allocated memory is still 142.6MB. Free memory was 113.9MB in the beginning and 91.8MB in the end (delta: 22.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.79ms. Allocated memory is still 142.6MB. Free memory was 91.8MB in the beginning and 90.0MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 18.95ms. Allocated memory is still 142.6MB. Free memory was 90.0MB in the beginning and 88.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 255.36ms. Allocated memory is still 142.6MB. Free memory was 88.5MB in the beginning and 73.7MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 51409.93ms. Allocated memory was 142.6MB in the beginning and 4.2GB in the end (delta: 4.0GB). Free memory was 72.7MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 2.7GB. Max. memory is 16.1GB. * Witness Printer took 130.26ms. Allocated memory is still 4.2GB. Free memory was 1.4GB in the beginning and 1.3GB in the end (delta: 58.7MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 685]: Data race detected Data race detected The following path leads to a data race: [L681] 0 int data = 0; VAL [data=0] [L682] 0 pthread_mutex_t data_mutex = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; VAL [data=0, data_mutex={1:0}] [L690] 0 int threads_total = 4; VAL [data=0, data_mutex={1:0}, threads_total=4] [L691] 0 pthread_t tids[4]; VAL [data=0, data_mutex={1:0}, threads_total=4, tids={17:0}] [L692] 0 int i = 0; VAL [data=0, data_mutex={1:0}, i=0, threads_total=4, tids={17:0}] [L692] COND TRUE 0 i < threads_total VAL [data=0, data_mutex={1:0}] [L693] 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [data=0, data_mutex={1:0}, i=0, threads_total=4, tids={17:0}] [L693] FCALL, FORK 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [\at(arg, Pre)={0:0}, data=0, data_mutex={1:0}, i=0, threads_total=4, tids={17:0}] [L685] 1 data = __VERIFIER_nondet_int() VAL [\at(arg, Pre)={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L692] 0 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=1, threads_total=4, tids={17:0}] [L692] COND TRUE 0 i < threads_total VAL [\at(arg, Pre)={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L693] 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [\at(arg, Pre)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=1, threads_total=4, tids={17:0}] [L693] FCALL, FORK 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [\at(arg, Pre)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=1, threads_total=4, tids={17:0}] [L692] 0 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=4, tids={17:0}] [L692] COND TRUE 0 i < threads_total VAL [\at(arg, Pre)={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L693] 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [\at(arg, Pre)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=4, tids={17:0}] [L693] FCALL, FORK 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [\at(arg, Pre)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=4, tids={17:0}] [L685] 3 data = __VERIFIER_nondet_int() VAL [\at(arg, Pre)={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L685] 3 data = __VERIFIER_nondet_int() VAL [\at(arg, Pre)={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L685] 2 data = __VERIFIER_nondet_int() VAL [\at(arg, Pre)={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L692] 0 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=3, threads_total=4, tids={17:0}] [L692] COND TRUE 0 i < threads_total VAL [\at(arg, Pre)={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L693] 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [\at(arg, Pre)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=3, threads_total=4, tids={17:0}] [L693] FCALL, FORK 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [\at(arg, Pre)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=3, threads_total=4, tids={17:0}] [L692] 0 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=4, threads_total=4, tids={17:0}] [L692] COND FALSE 0 !(i < threads_total) VAL [\at(arg, Pre)={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L695] 0 int i = 0; VAL [\at(arg, Pre)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=0, threads_total=4, tids={17:0}] [L695] COND TRUE 0 i < threads_total VAL [\at(arg, Pre)={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L696] EXPR 0 tids[i] VAL [\at(arg, Pre)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=0, threads_total=4, tids={17:0}] [L696] 0 pthread_join(tids[i], ((void *)0)) VAL [\at(arg, Pre)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=0, threads_total=4, tids={17:0}] [L687] 1 return ((void *)0); VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L696] FCALL, JOIN 1 pthread_join(tids[i], ((void *)0)) VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=0, threads_total=4, tids={17:0}] [L695] 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=4, tids={17:0}] [L695] COND TRUE 0 i < threads_total VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L696] EXPR 0 tids[i] VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=4, tids={17:0}] [L687] 3 return ((void *)0); VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L696] 0 pthread_join(tids[i], ((void *)0)) VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=4, tids={17:0}] [L696] FCALL, JOIN 3 pthread_join(tids[i], ((void *)0)) VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=4, tids={17:0}] [L695] 0 i += 2 VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=4, threads_total=4, tids={17:0}] [L695] COND FALSE 0 !(i < threads_total) VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L698] 0 return data; VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, threads_total=4, tids={17:0}] [L685] 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; [698] and C: data = __VERIFIER_nondet_int() [685] - UnprovableResult [Line: 698]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 696]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 693]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 693]: 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, 92 locations, 93 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: 1.6s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 245 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 152 mSDsluCounter, 31 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 23 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 375 IncrementalHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 8 mSDtfsCounter, 375 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=189occurred in iteration=3, 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.7s InterpolantComputationTime, 206 NumberOfCodeBlocks, 206 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 158 ConstructedInterpolants, 0 QuantifiedInterpolants, 443 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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 2 thread instances CFG has 4 procedures, 109 locations, 111 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.6s, OverallIterations: 8, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 492 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 341 mSDsluCounter, 118 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 83 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 587 IncrementalHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 35 mSDtfsCounter, 587 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=314occurred in iteration=6, InterpolantAutomatonStates: 37, 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, 334 NumberOfCodeBlocks, 334 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 267 ConstructedInterpolants, 0 QuantifiedInterpolants, 730 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 3 thread instances CFG has 5 procedures, 126 locations, 129 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.5s, OverallIterations: 11, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 787 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 561 mSDsluCounter, 199 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 103 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1196 IncrementalHoareTripleChecker+Invalid, 1212 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 96 mSDtfsCounter, 1196 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=425occurred in iteration=7, InterpolantAutomatonStates: 56, 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.6s InterpolantComputationTime, 556 NumberOfCodeBlocks, 556 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 469 ConstructedInterpolants, 0 QuantifiedInterpolants, 1292 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 39/39 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, 143 locations, 147 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: 43.5s, OverallIterations: 18, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 36.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4857 SdHoareTripleChecker+Valid, 15.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4484 mSDsluCounter, 8368 SdHoareTripleChecker+Invalid, 13.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8260 mSDsCounter, 115 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 46410 IncrementalHoareTripleChecker+Invalid, 46525 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 115 mSolverCounterUnsat, 108 mSDtfsCounter, 46410 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 784 GetRequests, 555 SyntacticMatches, 1 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3679 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=712occurred in iteration=17, InterpolantAutomatonStates: 147, 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.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 1730 NumberOfCodeBlocks, 1730 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1857 ConstructedInterpolants, 36 QuantifiedInterpolants, 12105 SizeOfPredicates, 32 NumberOfNonLiveVariables, 806 ConjunctsInSsa, 59 ConjunctsInUnsatCore, 21 InterpolantComputations, 15 PerfectInterpolantSequences, 34/91 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-30 10:31:03,939 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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)