./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_41-trylock_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version f8ab0bd5 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 ../sv-benchmarks/c/goblint-regression/28-race_reach_41-trylock_racefree.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 af00d5f4cc6a18cb9fd8a5151467217fe3ddb5ee0fa30b2cfbd9dd374105ee15 --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 22:20:18,095 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 22:20:18,159 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-13 22:20:18,164 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 22:20:18,165 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 22:20:18,188 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 22:20:18,188 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 22:20:18,189 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 22:20:18,189 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 22:20:18,189 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 22:20:18,189 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 22:20:18,189 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 22:20:18,189 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 22:20:18,189 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 22:20:18,189 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 22:20:18,189 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 22:20:18,189 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 22:20:18,190 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 22:20:18,190 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 22:20:18,190 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 22:20:18,190 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 22:20:18,190 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 22:20:18,190 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-13 22:20:18,190 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-13 22:20:18,190 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 22:20:18,190 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 22:20:18,190 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 22:20:18,190 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 22:20:18,190 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 22:20:18,190 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 22:20:18,190 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 22:20:18,190 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:20:18,190 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 22:20:18,190 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 22:20:18,191 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 22:20:18,191 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 22:20:18,191 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 22:20:18,191 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 22:20:18,191 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 22:20:18,191 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 22:20:18,191 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 22:20:18,191 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 22:20:18,191 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 -> af00d5f4cc6a18cb9fd8a5151467217fe3ddb5ee0fa30b2cfbd9dd374105ee15 [2025-03-13 22:20:18,427 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 22:20:18,435 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 22:20:18,437 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 22:20:18,438 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 22:20:18,438 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 22:20:18,440 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_41-trylock_racefree.i [2025-03-13 22:20:19,665 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ef5e9a6e/b58535c18bf644a6857ef1353b7b1108/FLAGeefe74337 [2025-03-13 22:20:19,928 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 22:20:19,928 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_41-trylock_racefree.i [2025-03-13 22:20:19,937 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ef5e9a6e/b58535c18bf644a6857ef1353b7b1108/FLAGeefe74337 [2025-03-13 22:20:19,948 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ef5e9a6e/b58535c18bf644a6857ef1353b7b1108 [2025-03-13 22:20:19,950 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 22:20:19,951 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 22:20:19,952 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 22:20:19,952 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 22:20:19,960 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 22:20:19,961 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:20:19" (1/1) ... [2025-03-13 22:20:19,961 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d5ec28d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:20:19, skipping insertion in model container [2025-03-13 22:20:19,962 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:20:19" (1/1) ... [2025-03-13 22:20:19,985 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 22:20:20,213 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:20:20,236 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 22:20:20,274 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:20:20,302 INFO L204 MainTranslator]: Completed translation [2025-03-13 22:20:20,302 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:20:20 WrapperNode [2025-03-13 22:20:20,303 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 22:20:20,303 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 22:20:20,303 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 22:20:20,303 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 22:20:20,307 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:20:20" (1/1) ... [2025-03-13 22:20:20,315 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:20:20" (1/1) ... [2025-03-13 22:20:20,330 INFO L138 Inliner]: procedures = 172, calls = 36, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 88 [2025-03-13 22:20:20,330 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 22:20:20,331 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 22:20:20,331 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 22:20:20,331 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 22:20:20,336 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:20:20" (1/1) ... [2025-03-13 22:20:20,336 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:20:20" (1/1) ... [2025-03-13 22:20:20,338 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:20:20" (1/1) ... [2025-03-13 22:20:20,338 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:20:20" (1/1) ... [2025-03-13 22:20:20,349 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:20:20" (1/1) ... [2025-03-13 22:20:20,352 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:20:20" (1/1) ... [2025-03-13 22:20:20,353 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:20:20" (1/1) ... [2025-03-13 22:20:20,353 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:20:20" (1/1) ... [2025-03-13 22:20:20,355 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 22:20:20,356 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 22:20:20,356 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 22:20:20,356 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 22:20:20,356 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:20:20" (1/1) ... [2025-03-13 22:20:20,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:20:20,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:20:20,382 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-03-13 22:20:20,390 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-03-13 22:20:20,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-13 22:20:20,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-13 22:20:20,404 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-13 22:20:20,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 22:20:20,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-13 22:20:20,404 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-13 22:20:20,404 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-13 22:20:20,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-13 22:20:20,404 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexTryLock [2025-03-13 22:20:20,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-13 22:20:20,405 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-13 22:20:20,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 22:20:20,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 22:20:20,406 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 22:20:20,501 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 22:20:20,503 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 22:20:20,686 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L706: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-03-13 22:20:20,687 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L706-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-03-13 22:20:20,732 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 22:20:20,733 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 22:20:20,733 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 22:20:20,775 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 22:20:20,775 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:20:20 BoogieIcfgContainer [2025-03-13 22:20:20,775 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 22:20:20,777 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 22:20:20,777 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 22:20:20,782 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 22:20:20,782 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 10:20:19" (1/3) ... [2025-03-13 22:20:20,783 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c53127f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:20:20, skipping insertion in model container [2025-03-13 22:20:20,783 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:20:20" (2/3) ... [2025-03-13 22:20:20,783 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c53127f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:20:20, skipping insertion in model container [2025-03-13 22:20:20,783 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:20:20" (3/3) ... [2025-03-13 22:20:20,785 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_41-trylock_racefree.i [2025-03-13 22:20:20,796 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 22:20:20,797 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_41-trylock_racefree.i that has 2 procedures, 128 locations, 1 initial locations, 6 loop locations, and 7 error locations. [2025-03-13 22:20:20,797 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 22:20:20,846 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-13 22:20:20,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 131 places, 141 transitions, 289 flow [2025-03-13 22:20:20,960 INFO L124 PetriNetUnfolderBase]: 19/202 cut-off events. [2025-03-13 22:20:20,963 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 22:20:20,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 207 conditions, 202 events. 19/202 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 657 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-03-13 22:20:20,970 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 141 transitions, 289 flow [2025-03-13 22:20:20,975 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 131 places, 141 transitions, 289 flow [2025-03-13 22:20:20,981 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:20:20,995 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@760d0225, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:20:20,995 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-03-13 22:20:21,008 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:20:21,008 INFO L124 PetriNetUnfolderBase]: 2/48 cut-off events. [2025-03-13 22:20:21,008 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:20:21,009 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:20:21,009 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:20:21,010 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-13 22:20:21,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:20:21,014 INFO L85 PathProgramCache]: Analyzing trace with hash 2126323298, now seen corresponding path program 1 times [2025-03-13 22:20:21,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:20:21,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403446857] [2025-03-13 22:20:21,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:20:21,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:20:21,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-13 22:20:21,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-13 22:20:21,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:20:21,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:20:21,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:20:21,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:20:21,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403446857] [2025-03-13 22:20:21,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403446857] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:20:21,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:20:21,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:20:21,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619938652] [2025-03-13 22:20:21,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:20:21,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-13 22:20:21,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:20:21,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-13 22:20:21,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-13 22:20:21,245 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 141 [2025-03-13 22:20:21,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 141 transitions, 289 flow. Second operand has 2 states, 2 states have (on average 118.0) internal successors, (236), 2 states have internal predecessors, (236), 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-03-13 22:20:21,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:20:21,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 141 [2025-03-13 22:20:21,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:20:21,338 INFO L124 PetriNetUnfolderBase]: 27/362 cut-off events. [2025-03-13 22:20:21,338 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-13 22:20:21,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 432 conditions, 362 events. 27/362 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1468 event pairs, 24 based on Foata normal form. 35/358 useless extension candidates. Maximal degree in co-relation 335. Up to 65 conditions per place. [2025-03-13 22:20:21,342 INFO L140 encePairwiseOnDemand]: 130/141 looper letters, 12 selfloop transitions, 0 changer transitions 0/128 dead transitions. [2025-03-13 22:20:21,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 128 transitions, 287 flow [2025-03-13 22:20:21,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-13 22:20:21,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-13 22:20:21,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 257 transitions. [2025-03-13 22:20:21,354 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9113475177304965 [2025-03-13 22:20:21,356 INFO L175 Difference]: Start difference. First operand has 131 places, 141 transitions, 289 flow. Second operand 2 states and 257 transitions. [2025-03-13 22:20:21,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 128 transitions, 287 flow [2025-03-13 22:20:21,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 128 transitions, 287 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:20:21,364 INFO L231 Difference]: Finished difference. Result has 130 places, 128 transitions, 263 flow [2025-03-13 22:20:21,367 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=263, PETRI_PLACES=130, PETRI_TRANSITIONS=128} [2025-03-13 22:20:21,371 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, -1 predicate places. [2025-03-13 22:20:21,371 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 128 transitions, 263 flow [2025-03-13 22:20:21,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 118.0) internal successors, (236), 2 states have internal predecessors, (236), 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-03-13 22:20:21,372 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:20:21,372 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] [2025-03-13 22:20:21,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 22:20:21,372 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-13 22:20:21,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:20:21,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1426707203, now seen corresponding path program 1 times [2025-03-13 22:20:21,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:20:21,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996192918] [2025-03-13 22:20:21,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:20:21,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:20:21,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-13 22:20:21,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-13 22:20:21,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:20:21,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:20:21,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:20:21,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:20:21,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996192918] [2025-03-13 22:20:21,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996192918] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:20:21,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:20:21,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 22:20:21,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746999703] [2025-03-13 22:20:21,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:20:21,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:20:21,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:20:21,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:20:21,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:20:21,526 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 141 [2025-03-13 22:20:21,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 128 transitions, 263 flow. Second operand has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:20:21,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:20:21,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 141 [2025-03-13 22:20:21,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:20:21,612 INFO L124 PetriNetUnfolderBase]: 55/513 cut-off events. [2025-03-13 22:20:21,613 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-13 22:20:21,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 635 conditions, 513 events. 55/513 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2426 event pairs, 28 based on Foata normal form. 1/456 useless extension candidates. Maximal degree in co-relation 631. Up to 108 conditions per place. [2025-03-13 22:20:21,616 INFO L140 encePairwiseOnDemand]: 138/141 looper letters, 22 selfloop transitions, 2 changer transitions 0/134 dead transitions. [2025-03-13 22:20:21,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 134 transitions, 323 flow [2025-03-13 22:20:21,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:20:21,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:20:21,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 358 transitions. [2025-03-13 22:20:21,619 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8463356973995272 [2025-03-13 22:20:21,619 INFO L175 Difference]: Start difference. First operand has 130 places, 128 transitions, 263 flow. Second operand 3 states and 358 transitions. [2025-03-13 22:20:21,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 134 transitions, 323 flow [2025-03-13 22:20:21,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 134 transitions, 323 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:20:21,624 INFO L231 Difference]: Finished difference. Result has 133 places, 128 transitions, 271 flow [2025-03-13 22:20:21,625 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=271, PETRI_PLACES=133, PETRI_TRANSITIONS=128} [2025-03-13 22:20:21,626 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 2 predicate places. [2025-03-13 22:20:21,626 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 128 transitions, 271 flow [2025-03-13 22:20:21,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:20:21,627 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:20:21,627 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-03-13 22:20:21,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 22:20:21,627 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-13 22:20:21,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:20:21,628 INFO L85 PathProgramCache]: Analyzing trace with hash 605231379, now seen corresponding path program 1 times [2025-03-13 22:20:21,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:20:21,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260669903] [2025-03-13 22:20:21,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:20:21,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:20:21,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-13 22:20:21,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-13 22:20:21,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:20:21,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:20:22,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:20:22,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:20:22,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260669903] [2025-03-13 22:20:22,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260669903] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:20:22,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:20:22,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:20:22,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092444548] [2025-03-13 22:20:22,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:20:22,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:20:22,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:20:22,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:20:22,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:20:22,224 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 141 [2025-03-13 22:20:22,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 128 transitions, 271 flow. Second operand has 6 states, 6 states have (on average 100.5) internal successors, (603), 6 states have internal predecessors, (603), 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-03-13 22:20:22,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:20:22,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 141 [2025-03-13 22:20:22,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:20:22,406 INFO L124 PetriNetUnfolderBase]: 115/650 cut-off events. [2025-03-13 22:20:22,406 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-03-13 22:20:22,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 934 conditions, 650 events. 115/650 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 3659 event pairs, 55 based on Foata normal form. 0/590 useless extension candidates. Maximal degree in co-relation 928. Up to 181 conditions per place. [2025-03-13 22:20:22,409 INFO L140 encePairwiseOnDemand]: 135/141 looper letters, 48 selfloop transitions, 5 changer transitions 0/151 dead transitions. [2025-03-13 22:20:22,410 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 151 transitions, 423 flow [2025-03-13 22:20:22,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:20:22,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:20:22,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 648 transitions. [2025-03-13 22:20:22,412 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7659574468085106 [2025-03-13 22:20:22,412 INFO L175 Difference]: Start difference. First operand has 133 places, 128 transitions, 271 flow. Second operand 6 states and 648 transitions. [2025-03-13 22:20:22,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 151 transitions, 423 flow [2025-03-13 22:20:22,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 151 transitions, 419 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:20:22,415 INFO L231 Difference]: Finished difference. Result has 135 places, 127 transitions, 275 flow [2025-03-13 22:20:22,415 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=275, PETRI_PLACES=135, PETRI_TRANSITIONS=127} [2025-03-13 22:20:22,415 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 4 predicate places. [2025-03-13 22:20:22,416 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 127 transitions, 275 flow [2025-03-13 22:20:22,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 100.5) internal successors, (603), 6 states have internal predecessors, (603), 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-03-13 22:20:22,416 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:20:22,416 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:20:22,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 22:20:22,416 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-13 22:20:22,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:20:22,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1710643572, now seen corresponding path program 1 times [2025-03-13 22:20:22,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:20:22,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296037073] [2025-03-13 22:20:22,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:20:22,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:20:22,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-13 22:20:22,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-13 22:20:22,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:20:22,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:20:22,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:20:22,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:20:22,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296037073] [2025-03-13 22:20:22,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296037073] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:20:22,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:20:22,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:20:22,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010360437] [2025-03-13 22:20:22,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:20:22,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:20:22,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:20:22,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:20:22,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:20:22,493 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 141 [2025-03-13 22:20:22,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 127 transitions, 275 flow. Second operand has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 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-03-13 22:20:22,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:20:22,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 141 [2025-03-13 22:20:22,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:20:22,617 INFO L124 PetriNetUnfolderBase]: 92/788 cut-off events. [2025-03-13 22:20:22,618 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-13 22:20:22,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1025 conditions, 788 events. 92/788 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4698 event pairs, 30 based on Foata normal form. 0/716 useless extension candidates. Maximal degree in co-relation 1019. Up to 125 conditions per place. [2025-03-13 22:20:22,622 INFO L140 encePairwiseOnDemand]: 132/141 looper letters, 30 selfloop transitions, 6 changer transitions 0/140 dead transitions. [2025-03-13 22:20:22,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 140 transitions, 376 flow [2025-03-13 22:20:22,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:20:22,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:20:22,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 357 transitions. [2025-03-13 22:20:22,625 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8439716312056738 [2025-03-13 22:20:22,625 INFO L175 Difference]: Start difference. First operand has 135 places, 127 transitions, 275 flow. Second operand 3 states and 357 transitions. [2025-03-13 22:20:22,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 140 transitions, 376 flow [2025-03-13 22:20:22,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 140 transitions, 366 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:20:22,630 INFO L231 Difference]: Finished difference. Result has 132 places, 129 transitions, 303 flow [2025-03-13 22:20:22,630 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=303, PETRI_PLACES=132, PETRI_TRANSITIONS=129} [2025-03-13 22:20:22,631 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 1 predicate places. [2025-03-13 22:20:22,633 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 129 transitions, 303 flow [2025-03-13 22:20:22,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 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-03-13 22:20:22,633 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:20:22,633 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:20:22,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 22:20:22,633 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-13 22:20:22,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:20:22,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1998558221, now seen corresponding path program 1 times [2025-03-13 22:20:22,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:20:22,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928470283] [2025-03-13 22:20:22,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:20:22,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:20:22,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-13 22:20:22,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-13 22:20:22,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:20:22,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:20:22,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:20:22,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:20:22,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928470283] [2025-03-13 22:20:22,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928470283] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:20:22,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:20:22,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:20:22,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262126799] [2025-03-13 22:20:22,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:20:22,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:20:22,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:20:22,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:20:22,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:20:22,728 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 141 [2025-03-13 22:20:22,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 129 transitions, 303 flow. Second operand has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:20:22,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:20:22,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 141 [2025-03-13 22:20:22,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:20:22,841 INFO L124 PetriNetUnfolderBase]: 95/787 cut-off events. [2025-03-13 22:20:22,841 INFO L125 PetriNetUnfolderBase]: For 113/113 co-relation queries the response was YES. [2025-03-13 22:20:22,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1122 conditions, 787 events. 95/787 cut-off events. For 113/113 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4711 event pairs, 60 based on Foata normal form. 0/715 useless extension candidates. Maximal degree in co-relation 1115. Up to 189 conditions per place. [2025-03-13 22:20:22,845 INFO L140 encePairwiseOnDemand]: 136/141 looper letters, 27 selfloop transitions, 4 changer transitions 0/136 dead transitions. [2025-03-13 22:20:22,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 136 transitions, 383 flow [2025-03-13 22:20:22,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:20:22,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:20:22,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 353 transitions. [2025-03-13 22:20:22,847 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.83451536643026 [2025-03-13 22:20:22,848 INFO L175 Difference]: Start difference. First operand has 132 places, 129 transitions, 303 flow. Second operand 3 states and 353 transitions. [2025-03-13 22:20:22,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 136 transitions, 383 flow [2025-03-13 22:20:22,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 136 transitions, 369 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:20:22,853 INFO L231 Difference]: Finished difference. Result has 134 places, 132 transitions, 323 flow [2025-03-13 22:20:22,854 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=291, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=323, PETRI_PLACES=134, PETRI_TRANSITIONS=132} [2025-03-13 22:20:22,855 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 3 predicate places. [2025-03-13 22:20:22,856 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 132 transitions, 323 flow [2025-03-13 22:20:22,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:20:22,856 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:20:22,857 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:20:22,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 22:20:22,857 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-13 22:20:22,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:20:22,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1581557947, now seen corresponding path program 1 times [2025-03-13 22:20:22,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:20:22,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057294470] [2025-03-13 22:20:22,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:20:22,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:20:22,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-13 22:20:22,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-13 22:20:22,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:20:22,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:20:22,886 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 22:20:22,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-13 22:20:22,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-13 22:20:22,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:20:22,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:20:22,922 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 22:20:22,924 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 22:20:22,925 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 12 remaining) [2025-03-13 22:20:22,927 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining) [2025-03-13 22:20:22,928 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining) [2025-03-13 22:20:22,928 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining) [2025-03-13 22:20:22,928 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 12 remaining) [2025-03-13 22:20:22,929 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 12 remaining) [2025-03-13 22:20:22,929 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 12 remaining) [2025-03-13 22:20:22,929 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining) [2025-03-13 22:20:22,929 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining) [2025-03-13 22:20:22,929 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining) [2025-03-13 22:20:22,929 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining) [2025-03-13 22:20:22,929 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining) [2025-03-13 22:20:22,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 22:20:22,930 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-13 22:20:22,932 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 22:20:22,932 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-13 22:20:22,958 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-13 22:20:22,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 174 places, 189 transitions, 394 flow [2025-03-13 22:20:22,997 INFO L124 PetriNetUnfolderBase]: 33/338 cut-off events. [2025-03-13 22:20:22,997 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-13 22:20:23,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 350 conditions, 338 events. 33/338 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1215 event pairs, 0 based on Foata normal form. 0/283 useless extension candidates. Maximal degree in co-relation 204. Up to 9 conditions per place. [2025-03-13 22:20:23,000 INFO L82 GeneralOperation]: Start removeDead. Operand has 174 places, 189 transitions, 394 flow [2025-03-13 22:20:23,003 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 174 places, 189 transitions, 394 flow [2025-03-13 22:20:23,004 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:20:23,004 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@760d0225, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:20:23,005 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-03-13 22:20:23,008 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:20:23,008 INFO L124 PetriNetUnfolderBase]: 2/48 cut-off events. [2025-03-13 22:20:23,008 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:20:23,008 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:20:23,008 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:20:23,008 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-13 22:20:23,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:20:23,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1322919838, now seen corresponding path program 1 times [2025-03-13 22:20:23,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:20:23,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070390873] [2025-03-13 22:20:23,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:20:23,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:20:23,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-13 22:20:23,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-13 22:20:23,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:20:23,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:20:23,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:20:23,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:20:23,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070390873] [2025-03-13 22:20:23,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070390873] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:20:23,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:20:23,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:20:23,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723096096] [2025-03-13 22:20:23,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:20:23,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-13 22:20:23,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:20:23,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-13 22:20:23,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-13 22:20:23,028 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 189 [2025-03-13 22:20:23,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 189 transitions, 394 flow. Second operand has 2 states, 2 states have (on average 152.0) internal successors, (304), 2 states have internal predecessors, (304), 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-03-13 22:20:23,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:20:23,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 189 [2025-03-13 22:20:23,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:20:23,346 INFO L124 PetriNetUnfolderBase]: 421/2556 cut-off events. [2025-03-13 22:20:23,346 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2025-03-13 22:20:23,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3315 conditions, 2556 events. 421/2556 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 20771 event pairs, 414 based on Foata normal form. 378/2663 useless extension candidates. Maximal degree in co-relation 2757. Up to 716 conditions per place. [2025-03-13 22:20:23,393 INFO L140 encePairwiseOnDemand]: 172/189 looper letters, 20 selfloop transitions, 0 changer transitions 0/170 dead transitions. [2025-03-13 22:20:23,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 170 transitions, 396 flow [2025-03-13 22:20:23,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-13 22:20:23,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-13 22:20:23,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 339 transitions. [2025-03-13 22:20:23,395 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8968253968253969 [2025-03-13 22:20:23,395 INFO L175 Difference]: Start difference. First operand has 174 places, 189 transitions, 394 flow. Second operand 2 states and 339 transitions. [2025-03-13 22:20:23,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 170 transitions, 396 flow [2025-03-13 22:20:23,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 170 transitions, 396 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:20:23,397 INFO L231 Difference]: Finished difference. Result has 173 places, 170 transitions, 356 flow [2025-03-13 22:20:23,397 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=356, PETRI_PLACES=173, PETRI_TRANSITIONS=170} [2025-03-13 22:20:23,398 INFO L279 CegarLoopForPetriNet]: 174 programPoint places, -1 predicate places. [2025-03-13 22:20:23,398 INFO L471 AbstractCegarLoop]: Abstraction has has 173 places, 170 transitions, 356 flow [2025-03-13 22:20:23,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 152.0) internal successors, (304), 2 states have internal predecessors, (304), 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-03-13 22:20:23,398 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:20:23,399 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] [2025-03-13 22:20:23,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 22:20:23,399 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-13 22:20:23,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:20:23,399 INFO L85 PathProgramCache]: Analyzing trace with hash -434602339, now seen corresponding path program 1 times [2025-03-13 22:20:23,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:20:23,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542578127] [2025-03-13 22:20:23,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:20:23,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:20:23,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-13 22:20:23,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-13 22:20:23,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:20:23,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:20:23,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:20:23,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:20:23,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542578127] [2025-03-13 22:20:23,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542578127] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:20:23,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:20:23,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 22:20:23,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951443920] [2025-03-13 22:20:23,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:20:23,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:20:23,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:20:23,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:20:23,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:20:23,446 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 189 [2025-03-13 22:20:23,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 170 transitions, 356 flow. Second operand has 3 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 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-03-13 22:20:23,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:20:23,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 189 [2025-03-13 22:20:23,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:20:23,809 INFO L124 PetriNetUnfolderBase]: 798/4210 cut-off events. [2025-03-13 22:20:23,809 INFO L125 PetriNetUnfolderBase]: For 73/73 co-relation queries the response was YES. [2025-03-13 22:20:23,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5564 conditions, 4210 events. 798/4210 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 39525 event pairs, 632 based on Foata normal form. 1/3809 useless extension candidates. Maximal degree in co-relation 5559. Up to 1303 conditions per place. [2025-03-13 22:20:23,828 INFO L140 encePairwiseOnDemand]: 186/189 looper letters, 31 selfloop transitions, 2 changer transitions 0/177 dead transitions. [2025-03-13 22:20:23,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 177 transitions, 436 flow [2025-03-13 22:20:23,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:20:23,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:20:23,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 469 transitions. [2025-03-13 22:20:23,830 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8271604938271605 [2025-03-13 22:20:23,830 INFO L175 Difference]: Start difference. First operand has 173 places, 170 transitions, 356 flow. Second operand 3 states and 469 transitions. [2025-03-13 22:20:23,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 177 transitions, 436 flow [2025-03-13 22:20:23,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 177 transitions, 436 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:20:23,833 INFO L231 Difference]: Finished difference. Result has 176 places, 171 transitions, 368 flow [2025-03-13 22:20:23,833 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=368, PETRI_PLACES=176, PETRI_TRANSITIONS=171} [2025-03-13 22:20:23,833 INFO L279 CegarLoopForPetriNet]: 174 programPoint places, 2 predicate places. [2025-03-13 22:20:23,833 INFO L471 AbstractCegarLoop]: Abstraction has has 176 places, 171 transitions, 368 flow [2025-03-13 22:20:23,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 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-03-13 22:20:23,834 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:20:23,834 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-03-13 22:20:23,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 22:20:23,834 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-13 22:20:23,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:20:23,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1295711280, now seen corresponding path program 1 times [2025-03-13 22:20:23,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:20:23,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695756365] [2025-03-13 22:20:23,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:20:23,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:20:23,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-13 22:20:23,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-13 22:20:23,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:20:23,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:20:24,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:20:24,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:20:24,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695756365] [2025-03-13 22:20:24,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695756365] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:20:24,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:20:24,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:20:24,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987625572] [2025-03-13 22:20:24,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:20:24,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:20:24,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:20:24,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:20:24,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:20:24,090 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 189 [2025-03-13 22:20:24,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 171 transitions, 368 flow. Second operand has 6 states, 6 states have (on average 134.5) internal successors, (807), 6 states have internal predecessors, (807), 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-03-13 22:20:24,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:20:24,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 189 [2025-03-13 22:20:24,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:20:24,623 INFO L124 PetriNetUnfolderBase]: 1762/6011 cut-off events. [2025-03-13 22:20:24,624 INFO L125 PetriNetUnfolderBase]: For 130/134 co-relation queries the response was YES. [2025-03-13 22:20:24,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8989 conditions, 6011 events. 1762/6011 cut-off events. For 130/134 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 56605 event pairs, 665 based on Foata normal form. 0/5514 useless extension candidates. Maximal degree in co-relation 8982. Up to 2015 conditions per place. [2025-03-13 22:20:24,659 INFO L140 encePairwiseOnDemand]: 183/189 looper letters, 80 selfloop transitions, 6 changer transitions 0/218 dead transitions. [2025-03-13 22:20:24,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 218 transitions, 634 flow [2025-03-13 22:20:24,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:20:24,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:20:24,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 884 transitions. [2025-03-13 22:20:24,663 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7795414462081128 [2025-03-13 22:20:24,663 INFO L175 Difference]: Start difference. First operand has 176 places, 171 transitions, 368 flow. Second operand 6 states and 884 transitions. [2025-03-13 22:20:24,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 218 transitions, 634 flow [2025-03-13 22:20:24,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 218 transitions, 632 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:20:24,667 INFO L231 Difference]: Finished difference. Result has 179 places, 170 transitions, 376 flow [2025-03-13 22:20:24,668 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=376, PETRI_PLACES=179, PETRI_TRANSITIONS=170} [2025-03-13 22:20:24,669 INFO L279 CegarLoopForPetriNet]: 174 programPoint places, 5 predicate places. [2025-03-13 22:20:24,670 INFO L471 AbstractCegarLoop]: Abstraction has has 179 places, 170 transitions, 376 flow [2025-03-13 22:20:24,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 134.5) internal successors, (807), 6 states have internal predecessors, (807), 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-03-13 22:20:24,671 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:20:24,671 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:20:24,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 22:20:24,671 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-13 22:20:24,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:20:24,672 INFO L85 PathProgramCache]: Analyzing trace with hash -581887173, now seen corresponding path program 1 times [2025-03-13 22:20:24,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:20:24,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446652454] [2025-03-13 22:20:24,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:20:24,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:20:24,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-13 22:20:24,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-13 22:20:24,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:20:24,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:20:24,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:20:24,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:20:24,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446652454] [2025-03-13 22:20:24,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446652454] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:20:24,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:20:24,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:20:24,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048474032] [2025-03-13 22:20:24,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:20:24,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:20:24,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:20:24,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:20:24,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:20:24,737 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 189 [2025-03-13 22:20:24,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 170 transitions, 376 flow. Second operand has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 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-03-13 22:20:24,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:20:24,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 189 [2025-03-13 22:20:24,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:20:25,860 INFO L124 PetriNetUnfolderBase]: 3895/14544 cut-off events. [2025-03-13 22:20:25,860 INFO L125 PetriNetUnfolderBase]: For 238/238 co-relation queries the response was YES. [2025-03-13 22:20:25,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21096 conditions, 14544 events. 3895/14544 cut-off events. For 238/238 co-relation queries the response was YES. Maximal size of possible extension queue 384. Compared 163791 event pairs, 1530 based on Foata normal form. 0/12989 useless extension candidates. Maximal degree in co-relation 21089. Up to 3516 conditions per place. [2025-03-13 22:20:25,922 INFO L140 encePairwiseOnDemand]: 170/189 looper letters, 58 selfloop transitions, 14 changer transitions 0/203 dead transitions. [2025-03-13 22:20:25,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 203 transitions, 597 flow [2025-03-13 22:20:25,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:20:25,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:20:25,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 473 transitions. [2025-03-13 22:20:25,924 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8342151675485009 [2025-03-13 22:20:25,924 INFO L175 Difference]: Start difference. First operand has 179 places, 170 transitions, 376 flow. Second operand 3 states and 473 transitions. [2025-03-13 22:20:25,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 203 transitions, 597 flow [2025-03-13 22:20:25,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 203 transitions, 585 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:20:25,927 INFO L231 Difference]: Finished difference. Result has 178 places, 184 transitions, 486 flow [2025-03-13 22:20:25,927 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=486, PETRI_PLACES=178, PETRI_TRANSITIONS=184} [2025-03-13 22:20:25,927 INFO L279 CegarLoopForPetriNet]: 174 programPoint places, 4 predicate places. [2025-03-13 22:20:25,928 INFO L471 AbstractCegarLoop]: Abstraction has has 178 places, 184 transitions, 486 flow [2025-03-13 22:20:25,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 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-03-13 22:20:25,928 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:20:25,928 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:20:25,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-13 22:20:25,928 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-13 22:20:25,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:20:25,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1635888673, now seen corresponding path program 1 times [2025-03-13 22:20:25,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:20:25,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198568946] [2025-03-13 22:20:25,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:20:25,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:20:25,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-13 22:20:25,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-13 22:20:25,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:20:25,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:20:25,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:20:25,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:20:25,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198568946] [2025-03-13 22:20:25,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198568946] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:20:25,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:20:25,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:20:25,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069039781] [2025-03-13 22:20:25,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:20:25,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:20:25,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:20:25,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:20:25,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:20:25,987 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 189 [2025-03-13 22:20:25,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 184 transitions, 486 flow. Second operand has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 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-03-13 22:20:25,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:20:25,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 189 [2025-03-13 22:20:25,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:20:27,194 INFO L124 PetriNetUnfolderBase]: 4034/16357 cut-off events. [2025-03-13 22:20:27,194 INFO L125 PetriNetUnfolderBase]: For 4247/4404 co-relation queries the response was YES. [2025-03-13 22:20:27,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27089 conditions, 16357 events. 4034/16357 cut-off events. For 4247/4404 co-relation queries the response was YES. Maximal size of possible extension queue 438. Compared 193036 event pairs, 2496 based on Foata normal form. 41/14874 useless extension candidates. Maximal degree in co-relation 27081. Up to 5522 conditions per place. [2025-03-13 22:20:27,289 INFO L140 encePairwiseOnDemand]: 180/189 looper letters, 52 selfloop transitions, 14 changer transitions 0/208 dead transitions. [2025-03-13 22:20:27,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 208 transitions, 704 flow [2025-03-13 22:20:27,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:20:27,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:20:27,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 467 transitions. [2025-03-13 22:20:27,294 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8236331569664903 [2025-03-13 22:20:27,294 INFO L175 Difference]: Start difference. First operand has 178 places, 184 transitions, 486 flow. Second operand 3 states and 467 transitions. [2025-03-13 22:20:27,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 208 transitions, 704 flow [2025-03-13 22:20:27,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 208 transitions, 666 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:20:27,307 INFO L231 Difference]: Finished difference. Result has 180 places, 196 transitions, 584 flow [2025-03-13 22:20:27,308 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=458, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=584, PETRI_PLACES=180, PETRI_TRANSITIONS=196} [2025-03-13 22:20:27,308 INFO L279 CegarLoopForPetriNet]: 174 programPoint places, 6 predicate places. [2025-03-13 22:20:27,309 INFO L471 AbstractCegarLoop]: Abstraction has has 180 places, 196 transitions, 584 flow [2025-03-13 22:20:27,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 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-03-13 22:20:27,309 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:20:27,309 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:20:27,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-13 22:20:27,309 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-13 22:20:27,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:20:27,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1255437555, now seen corresponding path program 1 times [2025-03-13 22:20:27,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:20:27,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156362186] [2025-03-13 22:20:27,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:20:27,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:20:27,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-13 22:20:27,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-13 22:20:27,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:20:27,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:20:27,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 22:20:27,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:20:27,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156362186] [2025-03-13 22:20:27,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156362186] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:20:27,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:20:27,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:20:27,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175397609] [2025-03-13 22:20:27,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:20:27,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 22:20:27,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:20:27,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 22:20:27,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 22:20:27,429 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 189 [2025-03-13 22:20:27,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 196 transitions, 584 flow. Second operand has 5 states, 5 states have (on average 145.4) internal successors, (727), 5 states have internal predecessors, (727), 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-03-13 22:20:27,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:20:27,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 189 [2025-03-13 22:20:27,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:20:28,895 INFO L124 PetriNetUnfolderBase]: 3242/18322 cut-off events. [2025-03-13 22:20:28,895 INFO L125 PetriNetUnfolderBase]: For 1525/2273 co-relation queries the response was YES. [2025-03-13 22:20:28,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26059 conditions, 18322 events. 3242/18322 cut-off events. For 1525/2273 co-relation queries the response was YES. Maximal size of possible extension queue 511. Compared 238948 event pairs, 1203 based on Foata normal form. 19/16249 useless extension candidates. Maximal degree in co-relation 26050. Up to 3834 conditions per place. [2025-03-13 22:20:28,987 INFO L140 encePairwiseOnDemand]: 184/189 looper letters, 56 selfloop transitions, 5 changer transitions 0/228 dead transitions. [2025-03-13 22:20:28,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 228 transitions, 770 flow [2025-03-13 22:20:28,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:20:28,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:20:28,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 920 transitions. [2025-03-13 22:20:28,990 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8112874779541446 [2025-03-13 22:20:28,990 INFO L175 Difference]: Start difference. First operand has 180 places, 196 transitions, 584 flow. Second operand 6 states and 920 transitions. [2025-03-13 22:20:28,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 228 transitions, 770 flow [2025-03-13 22:20:28,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 228 transitions, 742 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:20:28,997 INFO L231 Difference]: Finished difference. Result has 186 places, 198 transitions, 582 flow [2025-03-13 22:20:28,998 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=556, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=582, PETRI_PLACES=186, PETRI_TRANSITIONS=198} [2025-03-13 22:20:28,998 INFO L279 CegarLoopForPetriNet]: 174 programPoint places, 12 predicate places. [2025-03-13 22:20:28,998 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 198 transitions, 582 flow [2025-03-13 22:20:28,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 145.4) internal successors, (727), 5 states have internal predecessors, (727), 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-03-13 22:20:28,999 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:20:28,999 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:20:28,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-13 22:20:28,999 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-13 22:20:29,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:20:29,000 INFO L85 PathProgramCache]: Analyzing trace with hash 932686550, now seen corresponding path program 1 times [2025-03-13 22:20:29,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:20:29,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759263200] [2025-03-13 22:20:29,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:20:29,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:20:29,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-13 22:20:29,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-13 22:20:29,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:20:29,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:20:29,036 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 22:20:29,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:20:29,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759263200] [2025-03-13 22:20:29,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759263200] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:20:29,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:20:29,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:20:29,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276529757] [2025-03-13 22:20:29,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:20:29,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:20:29,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:20:29,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:20:29,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:20:29,071 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 189 [2025-03-13 22:20:29,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 198 transitions, 582 flow. Second operand has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 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-03-13 22:20:29,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:20:29,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 189 [2025-03-13 22:20:29,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:20:30,608 INFO L124 PetriNetUnfolderBase]: 4665/19976 cut-off events. [2025-03-13 22:20:30,609 INFO L125 PetriNetUnfolderBase]: For 5176/5381 co-relation queries the response was YES. [2025-03-13 22:20:30,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32530 conditions, 19976 events. 4665/19976 cut-off events. For 5176/5381 co-relation queries the response was YES. Maximal size of possible extension queue 569. Compared 249112 event pairs, 2727 based on Foata normal form. 35/17931 useless extension candidates. Maximal degree in co-relation 32518. Up to 6278 conditions per place. [2025-03-13 22:20:30,700 INFO L140 encePairwiseOnDemand]: 180/189 looper letters, 59 selfloop transitions, 17 changer transitions 0/222 dead transitions. [2025-03-13 22:20:30,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 222 transitions, 817 flow [2025-03-13 22:20:30,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:20:30,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:20:30,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 466 transitions. [2025-03-13 22:20:30,702 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8218694885361552 [2025-03-13 22:20:30,702 INFO L175 Difference]: Start difference. First operand has 186 places, 198 transitions, 582 flow. Second operand 3 states and 466 transitions. [2025-03-13 22:20:30,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 222 transitions, 817 flow [2025-03-13 22:20:30,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 222 transitions, 811 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-13 22:20:30,707 INFO L231 Difference]: Finished difference. Result has 188 places, 211 transitions, 730 flow [2025-03-13 22:20:30,708 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=576, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=730, PETRI_PLACES=188, PETRI_TRANSITIONS=211} [2025-03-13 22:20:30,708 INFO L279 CegarLoopForPetriNet]: 174 programPoint places, 14 predicate places. [2025-03-13 22:20:30,708 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 211 transitions, 730 flow [2025-03-13 22:20:30,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 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-03-13 22:20:30,708 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:20:30,709 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:20:30,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-13 22:20:30,709 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-13 22:20:30,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:20:30,709 INFO L85 PathProgramCache]: Analyzing trace with hash -888081203, now seen corresponding path program 1 times [2025-03-13 22:20:30,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:20:30,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179191695] [2025-03-13 22:20:30,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:20:30,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:20:30,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-13 22:20:30,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-13 22:20:30,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:20:30,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:20:30,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 22:20:30,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:20:30,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179191695] [2025-03-13 22:20:30,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179191695] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:20:30,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:20:30,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:20:30,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715009977] [2025-03-13 22:20:30,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:20:30,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:20:30,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:20:30,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:20:30,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:20:30,770 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 189 [2025-03-13 22:20:30,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 211 transitions, 730 flow. Second operand has 3 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 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-03-13 22:20:30,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:20:30,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 189 [2025-03-13 22:20:30,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:20:32,617 INFO L124 PetriNetUnfolderBase]: 5242/22673 cut-off events. [2025-03-13 22:20:32,617 INFO L125 PetriNetUnfolderBase]: For 12631/13061 co-relation queries the response was YES. [2025-03-13 22:20:32,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39915 conditions, 22673 events. 5242/22673 cut-off events. For 12631/13061 co-relation queries the response was YES. Maximal size of possible extension queue 630. Compared 289172 event pairs, 2898 based on Foata normal form. 49/20392 useless extension candidates. Maximal degree in co-relation 39902. Up to 7064 conditions per place. [2025-03-13 22:20:32,727 INFO L140 encePairwiseOnDemand]: 180/189 looper letters, 71 selfloop transitions, 17 changer transitions 0/236 dead transitions. [2025-03-13 22:20:32,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 236 transitions, 1024 flow [2025-03-13 22:20:32,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:20:32,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:20:32,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 467 transitions. [2025-03-13 22:20:32,728 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8236331569664903 [2025-03-13 22:20:32,728 INFO L175 Difference]: Start difference. First operand has 188 places, 211 transitions, 730 flow. Second operand 3 states and 467 transitions. [2025-03-13 22:20:32,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 236 transitions, 1024 flow [2025-03-13 22:20:32,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 236 transitions, 984 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:20:32,742 INFO L231 Difference]: Finished difference. Result has 190 places, 224 transitions, 872 flow [2025-03-13 22:20:32,742 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=696, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=872, PETRI_PLACES=190, PETRI_TRANSITIONS=224} [2025-03-13 22:20:32,743 INFO L279 CegarLoopForPetriNet]: 174 programPoint places, 16 predicate places. [2025-03-13 22:20:32,743 INFO L471 AbstractCegarLoop]: Abstraction has has 190 places, 224 transitions, 872 flow [2025-03-13 22:20:32,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 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-03-13 22:20:32,743 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:20:32,744 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-13 22:20:32,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-13 22:20:32,744 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-13 22:20:32,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:20:32,744 INFO L85 PathProgramCache]: Analyzing trace with hash -456814922, now seen corresponding path program 1 times [2025-03-13 22:20:32,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:20:32,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821686055] [2025-03-13 22:20:32,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:20:32,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:20:32,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-13 22:20:32,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-13 22:20:32,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:20:32,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:20:32,760 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 22:20:32,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-13 22:20:32,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-13 22:20:32,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:20:32,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:20:32,780 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 22:20:32,780 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 22:20:32,780 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2025-03-13 22:20:32,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (14 of 16 remaining) [2025-03-13 22:20:32,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining) [2025-03-13 22:20:32,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining) [2025-03-13 22:20:32,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining) [2025-03-13 22:20:32,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining) [2025-03-13 22:20:32,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (9 of 16 remaining) [2025-03-13 22:20:32,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (8 of 16 remaining) [2025-03-13 22:20:32,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 16 remaining) [2025-03-13 22:20:32,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 16 remaining) [2025-03-13 22:20:32,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining) [2025-03-13 22:20:32,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining) [2025-03-13 22:20:32,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining) [2025-03-13 22:20:32,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining) [2025-03-13 22:20:32,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining) [2025-03-13 22:20:32,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining) [2025-03-13 22:20:32,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-13 22:20:32,782 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:20:32,782 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 22:20:32,782 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-13 22:20:32,801 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-13 22:20:32,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 217 places, 237 transitions, 501 flow [2025-03-13 22:20:32,827 INFO L124 PetriNetUnfolderBase]: 50/517 cut-off events. [2025-03-13 22:20:32,827 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-03-13 22:20:32,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 542 conditions, 517 events. 50/517 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2023 event pairs, 1 based on Foata normal form. 0/435 useless extension candidates. Maximal degree in co-relation 346. Up to 12 conditions per place. [2025-03-13 22:20:32,830 INFO L82 GeneralOperation]: Start removeDead. Operand has 217 places, 237 transitions, 501 flow [2025-03-13 22:20:32,832 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 217 places, 237 transitions, 501 flow [2025-03-13 22:20:32,833 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:20:32,833 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@760d0225, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:20:32,833 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2025-03-13 22:20:32,834 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:20:32,834 INFO L124 PetriNetUnfolderBase]: 2/48 cut-off events. [2025-03-13 22:20:32,834 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:20:32,835 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:20:32,835 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:20:32,835 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-13 22:20:32,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:20:32,835 INFO L85 PathProgramCache]: Analyzing trace with hash -535104926, now seen corresponding path program 1 times [2025-03-13 22:20:32,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:20:32,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56445203] [2025-03-13 22:20:32,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:20:32,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:20:32,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-13 22:20:32,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-13 22:20:32,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:20:32,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:20:32,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:20:32,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:20:32,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56445203] [2025-03-13 22:20:32,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56445203] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:20:32,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:20:32,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:20:32,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150280149] [2025-03-13 22:20:32,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:20:32,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-13 22:20:32,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:20:32,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-13 22:20:32,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-13 22:20:32,848 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 237 [2025-03-13 22:20:32,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 237 transitions, 501 flow. Second operand has 2 states, 2 states have (on average 186.0) internal successors, (372), 2 states have internal predecessors, (372), 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-03-13 22:20:32,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:20:32,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 237 [2025-03-13 22:20:32,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:20:34,616 INFO L124 PetriNetUnfolderBase]: 4833/19908 cut-off events. [2025-03-13 22:20:34,616 INFO L125 PetriNetUnfolderBase]: For 940/940 co-relation queries the response was YES. [2025-03-13 22:20:34,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27333 conditions, 19908 events. 4833/19908 cut-off events. For 940/940 co-relation queries the response was YES. Maximal size of possible extension queue 454. Compared 238272 event pairs, 4795 based on Foata normal form. 3657/21605 useless extension candidates. Maximal degree in co-relation 22976. Up to 6995 conditions per place. [2025-03-13 22:20:34,726 INFO L140 encePairwiseOnDemand]: 214/237 looper letters, 28 selfloop transitions, 0 changer transitions 0/212 dead transitions. [2025-03-13 22:20:34,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 212 transitions, 507 flow [2025-03-13 22:20:34,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-13 22:20:34,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-13 22:20:34,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 421 transitions. [2025-03-13 22:20:34,727 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8881856540084389 [2025-03-13 22:20:34,727 INFO L175 Difference]: Start difference. First operand has 217 places, 237 transitions, 501 flow. Second operand 2 states and 421 transitions. [2025-03-13 22:20:34,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 212 transitions, 507 flow [2025-03-13 22:20:34,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 212 transitions, 507 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:20:34,730 INFO L231 Difference]: Finished difference. Result has 216 places, 212 transitions, 451 flow [2025-03-13 22:20:34,731 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=451, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=451, PETRI_PLACES=216, PETRI_TRANSITIONS=212} [2025-03-13 22:20:34,731 INFO L279 CegarLoopForPetriNet]: 217 programPoint places, -1 predicate places. [2025-03-13 22:20:34,731 INFO L471 AbstractCegarLoop]: Abstraction has has 216 places, 212 transitions, 451 flow [2025-03-13 22:20:34,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 186.0) internal successors, (372), 2 states have internal predecessors, (372), 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-03-13 22:20:34,731 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:20:34,731 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] [2025-03-13 22:20:34,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-13 22:20:34,732 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-13 22:20:34,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:20:34,732 INFO L85 PathProgramCache]: Analyzing trace with hash 741291581, now seen corresponding path program 1 times [2025-03-13 22:20:34,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:20:34,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628029449] [2025-03-13 22:20:34,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:20:34,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:20:34,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-13 22:20:34,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-13 22:20:34,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:20:34,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:20:34,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:20:34,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:20:34,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628029449] [2025-03-13 22:20:34,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628029449] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:20:34,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:20:34,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 22:20:34,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565242104] [2025-03-13 22:20:34,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:20:34,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:20:34,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:20:34,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:20:34,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:20:34,766 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 237 [2025-03-13 22:20:34,767 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 212 transitions, 451 flow. Second operand has 3 states, 3 states have (on average 181.0) internal successors, (543), 3 states have internal predecessors, (543), 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-03-13 22:20:34,767 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:20:34,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 237 [2025-03-13 22:20:34,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:20:37,856 INFO L124 PetriNetUnfolderBase]: 8969/34708 cut-off events. [2025-03-13 22:20:37,856 INFO L125 PetriNetUnfolderBase]: For 952/952 co-relation queries the response was YES. [2025-03-13 22:20:37,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47947 conditions, 34708 events. 8969/34708 cut-off events. For 952/952 co-relation queries the response was YES. Maximal size of possible extension queue 780. Compared 448672 event pairs, 5659 based on Foata normal form. 1/31456 useless extension candidates. Maximal degree in co-relation 47941. Up to 12802 conditions per place. [2025-03-13 22:20:38,066 INFO L140 encePairwiseOnDemand]: 234/237 looper letters, 39 selfloop transitions, 2 changer transitions 0/219 dead transitions. [2025-03-13 22:20:38,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 219 transitions, 547 flow [2025-03-13 22:20:38,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:20:38,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:20:38,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 579 transitions. [2025-03-13 22:20:38,067 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8143459915611815 [2025-03-13 22:20:38,067 INFO L175 Difference]: Start difference. First operand has 216 places, 212 transitions, 451 flow. Second operand 3 states and 579 transitions. [2025-03-13 22:20:38,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 219 transitions, 547 flow [2025-03-13 22:20:38,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 219 transitions, 547 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:20:38,070 INFO L231 Difference]: Finished difference. Result has 219 places, 213 transitions, 463 flow [2025-03-13 22:20:38,070 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=451, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=463, PETRI_PLACES=219, PETRI_TRANSITIONS=213} [2025-03-13 22:20:38,070 INFO L279 CegarLoopForPetriNet]: 217 programPoint places, 2 predicate places. [2025-03-13 22:20:38,070 INFO L471 AbstractCegarLoop]: Abstraction has has 219 places, 213 transitions, 463 flow [2025-03-13 22:20:38,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 181.0) internal successors, (543), 3 states have internal predecessors, (543), 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-03-13 22:20:38,071 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:20:38,071 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-03-13 22:20:38,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-13 22:20:38,071 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-13 22:20:38,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:20:38,071 INFO L85 PathProgramCache]: Analyzing trace with hash -906282627, now seen corresponding path program 1 times [2025-03-13 22:20:38,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:20:38,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111634095] [2025-03-13 22:20:38,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:20:38,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:20:38,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-13 22:20:38,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-13 22:20:38,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:20:38,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:20:38,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:20:38,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:20:38,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111634095] [2025-03-13 22:20:38,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111634095] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:20:38,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:20:38,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:20:38,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051288930] [2025-03-13 22:20:38,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:20:38,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:20:38,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:20:38,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:20:38,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:20:38,454 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 237 [2025-03-13 22:20:38,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 213 transitions, 463 flow. Second operand has 6 states, 6 states have (on average 168.5) internal successors, (1011), 6 states have internal predecessors, (1011), 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-03-13 22:20:38,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:20:38,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 237 [2025-03-13 22:20:38,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:20:43,065 INFO L124 PetriNetUnfolderBase]: 19954/50102 cut-off events. [2025-03-13 22:20:43,066 INFO L125 PetriNetUnfolderBase]: For 1403/1403 co-relation queries the response was YES. [2025-03-13 22:20:43,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79263 conditions, 50102 events. 19954/50102 cut-off events. For 1403/1403 co-relation queries the response was YES. Maximal size of possible extension queue 1338. Compared 596019 event pairs, 2581 based on Foata normal form. 0/46560 useless extension candidates. Maximal degree in co-relation 79255. Up to 20048 conditions per place. [2025-03-13 22:20:43,373 INFO L140 encePairwiseOnDemand]: 231/237 looper letters, 112 selfloop transitions, 6 changer transitions 0/284 dead transitions. [2025-03-13 22:20:43,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 284 transitions, 841 flow [2025-03-13 22:20:43,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:20:43,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:20:43,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1120 transitions. [2025-03-13 22:20:43,376 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7876230661040787 [2025-03-13 22:20:43,376 INFO L175 Difference]: Start difference. First operand has 219 places, 213 transitions, 463 flow. Second operand 6 states and 1120 transitions. [2025-03-13 22:20:43,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 284 transitions, 841 flow [2025-03-13 22:20:43,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 284 transitions, 839 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:20:43,380 INFO L231 Difference]: Finished difference. Result has 222 places, 212 transitions, 471 flow [2025-03-13 22:20:43,380 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=459, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=471, PETRI_PLACES=222, PETRI_TRANSITIONS=212} [2025-03-13 22:20:43,380 INFO L279 CegarLoopForPetriNet]: 217 programPoint places, 5 predicate places. [2025-03-13 22:20:43,380 INFO L471 AbstractCegarLoop]: Abstraction has has 222 places, 212 transitions, 471 flow [2025-03-13 22:20:43,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 168.5) internal successors, (1011), 6 states have internal predecessors, (1011), 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-03-13 22:20:43,381 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:20:43,381 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:20:43,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-13 22:20:43,381 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-13 22:20:43,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:20:43,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1760976906, now seen corresponding path program 1 times [2025-03-13 22:20:43,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:20:43,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108255294] [2025-03-13 22:20:43,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:20:43,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:20:43,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-13 22:20:43,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-13 22:20:43,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:20:43,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:20:43,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:20:43,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:20:43,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108255294] [2025-03-13 22:20:43,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108255294] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:20:43,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:20:43,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:20:43,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419135537] [2025-03-13 22:20:43,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:20:43,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:20:43,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:20:43,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:20:43,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:20:43,448 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 237 [2025-03-13 22:20:43,449 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 212 transitions, 471 flow. Second operand has 3 states, 3 states have (on average 159.66666666666666) internal successors, (479), 3 states have internal predecessors, (479), 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-03-13 22:20:43,449 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:20:43,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 237 [2025-03-13 22:20:43,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand