./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_24-sound_lock_racing.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_24-sound_lock_racing.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 1eea0d699fc30cae440905f5eeea19b8e9e5d0b5cc249e9ffded8d356549b279 --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 22:20:11,520 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 22:20:11,575 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:11,582 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 22:20:11,582 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 22:20:11,602 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 22:20:11,604 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 22:20:11,604 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 22:20:11,605 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 22:20:11,605 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 22:20:11,605 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 22:20:11,605 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 22:20:11,605 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 22:20:11,606 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 22:20:11,606 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 22:20:11,606 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 22:20:11,607 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 22:20:11,607 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 22:20:11,607 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 22:20:11,607 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 22:20:11,607 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 22:20:11,607 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 22:20:11,607 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-13 22:20:11,607 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-13 22:20:11,607 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 22:20:11,607 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 22:20:11,607 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 22:20:11,607 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 22:20:11,608 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 22:20:11,608 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 22:20:11,608 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 22:20:11,608 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:20:11,608 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 22:20:11,608 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 22:20:11,608 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 22:20:11,608 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 22:20:11,609 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 22:20:11,609 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 22:20:11,609 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 22:20:11,609 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 22:20:11,609 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 22:20:11,609 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 22:20:11,609 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 -> 1eea0d699fc30cae440905f5eeea19b8e9e5d0b5cc249e9ffded8d356549b279 [2025-03-13 22:20:11,816 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 22:20:11,823 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 22:20:11,825 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 22:20:11,826 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 22:20:11,826 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 22:20:11,828 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_24-sound_lock_racing.i [2025-03-13 22:20:13,014 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2df268be/5b8a387a3caf4b9ebd21c905c5f754ac/FLAG581464a6b [2025-03-13 22:20:13,313 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 22:20:13,314 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_24-sound_lock_racing.i [2025-03-13 22:20:13,323 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2df268be/5b8a387a3caf4b9ebd21c905c5f754ac/FLAG581464a6b [2025-03-13 22:20:13,334 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2df268be/5b8a387a3caf4b9ebd21c905c5f754ac [2025-03-13 22:20:13,336 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 22:20:13,337 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 22:20:13,338 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 22:20:13,338 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 22:20:13,342 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 22:20:13,342 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:20:13" (1/1) ... [2025-03-13 22:20:13,343 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79c199b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:20:13, skipping insertion in model container [2025-03-13 22:20:13,343 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:20:13" (1/1) ... [2025-03-13 22:20:13,378 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 22:20:13,576 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:20:13,590 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 22:20:13,628 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:20:13,654 INFO L204 MainTranslator]: Completed translation [2025-03-13 22:20:13,655 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:20:13 WrapperNode [2025-03-13 22:20:13,655 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 22:20:13,656 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 22:20:13,656 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 22:20:13,656 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 22:20:13,660 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:13" (1/1) ... [2025-03-13 22:20:13,669 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:13" (1/1) ... [2025-03-13 22:20:13,683 INFO L138 Inliner]: procedures = 171, calls = 42, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 98 [2025-03-13 22:20:13,684 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 22:20:13,684 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 22:20:13,685 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 22:20:13,685 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 22:20:13,691 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:13" (1/1) ... [2025-03-13 22:20:13,691 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:13" (1/1) ... [2025-03-13 22:20:13,694 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:13" (1/1) ... [2025-03-13 22:20:13,694 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:13" (1/1) ... [2025-03-13 22:20:13,707 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:13" (1/1) ... [2025-03-13 22:20:13,708 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:13" (1/1) ... [2025-03-13 22:20:13,712 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:13" (1/1) ... [2025-03-13 22:20:13,713 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:13" (1/1) ... [2025-03-13 22:20:13,714 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 22:20:13,718 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 22:20:13,718 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 22:20:13,718 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 22:20:13,719 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:20:13" (1/1) ... [2025-03-13 22:20:13,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:20:13,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:20:13,744 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:13,751 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:13,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-13 22:20:13,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-13 22:20:13,766 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-13 22:20:13,766 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 22:20:13,766 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-13 22:20:13,766 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-13 22:20:13,766 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-13 22:20:13,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-13 22:20:13,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-13 22:20:13,766 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-13 22:20:13,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 22:20:13,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 22:20:13,767 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:13,860 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 22:20:13,862 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 22:20:14,045 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L710: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-03-13 22:20:14,046 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L710-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:14,099 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 22:20:14,100 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 22:20:14,100 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 22:20:14,135 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 22:20:14,135 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:20:14 BoogieIcfgContainer [2025-03-13 22:20:14,135 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 22:20:14,137 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 22:20:14,137 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 22:20:14,141 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 22:20:14,142 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 10:20:13" (1/3) ... [2025-03-13 22:20:14,142 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41bae646 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:20:14, skipping insertion in model container [2025-03-13 22:20:14,142 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:20:13" (2/3) ... [2025-03-13 22:20:14,143 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41bae646 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:20:14, skipping insertion in model container [2025-03-13 22:20:14,143 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:20:14" (3/3) ... [2025-03-13 22:20:14,144 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_24-sound_lock_racing.i [2025-03-13 22:20:14,155 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 22:20:14,156 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_24-sound_lock_racing.i that has 2 procedures, 140 locations, 1 initial locations, 5 loop locations, and 7 error locations. [2025-03-13 22:20:14,157 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 22:20:14,222 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-13 22:20:14,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 152 transitions, 311 flow [2025-03-13 22:20:14,333 INFO L124 PetriNetUnfolderBase]: 16/209 cut-off events. [2025-03-13 22:20:14,336 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 22:20:14,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 214 conditions, 209 events. 16/209 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 612 event pairs, 0 based on Foata normal form. 0/180 useless extension candidates. Maximal degree in co-relation 106. Up to 4 conditions per place. [2025-03-13 22:20:14,344 INFO L82 GeneralOperation]: Start removeDead. Operand has 143 places, 152 transitions, 311 flow [2025-03-13 22:20:14,348 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 143 places, 152 transitions, 311 flow [2025-03-13 22:20:14,358 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:20:14,368 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;@45ae153, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:20:14,369 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-03-13 22:20:14,385 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:20:14,386 INFO L124 PetriNetUnfolderBase]: 1/60 cut-off events. [2025-03-13 22:20:14,386 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:20:14,386 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:20:14,387 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] [2025-03-13 22:20:14,387 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:14,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:20:14,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1528734423, now seen corresponding path program 1 times [2025-03-13 22:20:14,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:20:14,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692885776] [2025-03-13 22:20:14,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:20:14,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:20:14,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-13 22:20:14,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-13 22:20:14,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:20:14,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:20:14,655 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:14,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:20:14,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692885776] [2025-03-13 22:20:14,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692885776] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:20:14,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:20:14,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 22:20:14,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120451130] [2025-03-13 22:20:14,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:20:14,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:20:14,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:20:14,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:20:14,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:20:14,719 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 152 [2025-03-13 22:20:14,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 152 transitions, 311 flow. Second operand has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 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:14,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:20:14,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 152 [2025-03-13 22:20:14,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:20:14,833 INFO L124 PetriNetUnfolderBase]: 49/507 cut-off events. [2025-03-13 22:20:14,833 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-13 22:20:14,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 628 conditions, 507 events. 49/507 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2300 event pairs, 28 based on Foata normal form. 48/503 useless extension candidates. Maximal degree in co-relation 542. Up to 108 conditions per place. [2025-03-13 22:20:14,839 INFO L140 encePairwiseOnDemand]: 139/152 looper letters, 22 selfloop transitions, 2 changer transitions 0/146 dead transitions. [2025-03-13 22:20:14,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 146 transitions, 347 flow [2025-03-13 22:20:14,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:20:14,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:20:14,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 410 transitions. [2025-03-13 22:20:14,854 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8991228070175439 [2025-03-13 22:20:14,856 INFO L175 Difference]: Start difference. First operand has 143 places, 152 transitions, 311 flow. Second operand 3 states and 410 transitions. [2025-03-13 22:20:14,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 146 transitions, 347 flow [2025-03-13 22:20:14,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 146 transitions, 347 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:20:14,865 INFO L231 Difference]: Finished difference. Result has 144 places, 140 transitions, 295 flow [2025-03-13 22:20:14,867 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=287, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=295, PETRI_PLACES=144, PETRI_TRANSITIONS=140} [2025-03-13 22:20:14,870 INFO L279 CegarLoopForPetriNet]: 143 programPoint places, 1 predicate places. [2025-03-13 22:20:14,871 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 140 transitions, 295 flow [2025-03-13 22:20:14,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 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:14,871 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:20:14,872 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:14,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 22:20:14,872 INFO L396 AbstractCegarLoop]: === Iteration 2 === 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:14,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:20:14,873 INFO L85 PathProgramCache]: Analyzing trace with hash 323642331, now seen corresponding path program 1 times [2025-03-13 22:20:14,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:20:14,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301317793] [2025-03-13 22:20:14,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:20:14,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:20:14,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-13 22:20:14,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-13 22:20:14,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:20:14,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:20:15,346 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:15,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:20:15,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301317793] [2025-03-13 22:20:15,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301317793] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:20:15,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:20:15,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:20:15,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047263497] [2025-03-13 22:20:15,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:20:15,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:20:15,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:20:15,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:20:15,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:20:15,472 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 152 [2025-03-13 22:20:15,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 140 transitions, 295 flow. Second operand has 6 states, 6 states have (on average 112.5) internal successors, (675), 6 states have internal predecessors, (675), 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:15,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:20:15,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 152 [2025-03-13 22:20:15,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:20:15,631 INFO L124 PetriNetUnfolderBase]: 109/704 cut-off events. [2025-03-13 22:20:15,632 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-03-13 22:20:15,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 991 conditions, 704 events. 109/704 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4062 event pairs, 7 based on Foata normal form. 0/647 useless extension candidates. Maximal degree in co-relation 892. Up to 181 conditions per place. [2025-03-13 22:20:15,638 INFO L140 encePairwiseOnDemand]: 146/152 looper letters, 48 selfloop transitions, 5 changer transitions 0/163 dead transitions. [2025-03-13 22:20:15,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 163 transitions, 447 flow [2025-03-13 22:20:15,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:20:15,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:20:15,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 720 transitions. [2025-03-13 22:20:15,643 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7894736842105263 [2025-03-13 22:20:15,643 INFO L175 Difference]: Start difference. First operand has 144 places, 140 transitions, 295 flow. Second operand 6 states and 720 transitions. [2025-03-13 22:20:15,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 163 transitions, 447 flow [2025-03-13 22:20:15,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 163 transitions, 443 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:20:15,647 INFO L231 Difference]: Finished difference. Result has 146 places, 139 transitions, 299 flow [2025-03-13 22:20:15,649 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=289, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=299, PETRI_PLACES=146, PETRI_TRANSITIONS=139} [2025-03-13 22:20:15,649 INFO L279 CegarLoopForPetriNet]: 143 programPoint places, 3 predicate places. [2025-03-13 22:20:15,649 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 139 transitions, 299 flow [2025-03-13 22:20:15,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.5) internal successors, (675), 6 states have internal predecessors, (675), 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:15,650 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:20:15,650 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] [2025-03-13 22:20:15,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 22:20:15,650 INFO L396 AbstractCegarLoop]: === Iteration 3 === 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:15,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:20:15,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1615096748, now seen corresponding path program 1 times [2025-03-13 22:20:15,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:20:15,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512665373] [2025-03-13 22:20:15,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:20:15,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:20:15,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-13 22:20:15,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-13 22:20:15,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:20:15,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:20:15,690 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:15,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:20:15,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512665373] [2025-03-13 22:20:15,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512665373] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:20:15,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:20:15,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:20:15,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191342829] [2025-03-13 22:20:15,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:20:15,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:20:15,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:20:15,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:20:15,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:20:15,710 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 152 [2025-03-13 22:20:15,711 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 139 transitions, 299 flow. Second operand has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 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:15,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:20:15,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 152 [2025-03-13 22:20:15,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:20:15,849 INFO L124 PetriNetUnfolderBase]: 92/800 cut-off events. [2025-03-13 22:20:15,850 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-13 22:20:15,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1036 conditions, 800 events. 92/800 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4678 event pairs, 30 based on Foata normal form. 0/730 useless extension candidates. Maximal degree in co-relation 959. Up to 125 conditions per place. [2025-03-13 22:20:15,852 INFO L140 encePairwiseOnDemand]: 143/152 looper letters, 30 selfloop transitions, 6 changer transitions 0/152 dead transitions. [2025-03-13 22:20:15,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 152 transitions, 400 flow [2025-03-13 22:20:15,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:20:15,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:20:15,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 393 transitions. [2025-03-13 22:20:15,855 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8618421052631579 [2025-03-13 22:20:15,855 INFO L175 Difference]: Start difference. First operand has 146 places, 139 transitions, 299 flow. Second operand 3 states and 393 transitions. [2025-03-13 22:20:15,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 152 transitions, 400 flow [2025-03-13 22:20:15,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 152 transitions, 390 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:20:15,860 INFO L231 Difference]: Finished difference. Result has 143 places, 141 transitions, 327 flow [2025-03-13 22:20:15,861 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=327, PETRI_PLACES=143, PETRI_TRANSITIONS=141} [2025-03-13 22:20:15,862 INFO L279 CegarLoopForPetriNet]: 143 programPoint places, 0 predicate places. [2025-03-13 22:20:15,862 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 141 transitions, 327 flow [2025-03-13 22:20:15,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 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:15,862 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:20:15,863 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 22:20:15,863 INFO L396 AbstractCegarLoop]: === Iteration 4 === 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:15,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:20:15,864 INFO L85 PathProgramCache]: Analyzing trace with hash 753153473, now seen corresponding path program 1 times [2025-03-13 22:20:15,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:20:15,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968121297] [2025-03-13 22:20:15,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:20:15,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:20:15,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-13 22:20:15,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-13 22:20:15,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:20:15,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:20:15,908 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:15,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:20:15,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968121297] [2025-03-13 22:20:15,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968121297] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:20:15,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:20:15,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:20:15,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371448153] [2025-03-13 22:20:15,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:20:15,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:20:15,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:20:15,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:20:15,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:20:15,931 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 152 [2025-03-13 22:20:15,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 141 transitions, 327 flow. Second operand has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:20:15,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:20:15,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 152 [2025-03-13 22:20:15,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:20:16,028 INFO L124 PetriNetUnfolderBase]: 95/799 cut-off events. [2025-03-13 22:20:16,029 INFO L125 PetriNetUnfolderBase]: For 113/113 co-relation queries the response was YES. [2025-03-13 22:20:16,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1133 conditions, 799 events. 95/799 cut-off events. For 113/113 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4718 event pairs, 60 based on Foata normal form. 0/729 useless extension candidates. Maximal degree in co-relation 1056. Up to 189 conditions per place. [2025-03-13 22:20:16,032 INFO L140 encePairwiseOnDemand]: 147/152 looper letters, 27 selfloop transitions, 4 changer transitions 0/148 dead transitions. [2025-03-13 22:20:16,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 148 transitions, 407 flow [2025-03-13 22:20:16,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:20:16,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:20:16,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 389 transitions. [2025-03-13 22:20:16,033 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8530701754385965 [2025-03-13 22:20:16,033 INFO L175 Difference]: Start difference. First operand has 143 places, 141 transitions, 327 flow. Second operand 3 states and 389 transitions. [2025-03-13 22:20:16,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 148 transitions, 407 flow [2025-03-13 22:20:16,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 148 transitions, 393 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:20:16,038 INFO L231 Difference]: Finished difference. Result has 145 places, 144 transitions, 347 flow [2025-03-13 22:20:16,038 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=347, PETRI_PLACES=145, PETRI_TRANSITIONS=144} [2025-03-13 22:20:16,039 INFO L279 CegarLoopForPetriNet]: 143 programPoint places, 2 predicate places. [2025-03-13 22:20:16,039 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 144 transitions, 347 flow [2025-03-13 22:20:16,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:20:16,040 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:20:16,040 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:20:16,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 22:20:16,040 INFO L396 AbstractCegarLoop]: === Iteration 5 === 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:16,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:20:16,041 INFO L85 PathProgramCache]: Analyzing trace with hash -2092542255, now seen corresponding path program 1 times [2025-03-13 22:20:16,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:20:16,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214596877] [2025-03-13 22:20:16,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:20:16,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:20:16,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-13 22:20:16,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-13 22:20:16,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:20:16,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:20:16,062 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 22:20:16,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-13 22:20:16,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-13 22:20:16,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:20:16,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:20:16,096 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 22:20:16,096 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 22:20:16,097 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 12 remaining) [2025-03-13 22:20:16,099 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining) [2025-03-13 22:20:16,099 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining) [2025-03-13 22:20:16,099 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining) [2025-03-13 22:20:16,099 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 12 remaining) [2025-03-13 22:20:16,099 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 12 remaining) [2025-03-13 22:20:16,099 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 12 remaining) [2025-03-13 22:20:16,099 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining) [2025-03-13 22:20:16,099 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining) [2025-03-13 22:20:16,099 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining) [2025-03-13 22:20:16,099 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining) [2025-03-13 22:20:16,099 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining) [2025-03-13 22:20:16,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 22:20:16,100 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-13 22:20:16,102 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 22:20:16,102 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-13 22:20:16,132 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-13 22:20:16,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 186 places, 200 transitions, 416 flow [2025-03-13 22:20:16,189 INFO L124 PetriNetUnfolderBase]: 28/341 cut-off events. [2025-03-13 22:20:16,190 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-13 22:20:16,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 353 conditions, 341 events. 28/341 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1153 event pairs, 0 based on Foata normal form. 0/291 useless extension candidates. Maximal degree in co-relation 211. Up to 6 conditions per place. [2025-03-13 22:20:16,195 INFO L82 GeneralOperation]: Start removeDead. Operand has 186 places, 200 transitions, 416 flow [2025-03-13 22:20:16,197 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 186 places, 200 transitions, 416 flow [2025-03-13 22:20:16,198 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:20:16,198 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;@45ae153, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:20:16,198 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-03-13 22:20:16,203 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:20:16,203 INFO L124 PetriNetUnfolderBase]: 1/60 cut-off events. [2025-03-13 22:20:16,204 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:20:16,204 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:20:16,204 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] [2025-03-13 22:20:16,204 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:16,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:20:16,204 INFO L85 PathProgramCache]: Analyzing trace with hash 351773143, now seen corresponding path program 1 times [2025-03-13 22:20:16,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:20:16,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142428784] [2025-03-13 22:20:16,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:20:16,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:20:16,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-13 22:20:16,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-13 22:20:16,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:20:16,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:20:16,251 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:16,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:20:16,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142428784] [2025-03-13 22:20:16,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142428784] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:20:16,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:20:16,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 22:20:16,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318103789] [2025-03-13 22:20:16,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:20:16,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:20:16,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:20:16,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:20:16,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:20:16,277 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 200 [2025-03-13 22:20:16,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 200 transitions, 416 flow. Second operand has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 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:16,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:20:16,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 200 [2025-03-13 22:20:16,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:20:16,849 INFO L124 PetriNetUnfolderBase]: 789/4195 cut-off events. [2025-03-13 22:20:16,849 INFO L125 PetriNetUnfolderBase]: For 73/73 co-relation queries the response was YES. [2025-03-13 22:20:16,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5548 conditions, 4195 events. 789/4195 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 39154 event pairs, 632 based on Foata normal form. 562/4364 useless extension candidates. Maximal degree in co-relation 3459. Up to 1303 conditions per place. [2025-03-13 22:20:16,869 INFO L140 encePairwiseOnDemand]: 181/200 looper letters, 31 selfloop transitions, 2 changer transitions 0/189 dead transitions. [2025-03-13 22:20:16,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 189 transitions, 460 flow [2025-03-13 22:20:16,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:20:16,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:20:16,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 527 transitions. [2025-03-13 22:20:16,873 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8783333333333333 [2025-03-13 22:20:16,873 INFO L175 Difference]: Start difference. First operand has 186 places, 200 transitions, 416 flow. Second operand 3 states and 527 transitions. [2025-03-13 22:20:16,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 189 transitions, 460 flow [2025-03-13 22:20:16,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 189 transitions, 460 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:20:16,876 INFO L231 Difference]: Finished difference. Result has 187 places, 183 transitions, 392 flow [2025-03-13 22:20:16,876 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=392, PETRI_PLACES=187, PETRI_TRANSITIONS=183} [2025-03-13 22:20:16,877 INFO L279 CegarLoopForPetriNet]: 186 programPoint places, 1 predicate places. [2025-03-13 22:20:16,877 INFO L471 AbstractCegarLoop]: Abstraction has has 187 places, 183 transitions, 392 flow [2025-03-13 22:20:16,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 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:16,878 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:20:16,878 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:16,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 22:20:16,878 INFO L396 AbstractCegarLoop]: === Iteration 2 === 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:16,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:20:16,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1159742501, now seen corresponding path program 1 times [2025-03-13 22:20:16,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:20:16,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607944916] [2025-03-13 22:20:16,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:20:16,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:20:16,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-13 22:20:16,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-13 22:20:16,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:20:16,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:20:17,132 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:17,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:20:17,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607944916] [2025-03-13 22:20:17,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607944916] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:20:17,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:20:17,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:20:17,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434116129] [2025-03-13 22:20:17,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:20:17,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:20:17,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:20:17,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:20:17,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:20:17,228 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 200 [2025-03-13 22:20:17,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 183 transitions, 392 flow. Second operand has 6 states, 6 states have (on average 146.5) internal successors, (879), 6 states have internal predecessors, (879), 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:17,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:20:17,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 200 [2025-03-13 22:20:17,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:20:17,927 INFO L124 PetriNetUnfolderBase]: 1719/5934 cut-off events. [2025-03-13 22:20:17,927 INFO L125 PetriNetUnfolderBase]: For 132/134 co-relation queries the response was YES. [2025-03-13 22:20:17,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8911 conditions, 5934 events. 1719/5934 cut-off events. For 132/134 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 55833 event pairs, 665 based on Foata normal form. 0/5482 useless extension candidates. Maximal degree in co-relation 4830. Up to 2015 conditions per place. [2025-03-13 22:20:17,965 INFO L140 encePairwiseOnDemand]: 194/200 looper letters, 80 selfloop transitions, 6 changer transitions 0/230 dead transitions. [2025-03-13 22:20:17,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 230 transitions, 658 flow [2025-03-13 22:20:17,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:20:17,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:20:17,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 956 transitions. [2025-03-13 22:20:17,967 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7966666666666666 [2025-03-13 22:20:17,967 INFO L175 Difference]: Start difference. First operand has 187 places, 183 transitions, 392 flow. Second operand 6 states and 956 transitions. [2025-03-13 22:20:17,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 230 transitions, 658 flow [2025-03-13 22:20:17,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 230 transitions, 656 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:20:17,971 INFO L231 Difference]: Finished difference. Result has 190 places, 182 transitions, 400 flow [2025-03-13 22:20:17,971 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=400, PETRI_PLACES=190, PETRI_TRANSITIONS=182} [2025-03-13 22:20:17,972 INFO L279 CegarLoopForPetriNet]: 186 programPoint places, 4 predicate places. [2025-03-13 22:20:17,972 INFO L471 AbstractCegarLoop]: Abstraction has has 190 places, 182 transitions, 400 flow [2025-03-13 22:20:17,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 146.5) internal successors, (879), 6 states have internal predecessors, (879), 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:17,973 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:20:17,974 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] [2025-03-13 22:20:17,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 22:20:17,974 INFO L396 AbstractCegarLoop]: === Iteration 3 === 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:17,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:20:17,975 INFO L85 PathProgramCache]: Analyzing trace with hash -278798234, now seen corresponding path program 1 times [2025-03-13 22:20:17,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:20:17,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299863052] [2025-03-13 22:20:17,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:20:17,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:20:17,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-13 22:20:17,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-13 22:20:17,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:20:17,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:20:18,015 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:18,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:20:18,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299863052] [2025-03-13 22:20:18,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299863052] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:20:18,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:20:18,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:20:18,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003042079] [2025-03-13 22:20:18,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:20:18,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:20:18,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:20:18,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:20:18,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:20:18,047 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 200 [2025-03-13 22:20:18,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 182 transitions, 400 flow. Second operand has 3 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 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:18,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:20:18,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 200 [2025-03-13 22:20:18,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:20:19,264 INFO L124 PetriNetUnfolderBase]: 3896/14458 cut-off events. [2025-03-13 22:20:19,266 INFO L125 PetriNetUnfolderBase]: For 240/240 co-relation queries the response was YES. [2025-03-13 22:20:19,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21016 conditions, 14458 events. 3896/14458 cut-off events. For 240/240 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 161626 event pairs, 1409 based on Foata normal form. 0/12970 useless extension candidates. Maximal degree in co-relation 14553. Up to 3516 conditions per place. [2025-03-13 22:20:19,340 INFO L140 encePairwiseOnDemand]: 181/200 looper letters, 58 selfloop transitions, 14 changer transitions 0/215 dead transitions. [2025-03-13 22:20:19,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 215 transitions, 621 flow [2025-03-13 22:20:19,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:20:19,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:20:19,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 509 transitions. [2025-03-13 22:20:19,342 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8483333333333334 [2025-03-13 22:20:19,342 INFO L175 Difference]: Start difference. First operand has 190 places, 182 transitions, 400 flow. Second operand 3 states and 509 transitions. [2025-03-13 22:20:19,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 215 transitions, 621 flow [2025-03-13 22:20:19,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 215 transitions, 609 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:20:19,345 INFO L231 Difference]: Finished difference. Result has 189 places, 196 transitions, 510 flow [2025-03-13 22:20:19,345 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=510, PETRI_PLACES=189, PETRI_TRANSITIONS=196} [2025-03-13 22:20:19,346 INFO L279 CegarLoopForPetriNet]: 186 programPoint places, 3 predicate places. [2025-03-13 22:20:19,346 INFO L471 AbstractCegarLoop]: Abstraction has has 189 places, 196 transitions, 510 flow [2025-03-13 22:20:19,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 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:19,346 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:20:19,346 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] [2025-03-13 22:20:19,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 22:20:19,347 INFO L396 AbstractCegarLoop]: === Iteration 4 === 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:19,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:20:19,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1889209417, now seen corresponding path program 1 times [2025-03-13 22:20:19,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:20:19,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555558546] [2025-03-13 22:20:19,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:20:19,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:20:19,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-13 22:20:19,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-13 22:20:19,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:20:19,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:20:19,384 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:19,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:20:19,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555558546] [2025-03-13 22:20:19,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555558546] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:20:19,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:20:19,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:20:19,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39275204] [2025-03-13 22:20:19,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:20:19,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:20:19,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:20:19,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:20:19,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:20:19,469 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 200 [2025-03-13 22:20:19,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 196 transitions, 510 flow. Second operand has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 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:19,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:20:19,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 200 [2025-03-13 22:20:19,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:20:20,715 INFO L124 PetriNetUnfolderBase]: 4007/16197 cut-off events. [2025-03-13 22:20:20,716 INFO L125 PetriNetUnfolderBase]: For 4331/4506 co-relation queries the response was YES. [2025-03-13 22:20:20,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26861 conditions, 16197 events. 4007/16197 cut-off events. For 4331/4506 co-relation queries the response was YES. Maximal size of possible extension queue 423. Compared 189462 event pairs, 2405 based on Foata normal form. 52/14762 useless extension candidates. Maximal degree in co-relation 13663. Up to 5478 conditions per place. [2025-03-13 22:20:20,810 INFO L140 encePairwiseOnDemand]: 191/200 looper letters, 52 selfloop transitions, 14 changer transitions 0/220 dead transitions. [2025-03-13 22:20:20,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 220 transitions, 728 flow [2025-03-13 22:20:20,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:20:20,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:20:20,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 503 transitions. [2025-03-13 22:20:20,813 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8383333333333334 [2025-03-13 22:20:20,813 INFO L175 Difference]: Start difference. First operand has 189 places, 196 transitions, 510 flow. Second operand 3 states and 503 transitions. [2025-03-13 22:20:20,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 220 transitions, 728 flow [2025-03-13 22:20:20,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 220 transitions, 690 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:20:20,828 INFO L231 Difference]: Finished difference. Result has 191 places, 208 transitions, 608 flow [2025-03-13 22:20:20,828 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=482, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=608, PETRI_PLACES=191, PETRI_TRANSITIONS=208} [2025-03-13 22:20:20,828 INFO L279 CegarLoopForPetriNet]: 186 programPoint places, 5 predicate places. [2025-03-13 22:20:20,830 INFO L471 AbstractCegarLoop]: Abstraction has has 191 places, 208 transitions, 608 flow [2025-03-13 22:20:20,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 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:20,830 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:20:20,830 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:20:20,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 22:20:20,831 INFO L396 AbstractCegarLoop]: === Iteration 5 === 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:20,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:20:20,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1252660026, now seen corresponding path program 1 times [2025-03-13 22:20:20,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:20:20,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465794447] [2025-03-13 22:20:20,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:20:20,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:20:20,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-13 22:20:20,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-13 22:20:20,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:20:20,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:20:20,923 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:20,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:20:20,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465794447] [2025-03-13 22:20:20,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465794447] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:20:20,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:20:20,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:20:20,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268515409] [2025-03-13 22:20:20,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:20:20,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 22:20:20,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:20:20,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 22:20:20,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 22:20:20,960 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 200 [2025-03-13 22:20:20,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 208 transitions, 608 flow. Second operand has 5 states, 5 states have (on average 157.4) internal successors, (787), 5 states have internal predecessors, (787), 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:20,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:20:20,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 200 [2025-03-13 22:20:20,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:20:22,498 INFO L124 PetriNetUnfolderBase]: 3077/17680 cut-off events. [2025-03-13 22:20:22,498 INFO L125 PetriNetUnfolderBase]: For 1336/1804 co-relation queries the response was YES. [2025-03-13 22:20:22,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25146 conditions, 17680 events. 3077/17680 cut-off events. For 1336/1804 co-relation queries the response was YES. Maximal size of possible extension queue 505. Compared 230865 event pairs, 608 based on Foata normal form. 16/15808 useless extension candidates. Maximal degree in co-relation 11400. Up to 3821 conditions per place. [2025-03-13 22:20:22,586 INFO L140 encePairwiseOnDemand]: 195/200 looper letters, 56 selfloop transitions, 5 changer transitions 0/240 dead transitions. [2025-03-13 22:20:22,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 240 transitions, 794 flow [2025-03-13 22:20:22,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:20:22,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:20:22,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 992 transitions. [2025-03-13 22:20:22,590 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8266666666666667 [2025-03-13 22:20:22,590 INFO L175 Difference]: Start difference. First operand has 191 places, 208 transitions, 608 flow. Second operand 6 states and 992 transitions. [2025-03-13 22:20:22,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 240 transitions, 794 flow [2025-03-13 22:20:22,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 240 transitions, 766 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:20:22,599 INFO L231 Difference]: Finished difference. Result has 197 places, 210 transitions, 606 flow [2025-03-13 22:20:22,599 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=580, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=606, PETRI_PLACES=197, PETRI_TRANSITIONS=210} [2025-03-13 22:20:22,600 INFO L279 CegarLoopForPetriNet]: 186 programPoint places, 11 predicate places. [2025-03-13 22:20:22,600 INFO L471 AbstractCegarLoop]: Abstraction has has 197 places, 210 transitions, 606 flow [2025-03-13 22:20:22,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 157.4) internal successors, (787), 5 states have internal predecessors, (787), 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,600 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:20:22,601 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:20:22,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-13 22:20:22,601 INFO L396 AbstractCegarLoop]: === Iteration 6 === 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:22,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:20:22,601 INFO L85 PathProgramCache]: Analyzing trace with hash 840173642, now seen corresponding path program 1 times [2025-03-13 22:20:22,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:20:22,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366642007] [2025-03-13 22:20:22,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:20:22,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:20:22,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-13 22:20:22,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-13 22:20:22,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:20:22,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:20:22,648 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:22,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:20:22,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366642007] [2025-03-13 22:20:22,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366642007] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:20:22,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:20:22,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:20:22,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905875036] [2025-03-13 22:20:22,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:20:22,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:20:22,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:20:22,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:20:22,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:20:22,694 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 200 [2025-03-13 22:20:22,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 210 transitions, 606 flow. Second operand has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 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,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:20:22,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 200 [2025-03-13 22:20:22,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:20:24,202 INFO L124 PetriNetUnfolderBase]: 4655/19852 cut-off events. [2025-03-13 22:20:24,202 INFO L125 PetriNetUnfolderBase]: For 5180/5372 co-relation queries the response was YES. [2025-03-13 22:20:24,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32371 conditions, 19852 events. 4655/19852 cut-off events. For 5180/5372 co-relation queries the response was YES. Maximal size of possible extension queue 565. Compared 246765 event pairs, 2719 based on Foata normal form. 35/17823 useless extension candidates. Maximal degree in co-relation 32173. Up to 6268 conditions per place. [2025-03-13 22:20:24,301 INFO L140 encePairwiseOnDemand]: 191/200 looper letters, 59 selfloop transitions, 17 changer transitions 0/234 dead transitions. [2025-03-13 22:20:24,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 234 transitions, 841 flow [2025-03-13 22:20:24,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:20:24,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:20:24,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 502 transitions. [2025-03-13 22:20:24,303 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8366666666666667 [2025-03-13 22:20:24,303 INFO L175 Difference]: Start difference. First operand has 197 places, 210 transitions, 606 flow. Second operand 3 states and 502 transitions. [2025-03-13 22:20:24,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 234 transitions, 841 flow [2025-03-13 22:20:24,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 234 transitions, 835 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-13 22:20:24,308 INFO L231 Difference]: Finished difference. Result has 199 places, 223 transitions, 754 flow [2025-03-13 22:20:24,308 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=600, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=754, PETRI_PLACES=199, PETRI_TRANSITIONS=223} [2025-03-13 22:20:24,309 INFO L279 CegarLoopForPetriNet]: 186 programPoint places, 13 predicate places. [2025-03-13 22:20:24,309 INFO L471 AbstractCegarLoop]: Abstraction has has 199 places, 223 transitions, 754 flow [2025-03-13 22:20:24,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 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,309 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:20:24,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:20:24,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-13 22:20:24,310 INFO L396 AbstractCegarLoop]: === Iteration 7 === 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:24,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:20:24,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1341305027, now seen corresponding path program 1 times [2025-03-13 22:20:24,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:20:24,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867087677] [2025-03-13 22:20:24,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:20:24,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:20:24,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-13 22:20:24,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-13 22:20:24,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:20:24,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:20:24,344 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:24,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:20:24,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867087677] [2025-03-13 22:20:24,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867087677] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:20:24,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:20:24,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:20:24,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396422958] [2025-03-13 22:20:24,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:20:24,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:20:24,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:20:24,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:20:24,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:20:24,379 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 200 [2025-03-13 22:20:24,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 223 transitions, 754 flow. Second operand has 3 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 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,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:20:24,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 200 [2025-03-13 22:20:24,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:20:26,404 INFO L124 PetriNetUnfolderBase]: 5221/22369 cut-off events. [2025-03-13 22:20:26,405 INFO L125 PetriNetUnfolderBase]: For 12689/13116 co-relation queries the response was YES. [2025-03-13 22:20:26,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39555 conditions, 22369 events. 5221/22369 cut-off events. For 12689/13116 co-relation queries the response was YES. Maximal size of possible extension queue 631. Compared 283650 event pairs, 2889 based on Foata normal form. 60/20133 useless extension candidates. Maximal degree in co-relation 39336. Up to 7039 conditions per place. [2025-03-13 22:20:26,528 INFO L140 encePairwiseOnDemand]: 191/200 looper letters, 71 selfloop transitions, 17 changer transitions 0/248 dead transitions. [2025-03-13 22:20:26,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 248 transitions, 1048 flow [2025-03-13 22:20:26,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:20:26,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:20:26,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 503 transitions. [2025-03-13 22:20:26,529 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8383333333333334 [2025-03-13 22:20:26,529 INFO L175 Difference]: Start difference. First operand has 199 places, 223 transitions, 754 flow. Second operand 3 states and 503 transitions. [2025-03-13 22:20:26,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 248 transitions, 1048 flow [2025-03-13 22:20:26,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 248 transitions, 1008 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:20:26,544 INFO L231 Difference]: Finished difference. Result has 201 places, 236 transitions, 896 flow [2025-03-13 22:20:26,544 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=720, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=896, PETRI_PLACES=201, PETRI_TRANSITIONS=236} [2025-03-13 22:20:26,546 INFO L279 CegarLoopForPetriNet]: 186 programPoint places, 15 predicate places. [2025-03-13 22:20:26,546 INFO L471 AbstractCegarLoop]: Abstraction has has 201 places, 236 transitions, 896 flow [2025-03-13 22:20:26,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 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:26,547 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:20:26,547 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:20:26,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-13 22:20:26,547 INFO L396 AbstractCegarLoop]: === Iteration 8 === 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:26,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:20:26,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1626526152, now seen corresponding path program 1 times [2025-03-13 22:20:26,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:20:26,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208413647] [2025-03-13 22:20:26,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:20:26,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:20:26,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-13 22:20:26,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-13 22:20:26,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:20:26,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:20:26,571 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 22:20:26,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-13 22:20:26,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-13 22:20:26,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:20:26,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:20:26,597 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 22:20:26,599 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 22:20:26,599 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2025-03-13 22:20:26,599 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (14 of 16 remaining) [2025-03-13 22:20:26,599 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining) [2025-03-13 22:20:26,599 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining) [2025-03-13 22:20:26,600 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining) [2025-03-13 22:20:26,600 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining) [2025-03-13 22:20:26,600 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (9 of 16 remaining) [2025-03-13 22:20:26,600 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (8 of 16 remaining) [2025-03-13 22:20:26,600 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 16 remaining) [2025-03-13 22:20:26,600 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 16 remaining) [2025-03-13 22:20:26,600 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining) [2025-03-13 22:20:26,600 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining) [2025-03-13 22:20:26,600 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining) [2025-03-13 22:20:26,600 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining) [2025-03-13 22:20:26,601 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining) [2025-03-13 22:20:26,601 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining) [2025-03-13 22:20:26,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-13 22:20:26,601 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:20:26,602 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 22:20:26,602 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-13 22:20:26,625 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-13 22:20:26,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 229 places, 248 transitions, 523 flow [2025-03-13 22:20:26,656 INFO L124 PetriNetUnfolderBase]: 43/516 cut-off events. [2025-03-13 22:20:26,656 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-03-13 22:20:26,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 541 conditions, 516 events. 43/516 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1948 event pairs, 1 based on Foata normal form. 0/441 useless extension candidates. Maximal degree in co-relation 349. Up to 12 conditions per place. [2025-03-13 22:20:26,659 INFO L82 GeneralOperation]: Start removeDead. Operand has 229 places, 248 transitions, 523 flow [2025-03-13 22:20:26,664 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 229 places, 248 transitions, 523 flow [2025-03-13 22:20:26,665 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:20:26,666 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;@45ae153, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:20:26,666 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2025-03-13 22:20:26,668 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:20:26,668 INFO L124 PetriNetUnfolderBase]: 1/60 cut-off events. [2025-03-13 22:20:26,668 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:20:26,668 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:20:26,668 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] [2025-03-13 22:20:26,668 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:26,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:20:26,668 INFO L85 PathProgramCache]: Analyzing trace with hash -248665385, now seen corresponding path program 1 times [2025-03-13 22:20:26,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:20:26,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83290336] [2025-03-13 22:20:26,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:20:26,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:20:26,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-13 22:20:26,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-13 22:20:26,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:20:26,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:20:26,691 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:26,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:20:26,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83290336] [2025-03-13 22:20:26,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83290336] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:20:26,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:20:26,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 22:20:26,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799354167] [2025-03-13 22:20:26,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:20:26,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:20:26,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:20:26,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:20:26,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:20:26,710 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 248 [2025-03-13 22:20:26,711 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 248 transitions, 523 flow. Second operand has 3 states, 3 states have (on average 193.0) internal successors, (579), 3 states have internal predecessors, (579), 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:26,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:20:26,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 248 [2025-03-13 22:20:26,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:20:29,739 INFO L124 PetriNetUnfolderBase]: 8949/34660 cut-off events. [2025-03-13 22:20:29,739 INFO L125 PetriNetUnfolderBase]: For 952/952 co-relation queries the response was YES. [2025-03-13 22:20:29,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47898 conditions, 34660 events. 8949/34660 cut-off events. For 952/952 co-relation queries the response was YES. Maximal size of possible extension queue 786. Compared 447945 event pairs, 5659 based on Foata normal form. 5599/37026 useless extension candidates. Maximal degree in co-relation 6157. Up to 12802 conditions per place. [2025-03-13 22:20:29,972 INFO L140 encePairwiseOnDemand]: 223/248 looper letters, 39 selfloop transitions, 2 changer transitions 0/231 dead transitions. [2025-03-13 22:20:29,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 231 transitions, 571 flow [2025-03-13 22:20:29,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:20:29,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:20:29,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 643 transitions. [2025-03-13 22:20:29,974 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.864247311827957 [2025-03-13 22:20:29,975 INFO L175 Difference]: Start difference. First operand has 229 places, 248 transitions, 523 flow. Second operand 3 states and 643 transitions. [2025-03-13 22:20:29,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 231 transitions, 571 flow [2025-03-13 22:20:29,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 231 transitions, 571 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:20:29,981 INFO L231 Difference]: Finished difference. Result has 230 places, 225 transitions, 487 flow [2025-03-13 22:20:29,984 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=475, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=487, PETRI_PLACES=230, PETRI_TRANSITIONS=225} [2025-03-13 22:20:29,984 INFO L279 CegarLoopForPetriNet]: 229 programPoint places, 1 predicate places. [2025-03-13 22:20:29,984 INFO L471 AbstractCegarLoop]: Abstraction has has 230 places, 225 transitions, 487 flow [2025-03-13 22:20:29,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 193.0) internal successors, (579), 3 states have internal predecessors, (579), 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,985 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:20:29,985 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:29,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-13 22:20:29,985 INFO L396 AbstractCegarLoop]: === Iteration 2 === 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:29,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:20:29,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1639424987, now seen corresponding path program 1 times [2025-03-13 22:20:29,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:20:29,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251517913] [2025-03-13 22:20:29,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:20:29,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:20:29,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-13 22:20:30,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-13 22:20:30,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:20:30,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:20:30,228 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:30,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:20:30,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251517913] [2025-03-13 22:20:30,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251517913] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:20:30,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:20:30,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:20:30,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124398004] [2025-03-13 22:20:30,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:20:30,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:20:30,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:20:30,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:20:30,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:20:30,303 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 248 [2025-03-13 22:20:30,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 225 transitions, 487 flow. Second operand has 6 states, 6 states have (on average 180.5) internal successors, (1083), 6 states have internal predecessors, (1083), 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,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:20:30,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 248 [2025-03-13 22:20:30,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:20:35,311 INFO L124 PetriNetUnfolderBase]: 19564/52225 cut-off events. [2025-03-13 22:20:35,311 INFO L125 PetriNetUnfolderBase]: For 1429/1431 co-relation queries the response was YES. [2025-03-13 22:20:35,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81152 conditions, 52225 events. 19564/52225 cut-off events. For 1429/1431 co-relation queries the response was YES. Maximal size of possible extension queue 1325. Compared 629012 event pairs, 6643 based on Foata normal form. 0/48866 useless extension candidates. Maximal degree in co-relation 58324. Up to 20064 conditions per place. [2025-03-13 22:20:35,689 INFO L140 encePairwiseOnDemand]: 242/248 looper letters, 112 selfloop transitions, 6 changer transitions 0/296 dead transitions. [2025-03-13 22:20:35,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 296 transitions, 865 flow [2025-03-13 22:20:35,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:20:35,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:20:35,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1192 transitions. [2025-03-13 22:20:35,692 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8010752688172043 [2025-03-13 22:20:35,692 INFO L175 Difference]: Start difference. First operand has 230 places, 225 transitions, 487 flow. Second operand 6 states and 1192 transitions. [2025-03-13 22:20:35,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 296 transitions, 865 flow [2025-03-13 22:20:35,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 296 transitions, 863 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:20:35,697 INFO L231 Difference]: Finished difference. Result has 233 places, 224 transitions, 495 flow [2025-03-13 22:20:35,697 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=483, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=495, PETRI_PLACES=233, PETRI_TRANSITIONS=224} [2025-03-13 22:20:35,699 INFO L279 CegarLoopForPetriNet]: 229 programPoint places, 4 predicate places. [2025-03-13 22:20:35,699 INFO L471 AbstractCegarLoop]: Abstraction has has 233 places, 224 transitions, 495 flow [2025-03-13 22:20:35,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 180.5) internal successors, (1083), 6 states have internal predecessors, (1083), 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:35,700 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:20:35,700 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] [2025-03-13 22:20:35,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-13 22:20:35,700 INFO L396 AbstractCegarLoop]: === Iteration 3 === 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:35,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:20:35,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1179082156, now seen corresponding path program 1 times [2025-03-13 22:20:35,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:20:35,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321130866] [2025-03-13 22:20:35,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:20:35,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:20:35,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-13 22:20:35,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-13 22:20:35,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:20:35,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:20:35,738 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:35,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:20:35,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321130866] [2025-03-13 22:20:35,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321130866] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:20:35,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:20:35,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:20:35,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252507924] [2025-03-13 22:20:35,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:20:35,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:20:35,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:20:35,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:20:35,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:20:35,785 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 248 [2025-03-13 22:20:35,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 224 transitions, 495 flow. Second operand has 3 states, 3 states have (on average 171.66666666666666) internal successors, (515), 3 states have internal predecessors, (515), 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:35,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:20:35,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 248 [2025-03-13 22:20:35,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand