./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-deagle/floating_read-20.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/pthread-deagle/floating_read-20.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 cd83ac16197366132446ebf4fbdedd8712860068d55cee6f01a283271b044e15 --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 22:27:03,669 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 22:27:03,727 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-13 22:27:03,731 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 22:27:03,733 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 22:27:03,752 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 22:27:03,754 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 22:27:03,754 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 22:27:03,754 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 22:27:03,754 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 22:27:03,755 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 22:27:03,755 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 22:27:03,755 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 22:27:03,756 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 22:27:03,756 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 22:27:03,756 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 22:27:03,756 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 22:27:03,756 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 22:27:03,756 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 22:27:03,756 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 22:27:03,757 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 22:27:03,757 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 22:27:03,757 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-13 22:27:03,757 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-13 22:27:03,757 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 22:27:03,757 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 22:27:03,757 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 22:27:03,757 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 22:27:03,757 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 22:27:03,757 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 22:27:03,757 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 22:27:03,758 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:27:03,758 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 22:27:03,758 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 22:27:03,758 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 22:27:03,758 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 22:27:03,758 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 22:27:03,758 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 22:27:03,758 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 22:27:03,758 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 22:27:03,758 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 22:27:03,758 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 22:27:03,758 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 -> cd83ac16197366132446ebf4fbdedd8712860068d55cee6f01a283271b044e15 [2025-03-13 22:27:04,002 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 22:27:04,009 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 22:27:04,011 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 22:27:04,012 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 22:27:04,013 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 22:27:04,014 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-deagle/floating_read-20.i [2025-03-13 22:27:05,182 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1677f241/6fdac14cdb9545839b18873872629d1c/FLAGabcc48a79 [2025-03-13 22:27:05,488 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 22:27:05,492 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/floating_read-20.i [2025-03-13 22:27:05,506 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1677f241/6fdac14cdb9545839b18873872629d1c/FLAGabcc48a79 [2025-03-13 22:27:05,751 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1677f241/6fdac14cdb9545839b18873872629d1c [2025-03-13 22:27:05,753 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 22:27:05,754 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 22:27:05,756 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 22:27:05,756 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 22:27:05,761 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 22:27:05,761 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:27:05" (1/1) ... [2025-03-13 22:27:05,763 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39fb9c48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:27:05, skipping insertion in model container [2025-03-13 22:27:05,763 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:27:05" (1/1) ... [2025-03-13 22:27:05,790 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 22:27:05,981 WARN L1731 CHandler]: Possible shadowing of function thread [2025-03-13 22:27:05,992 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:27:05,999 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 22:27:06,023 WARN L1731 CHandler]: Possible shadowing of function thread [2025-03-13 22:27:06,026 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:27:06,055 INFO L204 MainTranslator]: Completed translation [2025-03-13 22:27:06,056 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:27:06 WrapperNode [2025-03-13 22:27:06,056 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 22:27:06,057 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 22:27:06,058 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 22:27:06,058 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 22:27:06,062 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:27:06" (1/1) ... [2025-03-13 22:27:06,070 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:27:06" (1/1) ... [2025-03-13 22:27:06,082 INFO L138 Inliner]: procedures = 162, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 62 [2025-03-13 22:27:06,083 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 22:27:06,084 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 22:27:06,084 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 22:27:06,085 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 22:27:06,089 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:27:06" (1/1) ... [2025-03-13 22:27:06,089 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:27:06" (1/1) ... [2025-03-13 22:27:06,093 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:27:06" (1/1) ... [2025-03-13 22:27:06,093 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:27:06" (1/1) ... [2025-03-13 22:27:06,097 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:27:06" (1/1) ... [2025-03-13 22:27:06,098 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:27:06" (1/1) ... [2025-03-13 22:27:06,099 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:27:06" (1/1) ... [2025-03-13 22:27:06,099 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:27:06" (1/1) ... [2025-03-13 22:27:06,100 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 22:27:06,101 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 22:27:06,101 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 22:27:06,101 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 22:27:06,102 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:27:06" (1/1) ... [2025-03-13 22:27:06,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:27:06,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:27:06,128 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:27:06,131 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:27:06,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-13 22:27:06,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-13 22:27:06,146 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-13 22:27:06,146 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 22:27:06,146 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-13 22:27:06,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-13 22:27:06,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-13 22:27:06,146 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-03-13 22:27:06,147 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-03-13 22:27:06,147 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-13 22:27:06,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 22:27:06,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 22:27:06,148 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:27:06,238 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 22:27:06,240 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 22:27:06,376 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L719: havoc main_~#t~0#1.base, main_~#t~0#1.offset; [2025-03-13 22:27:06,376 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L719-1: SUMMARY for call ULTIMATE.dealloc(main_~#t~0#1.base, main_~#t~0#1.offset); srcloc: null [2025-03-13 22:27:06,392 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 22:27:06,392 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 22:27:06,393 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 22:27:06,421 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 22:27:06,422 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:27:06 BoogieIcfgContainer [2025-03-13 22:27:06,422 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 22:27:06,424 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 22:27:06,424 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 22:27:06,428 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 22:27:06,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 10:27:05" (1/3) ... [2025-03-13 22:27:06,429 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fa9c7e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:27:06, skipping insertion in model container [2025-03-13 22:27:06,429 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:27:06" (2/3) ... [2025-03-13 22:27:06,429 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fa9c7e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:27:06, skipping insertion in model container [2025-03-13 22:27:06,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:27:06" (3/3) ... [2025-03-13 22:27:06,430 INFO L128 eAbstractionObserver]: Analyzing ICFG floating_read-20.i [2025-03-13 22:27:06,440 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 22:27:06,441 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG floating_read-20.i that has 2 procedures, 70 locations, 1 initial locations, 2 loop locations, and 5 error locations. [2025-03-13 22:27:06,441 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 22:27:06,484 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-13 22:27:06,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 73 transitions, 153 flow [2025-03-13 22:27:06,555 INFO L124 PetriNetUnfolderBase]: 5/115 cut-off events. [2025-03-13 22:27:06,557 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 22:27:06,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 115 events. 5/115 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 228 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 58. Up to 4 conditions per place. [2025-03-13 22:27:06,561 INFO L82 GeneralOperation]: Start removeDead. Operand has 73 places, 73 transitions, 153 flow [2025-03-13 22:27:06,563 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 73 transitions, 153 flow [2025-03-13 22:27:06,571 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:27:06,581 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;@7829f4d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:27:06,583 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-13 22:27:06,588 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:27:06,591 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-03-13 22:27:06,591 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:27:06,591 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:06,592 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:27:06,592 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-03-13 22:27:06,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:06,597 INFO L85 PathProgramCache]: Analyzing trace with hash 2044961978, now seen corresponding path program 1 times [2025-03-13 22:27:06,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:06,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383260382] [2025-03-13 22:27:06,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:06,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:06,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-13 22:27:06,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-13 22:27:06,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:06,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:06,713 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:27:06,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:06,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383260382] [2025-03-13 22:27:06,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383260382] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:06,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:06,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-13 22:27:06,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917916725] [2025-03-13 22:27:06,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:06,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-13 22:27:06,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:06,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-13 22:27:06,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-13 22:27:06,741 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 73 [2025-03-13 22:27:06,743 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 73 transitions, 153 flow. Second operand has 2 states, 2 states have (on average 64.5) internal successors, (129), 2 states have internal predecessors, (129), 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:27:06,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:06,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 73 [2025-03-13 22:27:06,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:06,775 INFO L124 PetriNetUnfolderBase]: 1/105 cut-off events. [2025-03-13 22:27:06,776 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2025-03-13 22:27:06,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 1/105 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 197 event pairs, 0 based on Foata normal form. 4/97 useless extension candidates. Maximal degree in co-relation 3. Up to 5 conditions per place. [2025-03-13 22:27:06,777 INFO L140 encePairwiseOnDemand]: 69/73 looper letters, 4 selfloop transitions, 0 changer transitions 12/67 dead transitions. [2025-03-13 22:27:06,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 67 transitions, 149 flow [2025-03-13 22:27:06,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-13 22:27:06,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-13 22:27:06,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 136 transitions. [2025-03-13 22:27:06,790 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9315068493150684 [2025-03-13 22:27:06,791 INFO L175 Difference]: Start difference. First operand has 73 places, 73 transitions, 153 flow. Second operand 2 states and 136 transitions. [2025-03-13 22:27:06,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 67 transitions, 149 flow [2025-03-13 22:27:06,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 67 transitions, 149 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:27:06,795 INFO L231 Difference]: Finished difference. Result has 70 places, 55 transitions, 117 flow [2025-03-13 22:27:06,797 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=117, PETRI_PLACES=70, PETRI_TRANSITIONS=55} [2025-03-13 22:27:06,799 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, -3 predicate places. [2025-03-13 22:27:06,799 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 55 transitions, 117 flow [2025-03-13 22:27:06,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 64.5) internal successors, (129), 2 states have internal predecessors, (129), 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:27:06,800 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:06,800 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:27:06,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 22:27:06,800 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-03-13 22:27:06,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:06,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1555464897, now seen corresponding path program 1 times [2025-03-13 22:27:06,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:06,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873478145] [2025-03-13 22:27:06,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:06,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:06,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-13 22:27:06,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-13 22:27:06,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:06,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:06,895 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:27:06,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:06,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873478145] [2025-03-13 22:27:06,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873478145] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:06,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:06,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 22:27:06,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688758433] [2025-03-13 22:27:06,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:06,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:27:06,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:06,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:27:06,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:27:06,933 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 73 [2025-03-13 22:27:06,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 55 transitions, 117 flow. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 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:27:06,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:06,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 73 [2025-03-13 22:27:06,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:06,969 INFO L124 PetriNetUnfolderBase]: 3/97 cut-off events. [2025-03-13 22:27:06,970 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-13 22:27:06,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 97 events. 3/97 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 148 event pairs, 2 based on Foata normal form. 1/91 useless extension candidates. Maximal degree in co-relation 115. Up to 13 conditions per place. [2025-03-13 22:27:06,970 INFO L140 encePairwiseOnDemand]: 70/73 looper letters, 8 selfloop transitions, 2 changer transitions 0/56 dead transitions. [2025-03-13 22:27:06,970 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 56 transitions, 139 flow [2025-03-13 22:27:06,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:27:06,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:27:06,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 185 transitions. [2025-03-13 22:27:06,973 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8447488584474886 [2025-03-13 22:27:06,973 INFO L175 Difference]: Start difference. First operand has 70 places, 55 transitions, 117 flow. Second operand 3 states and 185 transitions. [2025-03-13 22:27:06,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 56 transitions, 139 flow [2025-03-13 22:27:06,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 56 transitions, 139 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:27:06,975 INFO L231 Difference]: Finished difference. Result has 61 places, 55 transitions, 125 flow [2025-03-13 22:27:06,975 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=125, PETRI_PLACES=61, PETRI_TRANSITIONS=55} [2025-03-13 22:27:06,977 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, -12 predicate places. [2025-03-13 22:27:06,977 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 55 transitions, 125 flow [2025-03-13 22:27:06,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 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:27:06,977 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:06,978 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:27:06,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 22:27:06,978 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-03-13 22:27:06,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:06,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1482560346, now seen corresponding path program 1 times [2025-03-13 22:27:06,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:06,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122477426] [2025-03-13 22:27:06,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:06,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:06,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-13 22:27:07,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-13 22:27:07,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:07,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:07,326 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:27:07,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:07,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122477426] [2025-03-13 22:27:07,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122477426] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:07,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:07,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:27:07,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25452537] [2025-03-13 22:27:07,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:07,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:27:07,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:07,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:27:07,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:27:07,437 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 73 [2025-03-13 22:27:07,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 55 transitions, 125 flow. Second operand has 6 states, 6 states have (on average 47.666666666666664) internal successors, (286), 6 states have internal predecessors, (286), 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:27:07,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:07,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 73 [2025-03-13 22:27:07,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:07,487 INFO L124 PetriNetUnfolderBase]: 12/107 cut-off events. [2025-03-13 22:27:07,487 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-13 22:27:07,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175 conditions, 107 events. 12/107 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 239 event pairs, 6 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 169. Up to 32 conditions per place. [2025-03-13 22:27:07,488 INFO L140 encePairwiseOnDemand]: 67/73 looper letters, 18 selfloop transitions, 5 changer transitions 0/58 dead transitions. [2025-03-13 22:27:07,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 58 transitions, 177 flow [2025-03-13 22:27:07,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:27:07,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:27:07,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 300 transitions. [2025-03-13 22:27:07,490 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.684931506849315 [2025-03-13 22:27:07,490 INFO L175 Difference]: Start difference. First operand has 61 places, 55 transitions, 125 flow. Second operand 6 states and 300 transitions. [2025-03-13 22:27:07,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 58 transitions, 177 flow [2025-03-13 22:27:07,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 58 transitions, 173 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:27:07,491 INFO L231 Difference]: Finished difference. Result has 63 places, 54 transitions, 129 flow [2025-03-13 22:27:07,491 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=129, PETRI_PLACES=63, PETRI_TRANSITIONS=54} [2025-03-13 22:27:07,492 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, -10 predicate places. [2025-03-13 22:27:07,492 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 54 transitions, 129 flow [2025-03-13 22:27:07,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 47.666666666666664) internal successors, (286), 6 states have internal predecessors, (286), 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:27:07,492 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:07,492 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] [2025-03-13 22:27:07,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 22:27:07,492 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-03-13 22:27:07,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:07,493 INFO L85 PathProgramCache]: Analyzing trace with hash -677989434, now seen corresponding path program 1 times [2025-03-13 22:27:07,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:07,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212004799] [2025-03-13 22:27:07,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:07,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:07,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-13 22:27:07,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-13 22:27:07,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:07,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:07,550 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:27:07,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:07,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212004799] [2025-03-13 22:27:07,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212004799] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:07,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:07,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:27:07,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604609291] [2025-03-13 22:27:07,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:07,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 22:27:07,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:07,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 22:27:07,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 22:27:07,591 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 73 [2025-03-13 22:27:07,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 54 transitions, 129 flow. Second operand has 5 states, 5 states have (on average 57.8) internal successors, (289), 5 states have internal predecessors, (289), 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:27:07,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:07,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 73 [2025-03-13 22:27:07,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:07,624 INFO L124 PetriNetUnfolderBase]: 3/62 cut-off events. [2025-03-13 22:27:07,625 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 22:27:07,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 62 events. 3/62 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 57 event pairs, 0 based on Foata normal form. 2/64 useless extension candidates. Maximal degree in co-relation 94. Up to 4 conditions per place. [2025-03-13 22:27:07,626 INFO L140 encePairwiseOnDemand]: 68/73 looper letters, 7 selfloop transitions, 4 changer transitions 0/38 dead transitions. [2025-03-13 22:27:07,626 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 38 transitions, 114 flow [2025-03-13 22:27:07,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:27:07,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:27:07,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 348 transitions. [2025-03-13 22:27:07,628 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7945205479452054 [2025-03-13 22:27:07,628 INFO L175 Difference]: Start difference. First operand has 63 places, 54 transitions, 129 flow. Second operand 6 states and 348 transitions. [2025-03-13 22:27:07,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 38 transitions, 114 flow [2025-03-13 22:27:07,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 38 transitions, 102 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-13 22:27:07,629 INFO L231 Difference]: Finished difference. Result has 44 places, 35 transitions, 82 flow [2025-03-13 22:27:07,630 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=82, PETRI_PLACES=44, PETRI_TRANSITIONS=35} [2025-03-13 22:27:07,630 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, -29 predicate places. [2025-03-13 22:27:07,630 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 35 transitions, 82 flow [2025-03-13 22:27:07,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 57.8) internal successors, (289), 5 states have internal predecessors, (289), 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:27:07,631 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:07,631 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] [2025-03-13 22:27:07,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 22:27:07,631 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-03-13 22:27:07,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:07,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1568729041, now seen corresponding path program 1 times [2025-03-13 22:27:07,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:07,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654610171] [2025-03-13 22:27:07,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:07,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:07,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-13 22:27:07,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-13 22:27:07,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:07,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:27:07,653 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 22:27:07,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-13 22:27:07,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-13 22:27:07,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:07,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:27:07,676 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 22:27:07,677 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 22:27:07,678 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2025-03-13 22:27:07,679 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2025-03-13 22:27:07,679 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2025-03-13 22:27:07,679 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2025-03-13 22:27:07,680 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2025-03-13 22:27:07,680 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2025-03-13 22:27:07,680 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2025-03-13 22:27:07,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 22:27:07,680 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-13 22:27:07,682 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 22:27:07,682 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-13 22:27:07,694 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-13 22:27:07,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 81 transitions, 178 flow [2025-03-13 22:27:07,713 INFO L124 PetriNetUnfolderBase]: 9/193 cut-off events. [2025-03-13 22:27:07,713 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-13 22:27:07,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 205 conditions, 193 events. 9/193 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 439 event pairs, 0 based on Foata normal form. 0/167 useless extension candidates. Maximal degree in co-relation 117. Up to 6 conditions per place. [2025-03-13 22:27:07,713 INFO L82 GeneralOperation]: Start removeDead. Operand has 82 places, 81 transitions, 178 flow [2025-03-13 22:27:07,714 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 82 places, 81 transitions, 178 flow [2025-03-13 22:27:07,715 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:27:07,715 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;@7829f4d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:27:07,715 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-13 22:27:07,716 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:27:07,717 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-03-13 22:27:07,717 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:27:07,717 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:07,717 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:27:07,717 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-13 22:27:07,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:07,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1390887834, now seen corresponding path program 1 times [2025-03-13 22:27:07,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:07,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608145861] [2025-03-13 22:27:07,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:07,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:07,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-13 22:27:07,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-13 22:27:07,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:07,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:07,726 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:27:07,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:07,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608145861] [2025-03-13 22:27:07,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608145861] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:07,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:07,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-13 22:27:07,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216014663] [2025-03-13 22:27:07,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:07,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-13 22:27:07,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:07,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-13 22:27:07,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-13 22:27:07,728 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 81 [2025-03-13 22:27:07,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 81 transitions, 178 flow. Second operand has 2 states, 2 states have (on average 68.5) internal successors, (137), 2 states have internal predecessors, (137), 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:27:07,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:07,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 81 [2025-03-13 22:27:07,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:07,752 INFO L124 PetriNetUnfolderBase]: 7/212 cut-off events. [2025-03-13 22:27:07,753 INFO L125 PetriNetUnfolderBase]: For 26/35 co-relation queries the response was YES. [2025-03-13 22:27:07,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 247 conditions, 212 events. 7/212 cut-off events. For 26/35 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 557 event pairs, 4 based on Foata normal form. 6/193 useless extension candidates. Maximal degree in co-relation 111. Up to 18 conditions per place. [2025-03-13 22:27:07,754 INFO L140 encePairwiseOnDemand]: 76/81 looper letters, 7 selfloop transitions, 0 changer transitions 0/74 dead transitions. [2025-03-13 22:27:07,754 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 74 transitions, 178 flow [2025-03-13 22:27:07,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-13 22:27:07,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-13 22:27:07,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 148 transitions. [2025-03-13 22:27:07,755 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9135802469135802 [2025-03-13 22:27:07,755 INFO L175 Difference]: Start difference. First operand has 82 places, 81 transitions, 178 flow. Second operand 2 states and 148 transitions. [2025-03-13 22:27:07,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 74 transitions, 178 flow [2025-03-13 22:27:07,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 74 transitions, 178 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:27:07,756 INFO L231 Difference]: Finished difference. Result has 78 places, 74 transitions, 164 flow [2025-03-13 22:27:07,756 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=164, PETRI_PLACES=78, PETRI_TRANSITIONS=74} [2025-03-13 22:27:07,757 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, -4 predicate places. [2025-03-13 22:27:07,757 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 74 transitions, 164 flow [2025-03-13 22:27:07,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 68.5) internal successors, (137), 2 states have internal predecessors, (137), 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:27:07,757 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:07,757 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:27:07,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 22:27:07,757 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-13 22:27:07,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:07,758 INFO L85 PathProgramCache]: Analyzing trace with hash -836850702, now seen corresponding path program 1 times [2025-03-13 22:27:07,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:07,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165199358] [2025-03-13 22:27:07,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:07,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:07,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-13 22:27:07,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-13 22:27:07,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:07,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:07,775 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:27:07,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:07,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165199358] [2025-03-13 22:27:07,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165199358] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:07,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:07,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 22:27:07,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868564773] [2025-03-13 22:27:07,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:07,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:27:07,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:07,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:27:07,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:27:07,802 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 81 [2025-03-13 22:27:07,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 74 transitions, 164 flow. Second operand has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 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:27:07,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:07,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 81 [2025-03-13 22:27:07,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:07,840 INFO L124 PetriNetUnfolderBase]: 28/370 cut-off events. [2025-03-13 22:27:07,840 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2025-03-13 22:27:07,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 456 conditions, 370 events. 28/370 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1741 event pairs, 24 based on Foata normal form. 1/334 useless extension candidates. Maximal degree in co-relation 451. Up to 65 conditions per place. [2025-03-13 22:27:07,842 INFO L140 encePairwiseOnDemand]: 78/81 looper letters, 12 selfloop transitions, 2 changer transitions 3/76 dead transitions. [2025-03-13 22:27:07,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 76 transitions, 198 flow [2025-03-13 22:27:07,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:27:07,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:27:07,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 202 transitions. [2025-03-13 22:27:07,843 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.831275720164609 [2025-03-13 22:27:07,844 INFO L175 Difference]: Start difference. First operand has 78 places, 74 transitions, 164 flow. Second operand 3 states and 202 transitions. [2025-03-13 22:27:07,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 76 transitions, 198 flow [2025-03-13 22:27:07,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 76 transitions, 198 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:27:07,845 INFO L231 Difference]: Finished difference. Result has 81 places, 72 transitions, 170 flow [2025-03-13 22:27:07,845 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=170, PETRI_PLACES=81, PETRI_TRANSITIONS=72} [2025-03-13 22:27:07,846 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, -1 predicate places. [2025-03-13 22:27:07,846 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 72 transitions, 170 flow [2025-03-13 22:27:07,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 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:27:07,846 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:07,846 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:27:07,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 22:27:07,846 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-13 22:27:07,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:07,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1440163285, now seen corresponding path program 1 times [2025-03-13 22:27:07,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:07,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281883633] [2025-03-13 22:27:07,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:07,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:07,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-13 22:27:07,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-13 22:27:07,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:07,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:08,043 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:27:08,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:08,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281883633] [2025-03-13 22:27:08,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281883633] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:08,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:08,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:27:08,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738508006] [2025-03-13 22:27:08,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:08,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:27:08,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:08,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:27:08,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:27:08,126 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 81 [2025-03-13 22:27:08,127 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 72 transitions, 170 flow. Second operand has 6 states, 6 states have (on average 51.666666666666664) internal successors, (310), 6 states have internal predecessors, (310), 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:27:08,127 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:08,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 81 [2025-03-13 22:27:08,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:08,219 INFO L124 PetriNetUnfolderBase]: 77/403 cut-off events. [2025-03-13 22:27:08,220 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2025-03-13 22:27:08,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 628 conditions, 403 events. 77/403 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2007 event pairs, 12 based on Foata normal form. 0/373 useless extension candidates. Maximal degree in co-relation 621. Up to 122 conditions per place. [2025-03-13 22:27:08,223 INFO L140 encePairwiseOnDemand]: 75/81 looper letters, 25 selfloop transitions, 6 changer transitions 2/79 dead transitions. [2025-03-13 22:27:08,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 79 transitions, 248 flow [2025-03-13 22:27:08,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:27:08,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:27:08,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 332 transitions. [2025-03-13 22:27:08,226 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6831275720164609 [2025-03-13 22:27:08,227 INFO L175 Difference]: Start difference. First operand has 81 places, 72 transitions, 170 flow. Second operand 6 states and 332 transitions. [2025-03-13 22:27:08,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 79 transitions, 248 flow [2025-03-13 22:27:08,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 79 transitions, 246 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:27:08,228 INFO L231 Difference]: Finished difference. Result has 81 places, 69 transitions, 174 flow [2025-03-13 22:27:08,228 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=174, PETRI_PLACES=81, PETRI_TRANSITIONS=69} [2025-03-13 22:27:08,229 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, -1 predicate places. [2025-03-13 22:27:08,229 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 69 transitions, 174 flow [2025-03-13 22:27:08,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 51.666666666666664) internal successors, (310), 6 states have internal predecessors, (310), 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:27:08,229 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:08,229 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] [2025-03-13 22:27:08,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 22:27:08,229 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-13 22:27:08,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:08,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1380786001, now seen corresponding path program 1 times [2025-03-13 22:27:08,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:08,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336446785] [2025-03-13 22:27:08,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:08,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:08,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-13 22:27:08,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-13 22:27:08,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:08,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:08,282 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:27:08,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:08,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336446785] [2025-03-13 22:27:08,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336446785] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:08,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:08,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:27:08,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985320683] [2025-03-13 22:27:08,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:08,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 22:27:08,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:08,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 22:27:08,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 22:27:08,310 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 81 [2025-03-13 22:27:08,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 69 transitions, 174 flow. Second operand has 5 states, 5 states have (on average 61.8) internal successors, (309), 5 states have internal predecessors, (309), 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:27:08,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:08,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 81 [2025-03-13 22:27:08,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:08,371 INFO L124 PetriNetUnfolderBase]: 28/321 cut-off events. [2025-03-13 22:27:08,371 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-03-13 22:27:08,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 455 conditions, 321 events. 28/321 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1296 event pairs, 3 based on Foata normal form. 2/295 useless extension candidates. Maximal degree in co-relation 448. Up to 43 conditions per place. [2025-03-13 22:27:08,373 INFO L140 encePairwiseOnDemand]: 76/81 looper letters, 17 selfloop transitions, 5 changer transitions 0/76 dead transitions. [2025-03-13 22:27:08,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 76 transitions, 232 flow [2025-03-13 22:27:08,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:27:08,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:27:08,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 383 transitions. [2025-03-13 22:27:08,376 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7880658436213992 [2025-03-13 22:27:08,376 INFO L175 Difference]: Start difference. First operand has 81 places, 69 transitions, 174 flow. Second operand 6 states and 383 transitions. [2025-03-13 22:27:08,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 76 transitions, 232 flow [2025-03-13 22:27:08,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 76 transitions, 220 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:27:08,377 INFO L231 Difference]: Finished difference. Result has 82 places, 71 transitions, 188 flow [2025-03-13 22:27:08,379 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=188, PETRI_PLACES=82, PETRI_TRANSITIONS=71} [2025-03-13 22:27:08,380 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, 0 predicate places. [2025-03-13 22:27:08,380 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 71 transitions, 188 flow [2025-03-13 22:27:08,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 61.8) internal successors, (309), 5 states have internal predecessors, (309), 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:27:08,381 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:08,381 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:27:08,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 22:27:08,381 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-13 22:27:08,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:08,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1057221967, now seen corresponding path program 1 times [2025-03-13 22:27:08,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:08,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685841974] [2025-03-13 22:27:08,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:08,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:08,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-13 22:27:08,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-13 22:27:08,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:08,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:08,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:27:08,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:08,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685841974] [2025-03-13 22:27:08,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685841974] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:08,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:08,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:27:08,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073964834] [2025-03-13 22:27:08,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:08,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:27:08,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:08,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:27:08,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:27:08,421 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 81 [2025-03-13 22:27:08,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 71 transitions, 188 flow. Second operand has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:27:08,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:08,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 81 [2025-03-13 22:27:08,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:08,475 INFO L124 PetriNetUnfolderBase]: 19/335 cut-off events. [2025-03-13 22:27:08,478 INFO L125 PetriNetUnfolderBase]: For 53/62 co-relation queries the response was YES. [2025-03-13 22:27:08,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 433 conditions, 335 events. 19/335 cut-off events. For 53/62 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1459 event pairs, 8 based on Foata normal form. 2/299 useless extension candidates. Maximal degree in co-relation 423. Up to 37 conditions per place. [2025-03-13 22:27:08,480 INFO L140 encePairwiseOnDemand]: 76/81 looper letters, 11 selfloop transitions, 4 changer transitions 0/76 dead transitions. [2025-03-13 22:27:08,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 76 transitions, 234 flow [2025-03-13 22:27:08,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:27:08,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:27:08,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 211 transitions. [2025-03-13 22:27:08,481 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8683127572016461 [2025-03-13 22:27:08,483 INFO L175 Difference]: Start difference. First operand has 82 places, 71 transitions, 188 flow. Second operand 3 states and 211 transitions. [2025-03-13 22:27:08,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 76 transitions, 234 flow [2025-03-13 22:27:08,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 76 transitions, 228 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-13 22:27:08,484 INFO L231 Difference]: Finished difference. Result has 84 places, 74 transitions, 212 flow [2025-03-13 22:27:08,486 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=212, PETRI_PLACES=84, PETRI_TRANSITIONS=74} [2025-03-13 22:27:08,487 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, 2 predicate places. [2025-03-13 22:27:08,488 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 74 transitions, 212 flow [2025-03-13 22:27:08,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:27:08,488 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:08,488 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:27:08,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-13 22:27:08,488 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-13 22:27:08,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:08,489 INFO L85 PathProgramCache]: Analyzing trace with hash 706503823, now seen corresponding path program 1 times [2025-03-13 22:27:08,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:08,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066707114] [2025-03-13 22:27:08,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:08,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:08,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-13 22:27:08,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-13 22:27:08,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:08,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:08,578 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-13 22:27:08,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:08,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066707114] [2025-03-13 22:27:08,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066707114] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:08,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:08,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-13 22:27:08,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852118062] [2025-03-13 22:27:08,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:08,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 22:27:08,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:08,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 22:27:08,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-13 22:27:08,630 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 81 [2025-03-13 22:27:08,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 74 transitions, 212 flow. Second operand has 7 states, 7 states have (on average 62.0) internal successors, (434), 7 states have internal predecessors, (434), 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:27:08,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:08,631 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 81 [2025-03-13 22:27:08,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:08,687 INFO L124 PetriNetUnfolderBase]: 17/146 cut-off events. [2025-03-13 22:27:08,687 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-03-13 22:27:08,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 254 conditions, 146 events. 17/146 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 367 event pairs, 0 based on Foata normal form. 4/150 useless extension candidates. Maximal degree in co-relation 243. Up to 21 conditions per place. [2025-03-13 22:27:08,688 INFO L140 encePairwiseOnDemand]: 76/81 looper letters, 15 selfloop transitions, 7 changer transitions 0/53 dead transitions. [2025-03-13 22:27:08,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 53 transitions, 202 flow [2025-03-13 22:27:08,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 22:27:08,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 22:27:08,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 563 transitions. [2025-03-13 22:27:08,690 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7722908093278463 [2025-03-13 22:27:08,691 INFO L175 Difference]: Start difference. First operand has 84 places, 74 transitions, 212 flow. Second operand 9 states and 563 transitions. [2025-03-13 22:27:08,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 53 transitions, 202 flow [2025-03-13 22:27:08,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 53 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:27:08,692 INFO L231 Difference]: Finished difference. Result has 63 places, 44 transitions, 132 flow [2025-03-13 22:27:08,692 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=132, PETRI_PLACES=63, PETRI_TRANSITIONS=44} [2025-03-13 22:27:08,693 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, -19 predicate places. [2025-03-13 22:27:08,693 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 44 transitions, 132 flow [2025-03-13 22:27:08,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 62.0) internal successors, (434), 7 states have internal predecessors, (434), 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:27:08,693 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:08,693 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] [2025-03-13 22:27:08,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-13 22:27:08,693 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-13 22:27:08,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:08,694 INFO L85 PathProgramCache]: Analyzing trace with hash 933189663, now seen corresponding path program 1 times [2025-03-13 22:27:08,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:08,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967391818] [2025-03-13 22:27:08,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:08,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:08,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-13 22:27:08,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-13 22:27:08,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:08,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:27:08,713 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 22:27:08,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-13 22:27:08,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-13 22:27:08,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:08,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:27:08,732 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 22:27:08,732 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 22:27:08,732 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2025-03-13 22:27:08,732 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (6 of 8 remaining) [2025-03-13 22:27:08,732 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 8 remaining) [2025-03-13 22:27:08,732 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 8 remaining) [2025-03-13 22:27:08,733 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (3 of 8 remaining) [2025-03-13 22:27:08,733 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 8 remaining) [2025-03-13 22:27:08,733 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 8 remaining) [2025-03-13 22:27:08,733 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 8 remaining) [2025-03-13 22:27:08,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-13 22:27:08,733 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:27:08,733 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 22:27:08,734 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-13 22:27:08,744 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-13 22:27:08,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 89 transitions, 205 flow [2025-03-13 22:27:08,775 INFO L124 PetriNetUnfolderBase]: 16/316 cut-off events. [2025-03-13 22:27:08,775 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-03-13 22:27:08,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 341 conditions, 316 events. 16/316 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 864 event pairs, 1 based on Foata normal form. 0/276 useless extension candidates. Maximal degree in co-relation 201. Up to 12 conditions per place. [2025-03-13 22:27:08,776 INFO L82 GeneralOperation]: Start removeDead. Operand has 91 places, 89 transitions, 205 flow [2025-03-13 22:27:08,777 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 91 places, 89 transitions, 205 flow [2025-03-13 22:27:08,779 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:27:08,779 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;@7829f4d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:27:08,779 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-03-13 22:27:08,781 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:27:08,781 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-03-13 22:27:08,781 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:27:08,781 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:08,781 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:27:08,781 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-13 22:27:08,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:08,782 INFO L85 PathProgramCache]: Analyzing trace with hash -865490566, now seen corresponding path program 1 times [2025-03-13 22:27:08,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:08,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719253165] [2025-03-13 22:27:08,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:08,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:08,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-13 22:27:08,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-13 22:27:08,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:08,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:08,793 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:27:08,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:08,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719253165] [2025-03-13 22:27:08,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719253165] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:08,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:08,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-13 22:27:08,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566288106] [2025-03-13 22:27:08,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:08,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-13 22:27:08,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:08,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-13 22:27:08,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-13 22:27:08,794 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 89 [2025-03-13 22:27:08,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 89 transitions, 205 flow. Second operand has 2 states, 2 states have (on average 72.5) internal successors, (145), 2 states have internal predecessors, (145), 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:27:08,795 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:08,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 89 [2025-03-13 22:27:08,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:08,846 INFO L124 PetriNetUnfolderBase]: 36/492 cut-off events. [2025-03-13 22:27:08,846 INFO L125 PetriNetUnfolderBase]: For 126/181 co-relation queries the response was YES. [2025-03-13 22:27:08,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 615 conditions, 492 events. 36/492 cut-off events. For 126/181 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2155 event pairs, 27 based on Foata normal form. 9/441 useless extension candidates. Maximal degree in co-relation 303. Up to 68 conditions per place. [2025-03-13 22:27:08,849 INFO L140 encePairwiseOnDemand]: 83/89 looper letters, 10 selfloop transitions, 0 changer transitions 0/81 dead transitions. [2025-03-13 22:27:08,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 81 transitions, 209 flow [2025-03-13 22:27:08,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-13 22:27:08,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-13 22:27:08,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 160 transitions. [2025-03-13 22:27:08,851 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.898876404494382 [2025-03-13 22:27:08,851 INFO L175 Difference]: Start difference. First operand has 91 places, 89 transitions, 205 flow. Second operand 2 states and 160 transitions. [2025-03-13 22:27:08,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 81 transitions, 209 flow [2025-03-13 22:27:08,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 81 transitions, 209 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:27:08,853 INFO L231 Difference]: Finished difference. Result has 86 places, 81 transitions, 189 flow [2025-03-13 22:27:08,853 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=189, PETRI_PLACES=86, PETRI_TRANSITIONS=81} [2025-03-13 22:27:08,854 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, -5 predicate places. [2025-03-13 22:27:08,855 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 81 transitions, 189 flow [2025-03-13 22:27:08,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 72.5) internal successors, (145), 2 states have internal predecessors, (145), 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:27:08,855 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:08,855 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:27:08,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-13 22:27:08,855 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-13 22:27:08,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:08,857 INFO L85 PathProgramCache]: Analyzing trace with hash -761205717, now seen corresponding path program 1 times [2025-03-13 22:27:08,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:08,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993137980] [2025-03-13 22:27:08,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:08,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:08,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-13 22:27:08,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-13 22:27:08,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:08,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:08,877 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:27:08,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:08,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993137980] [2025-03-13 22:27:08,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993137980] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:08,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:08,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 22:27:08,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494001422] [2025-03-13 22:27:08,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:08,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:27:08,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:08,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:27:08,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:27:08,901 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 89 [2025-03-13 22:27:08,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 81 transitions, 189 flow. Second operand has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 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:27:08,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:08,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 89 [2025-03-13 22:27:08,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:09,008 INFO L124 PetriNetUnfolderBase]: 117/1051 cut-off events. [2025-03-13 22:27:09,009 INFO L125 PetriNetUnfolderBase]: For 136/136 co-relation queries the response was YES. [2025-03-13 22:27:09,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1324 conditions, 1051 events. 117/1051 cut-off events. For 136/136 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 6799 event pairs, 64 based on Foata normal form. 1/949 useless extension candidates. Maximal degree in co-relation 1318. Up to 214 conditions per place. [2025-03-13 22:27:09,014 INFO L140 encePairwiseOnDemand]: 86/89 looper letters, 15 selfloop transitions, 2 changer transitions 3/83 dead transitions. [2025-03-13 22:27:09,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 83 transitions, 229 flow [2025-03-13 22:27:09,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:27:09,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:27:09,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 217 transitions. [2025-03-13 22:27:09,017 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8127340823970037 [2025-03-13 22:27:09,017 INFO L175 Difference]: Start difference. First operand has 86 places, 81 transitions, 189 flow. Second operand 3 states and 217 transitions. [2025-03-13 22:27:09,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 83 transitions, 229 flow [2025-03-13 22:27:09,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 83 transitions, 229 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:27:09,019 INFO L231 Difference]: Finished difference. Result has 89 places, 79 transitions, 195 flow [2025-03-13 22:27:09,019 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=195, PETRI_PLACES=89, PETRI_TRANSITIONS=79} [2025-03-13 22:27:09,020 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, -2 predicate places. [2025-03-13 22:27:09,020 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 79 transitions, 195 flow [2025-03-13 22:27:09,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 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:27:09,020 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:09,021 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:27:09,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-13 22:27:09,021 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-13 22:27:09,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:09,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1204972284, now seen corresponding path program 1 times [2025-03-13 22:27:09,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:09,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468933095] [2025-03-13 22:27:09,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:09,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:09,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-13 22:27:09,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-13 22:27:09,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:09,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:09,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:27:09,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:09,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468933095] [2025-03-13 22:27:09,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468933095] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:09,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:09,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:27:09,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108947143] [2025-03-13 22:27:09,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:09,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:27:09,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:09,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:27:09,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:27:09,297 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 89 [2025-03-13 22:27:09,297 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 79 transitions, 195 flow. Second operand has 6 states, 6 states have (on average 55.666666666666664) internal successors, (334), 6 states have internal predecessors, (334), 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:27:09,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:09,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 89 [2025-03-13 22:27:09,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:09,415 INFO L124 PetriNetUnfolderBase]: 312/1108 cut-off events. [2025-03-13 22:27:09,415 INFO L125 PetriNetUnfolderBase]: For 134/134 co-relation queries the response was YES. [2025-03-13 22:27:09,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1788 conditions, 1108 events. 312/1108 cut-off events. For 134/134 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 6553 event pairs, 146 based on Foata normal form. 0/1037 useless extension candidates. Maximal degree in co-relation 1780. Up to 415 conditions per place. [2025-03-13 22:27:09,420 INFO L140 encePairwiseOnDemand]: 83/89 looper letters, 32 selfloop transitions, 6 changer transitions 2/90 dead transitions. [2025-03-13 22:27:09,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 90 transitions, 295 flow [2025-03-13 22:27:09,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:27:09,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:27:09,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 363 transitions. [2025-03-13 22:27:09,422 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6797752808988764 [2025-03-13 22:27:09,422 INFO L175 Difference]: Start difference. First operand has 89 places, 79 transitions, 195 flow. Second operand 6 states and 363 transitions. [2025-03-13 22:27:09,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 90 transitions, 295 flow [2025-03-13 22:27:09,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 90 transitions, 293 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:27:09,423 INFO L231 Difference]: Finished difference. Result has 89 places, 76 transitions, 199 flow [2025-03-13 22:27:09,424 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=199, PETRI_PLACES=89, PETRI_TRANSITIONS=76} [2025-03-13 22:27:09,425 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, -2 predicate places. [2025-03-13 22:27:09,425 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 76 transitions, 199 flow [2025-03-13 22:27:09,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 55.666666666666664) internal successors, (334), 6 states have internal predecessors, (334), 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:27:09,425 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:09,426 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] [2025-03-13 22:27:09,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-13 22:27:09,426 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-13 22:27:09,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:09,426 INFO L85 PathProgramCache]: Analyzing trace with hash 277052132, now seen corresponding path program 1 times [2025-03-13 22:27:09,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:09,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580975798] [2025-03-13 22:27:09,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:09,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:09,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-13 22:27:09,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-13 22:27:09,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:09,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:09,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:27:09,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:09,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580975798] [2025-03-13 22:27:09,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580975798] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:09,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:09,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:27:09,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357728658] [2025-03-13 22:27:09,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:09,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 22:27:09,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:09,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 22:27:09,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 22:27:09,516 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 89 [2025-03-13 22:27:09,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 76 transitions, 199 flow. Second operand has 5 states, 5 states have (on average 65.8) internal successors, (329), 5 states have internal predecessors, (329), 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:27:09,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:09,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 89 [2025-03-13 22:27:09,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:09,595 INFO L124 PetriNetUnfolderBase]: 120/883 cut-off events. [2025-03-13 22:27:09,596 INFO L125 PetriNetUnfolderBase]: For 154/154 co-relation queries the response was YES. [2025-03-13 22:27:09,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1253 conditions, 883 events. 120/883 cut-off events. For 154/154 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 5428 event pairs, 65 based on Foata normal form. 2/799 useless extension candidates. Maximal degree in co-relation 1245. Up to 193 conditions per place. [2025-03-13 22:27:09,599 INFO L140 encePairwiseOnDemand]: 84/89 looper letters, 22 selfloop transitions, 5 changer transitions 0/85 dead transitions. [2025-03-13 22:27:09,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 85 transitions, 275 flow [2025-03-13 22:27:09,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:27:09,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:27:09,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 412 transitions. [2025-03-13 22:27:09,601 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7715355805243446 [2025-03-13 22:27:09,601 INFO L175 Difference]: Start difference. First operand has 89 places, 76 transitions, 199 flow. Second operand 6 states and 412 transitions. [2025-03-13 22:27:09,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 85 transitions, 275 flow [2025-03-13 22:27:09,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 85 transitions, 261 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:27:09,604 INFO L231 Difference]: Finished difference. Result has 90 places, 79 transitions, 219 flow [2025-03-13 22:27:09,605 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=219, PETRI_PLACES=90, PETRI_TRANSITIONS=79} [2025-03-13 22:27:09,605 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, -1 predicate places. [2025-03-13 22:27:09,605 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 79 transitions, 219 flow [2025-03-13 22:27:09,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 65.8) internal successors, (329), 5 states have internal predecessors, (329), 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:27:09,605 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:09,605 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:27:09,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-13 22:27:09,605 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-13 22:27:09,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:09,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1732673212, now seen corresponding path program 1 times [2025-03-13 22:27:09,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:09,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133639039] [2025-03-13 22:27:09,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:09,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:09,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-13 22:27:09,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-13 22:27:09,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:09,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:09,639 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:27:09,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:09,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133639039] [2025-03-13 22:27:09,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133639039] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:09,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:09,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:27:09,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985839330] [2025-03-13 22:27:09,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:09,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:27:09,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:09,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:27:09,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:27:09,642 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 89 [2025-03-13 22:27:09,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 79 transitions, 219 flow. Second operand has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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:27:09,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:09,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 89 [2025-03-13 22:27:09,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:09,720 INFO L124 PetriNetUnfolderBase]: 119/1006 cut-off events. [2025-03-13 22:27:09,720 INFO L125 PetriNetUnfolderBase]: For 230/286 co-relation queries the response was YES. [2025-03-13 22:27:09,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1342 conditions, 1006 events. 119/1006 cut-off events. For 230/286 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 6874 event pairs, 42 based on Foata normal form. 5/887 useless extension candidates. Maximal degree in co-relation 1331. Up to 162 conditions per place. [2025-03-13 22:27:09,725 INFO L140 encePairwiseOnDemand]: 83/89 looper letters, 15 selfloop transitions, 5 changer transitions 0/86 dead transitions. [2025-03-13 22:27:09,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 86 transitions, 282 flow [2025-03-13 22:27:09,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:27:09,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:27:09,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 228 transitions. [2025-03-13 22:27:09,726 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8539325842696629 [2025-03-13 22:27:09,727 INFO L175 Difference]: Start difference. First operand has 90 places, 79 transitions, 219 flow. Second operand 3 states and 228 transitions. [2025-03-13 22:27:09,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 86 transitions, 282 flow [2025-03-13 22:27:09,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 86 transitions, 276 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-13 22:27:09,728 INFO L231 Difference]: Finished difference. Result has 92 places, 83 transitions, 251 flow [2025-03-13 22:27:09,728 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=251, PETRI_PLACES=92, PETRI_TRANSITIONS=83} [2025-03-13 22:27:09,729 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 1 predicate places. [2025-03-13 22:27:09,729 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 83 transitions, 251 flow [2025-03-13 22:27:09,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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:27:09,729 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:09,729 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:27:09,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-13 22:27:09,729 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-13 22:27:09,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:09,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1153219631, now seen corresponding path program 1 times [2025-03-13 22:27:09,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:09,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971587298] [2025-03-13 22:27:09,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:09,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:09,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-13 22:27:09,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-13 22:27:09,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:09,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:09,797 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:27:09,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:09,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971587298] [2025-03-13 22:27:09,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971587298] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:09,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:09,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-13 22:27:09,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562298481] [2025-03-13 22:27:09,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:09,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 22:27:09,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:09,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 22:27:09,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-13 22:27:09,850 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 89 [2025-03-13 22:27:09,851 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 83 transitions, 251 flow. Second operand has 7 states, 7 states have (on average 66.0) internal successors, (462), 7 states have internal predecessors, (462), 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:27:09,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:09,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 89 [2025-03-13 22:27:09,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:09,983 INFO L124 PetriNetUnfolderBase]: 175/1161 cut-off events. [2025-03-13 22:27:09,984 INFO L125 PetriNetUnfolderBase]: For 471/494 co-relation queries the response was YES. [2025-03-13 22:27:09,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1876 conditions, 1161 events. 175/1161 cut-off events. For 471/494 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 7484 event pairs, 38 based on Foata normal form. 4/1066 useless extension candidates. Maximal degree in co-relation 1864. Up to 218 conditions per place. [2025-03-13 22:27:09,989 INFO L140 encePairwiseOnDemand]: 84/89 looper letters, 30 selfloop transitions, 8 changer transitions 0/97 dead transitions. [2025-03-13 22:27:09,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 97 transitions, 383 flow [2025-03-13 22:27:09,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 22:27:09,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 22:27:09,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 612 transitions. [2025-03-13 22:27:09,990 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7640449438202247 [2025-03-13 22:27:09,990 INFO L175 Difference]: Start difference. First operand has 92 places, 83 transitions, 251 flow. Second operand 9 states and 612 transitions. [2025-03-13 22:27:09,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 97 transitions, 383 flow [2025-03-13 22:27:09,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 97 transitions, 373 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:27:09,992 INFO L231 Difference]: Finished difference. Result has 101 places, 85 transitions, 277 flow [2025-03-13 22:27:09,992 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=277, PETRI_PLACES=101, PETRI_TRANSITIONS=85} [2025-03-13 22:27:09,993 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 10 predicate places. [2025-03-13 22:27:09,993 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 85 transitions, 277 flow [2025-03-13 22:27:09,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 66.0) internal successors, (462), 7 states have internal predecessors, (462), 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:27:09,993 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:09,993 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:27:09,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-13 22:27:09,994 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-13 22:27:09,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:09,994 INFO L85 PathProgramCache]: Analyzing trace with hash 301700632, now seen corresponding path program 1 times [2025-03-13 22:27:09,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:09,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275789039] [2025-03-13 22:27:09,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:09,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:10,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-13 22:27:10,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-13 22:27:10,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:10,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:10,103 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 22:27:10,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:10,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275789039] [2025-03-13 22:27:10,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275789039] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:10,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:10,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-13 22:27:10,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759149898] [2025-03-13 22:27:10,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:10,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-13 22:27:10,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:10,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-13 22:27:10,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-13 22:27:10,151 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 89 [2025-03-13 22:27:10,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 85 transitions, 277 flow. Second operand has 9 states, 9 states have (on average 66.0) internal successors, (594), 9 states have internal predecessors, (594), 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:27:10,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:10,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 89 [2025-03-13 22:27:10,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:10,238 INFO L124 PetriNetUnfolderBase]: 61/318 cut-off events. [2025-03-13 22:27:10,238 INFO L125 PetriNetUnfolderBase]: For 215/215 co-relation queries the response was YES. [2025-03-13 22:27:10,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 661 conditions, 318 events. 61/318 cut-off events. For 215/215 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1254 event pairs, 0 based on Foata normal form. 8/326 useless extension candidates. Maximal degree in co-relation 646. Up to 69 conditions per place. [2025-03-13 22:27:10,240 INFO L140 encePairwiseOnDemand]: 84/89 looper letters, 26 selfloop transitions, 10 changer transitions 0/71 dead transitions. [2025-03-13 22:27:10,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 71 transitions, 328 flow [2025-03-13 22:27:10,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-13 22:27:10,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-13 22:27:10,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 805 transitions. [2025-03-13 22:27:10,241 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7537453183520599 [2025-03-13 22:27:10,242 INFO L175 Difference]: Start difference. First operand has 101 places, 85 transitions, 277 flow. Second operand 12 states and 805 transitions. [2025-03-13 22:27:10,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 71 transitions, 328 flow [2025-03-13 22:27:10,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 71 transitions, 302 flow, removed 5 selfloop flow, removed 8 redundant places. [2025-03-13 22:27:10,243 INFO L231 Difference]: Finished difference. Result has 78 places, 53 transitions, 178 flow [2025-03-13 22:27:10,243 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=178, PETRI_PLACES=78, PETRI_TRANSITIONS=53} [2025-03-13 22:27:10,244 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, -13 predicate places. [2025-03-13 22:27:10,244 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 53 transitions, 178 flow [2025-03-13 22:27:10,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 66.0) internal successors, (594), 9 states have internal predecessors, (594), 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:27:10,244 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:10,244 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:27:10,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-13 22:27:10,245 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-13 22:27:10,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:10,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1683972730, now seen corresponding path program 1 times [2025-03-13 22:27:10,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:10,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321656814] [2025-03-13 22:27:10,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:10,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:10,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-13 22:27:10,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-13 22:27:10,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:10,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:27:10,263 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 22:27:10,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-13 22:27:10,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-13 22:27:10,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:10,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:27:10,286 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 22:27:10,286 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 22:27:10,287 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2025-03-13 22:27:10,287 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2025-03-13 22:27:10,287 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2025-03-13 22:27:10,287 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2025-03-13 22:27:10,287 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2025-03-13 22:27:10,287 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2025-03-13 22:27:10,288 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2025-03-13 22:27:10,288 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2025-03-13 22:27:10,288 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2025-03-13 22:27:10,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-13 22:27:10,288 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:27:10,288 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 22:27:10,289 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-13 22:27:10,302 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-13 22:27:10,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 97 transitions, 234 flow [2025-03-13 22:27:10,330 INFO L124 PetriNetUnfolderBase]: 31/531 cut-off events. [2025-03-13 22:27:10,331 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-03-13 22:27:10,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 582 conditions, 531 events. 31/531 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1919 event pairs, 6 based on Foata normal form. 0/469 useless extension candidates. Maximal degree in co-relation 336. Up to 32 conditions per place. [2025-03-13 22:27:10,332 INFO L82 GeneralOperation]: Start removeDead. Operand has 100 places, 97 transitions, 234 flow [2025-03-13 22:27:10,333 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 100 places, 97 transitions, 234 flow [2025-03-13 22:27:10,333 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:27:10,334 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;@7829f4d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:27:10,334 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-13 22:27:10,335 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:27:10,335 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-03-13 22:27:10,335 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:27:10,335 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:10,336 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:27:10,336 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-03-13 22:27:10,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:10,336 INFO L85 PathProgramCache]: Analyzing trace with hash -429205926, now seen corresponding path program 1 times [2025-03-13 22:27:10,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:10,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195058167] [2025-03-13 22:27:10,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:10,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:10,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-13 22:27:10,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-13 22:27:10,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:10,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:10,345 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:27:10,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:10,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195058167] [2025-03-13 22:27:10,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195058167] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:10,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:10,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-13 22:27:10,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508956445] [2025-03-13 22:27:10,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:10,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-13 22:27:10,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:10,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-13 22:27:10,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-13 22:27:10,346 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 97 [2025-03-13 22:27:10,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 97 transitions, 234 flow. Second operand has 2 states, 2 states have (on average 76.5) internal successors, (153), 2 states have internal predecessors, (153), 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:27:10,347 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:10,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 97 [2025-03-13 22:27:10,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:10,454 INFO L124 PetriNetUnfolderBase]: 157/1308 cut-off events. [2025-03-13 22:27:10,455 INFO L125 PetriNetUnfolderBase]: For 498/783 co-relation queries the response was YES. [2025-03-13 22:27:10,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1735 conditions, 1308 events. 157/1308 cut-off events. For 498/783 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 8587 event pairs, 128 based on Foata normal form. 17/1160 useless extension candidates. Maximal degree in co-relation 947. Up to 250 conditions per place. [2025-03-13 22:27:10,459 INFO L140 encePairwiseOnDemand]: 90/97 looper letters, 13 selfloop transitions, 0 changer transitions 0/88 dead transitions. [2025-03-13 22:27:10,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 88 transitions, 242 flow [2025-03-13 22:27:10,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-13 22:27:10,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-13 22:27:10,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 172 transitions. [2025-03-13 22:27:10,461 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8865979381443299 [2025-03-13 22:27:10,461 INFO L175 Difference]: Start difference. First operand has 100 places, 97 transitions, 234 flow. Second operand 2 states and 172 transitions. [2025-03-13 22:27:10,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 88 transitions, 242 flow [2025-03-13 22:27:10,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 88 transitions, 242 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:27:10,462 INFO L231 Difference]: Finished difference. Result has 94 places, 88 transitions, 216 flow [2025-03-13 22:27:10,463 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=216, PETRI_PLACES=94, PETRI_TRANSITIONS=88} [2025-03-13 22:27:10,463 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -6 predicate places. [2025-03-13 22:27:10,463 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 88 transitions, 216 flow [2025-03-13 22:27:10,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 76.5) internal successors, (153), 2 states have internal predecessors, (153), 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:27:10,463 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:10,463 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:27:10,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-13 22:27:10,464 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-03-13 22:27:10,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:10,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1782399852, now seen corresponding path program 1 times [2025-03-13 22:27:10,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:10,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204448591] [2025-03-13 22:27:10,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:10,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:10,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-13 22:27:10,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-13 22:27:10,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:10,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:10,482 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:27:10,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:10,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204448591] [2025-03-13 22:27:10,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204448591] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:10,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:10,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 22:27:10,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612123971] [2025-03-13 22:27:10,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:10,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:27:10,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:10,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:27:10,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:27:10,498 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 97 [2025-03-13 22:27:10,499 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 88 transitions, 216 flow. Second operand has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 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:27:10,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:10,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 97 [2025-03-13 22:27:10,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:10,677 INFO L124 PetriNetUnfolderBase]: 422/2882 cut-off events. [2025-03-13 22:27:10,678 INFO L125 PetriNetUnfolderBase]: For 531/531 co-relation queries the response was YES. [2025-03-13 22:27:10,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3738 conditions, 2882 events. 422/2882 cut-off events. For 531/531 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 23834 event pairs, 278 based on Foata normal form. 1/2616 useless extension candidates. Maximal degree in co-relation 3731. Up to 675 conditions per place. [2025-03-13 22:27:10,691 INFO L140 encePairwiseOnDemand]: 94/97 looper letters, 18 selfloop transitions, 2 changer transitions 3/90 dead transitions. [2025-03-13 22:27:10,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 90 transitions, 262 flow [2025-03-13 22:27:10,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:27:10,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:27:10,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 232 transitions. [2025-03-13 22:27:10,692 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7972508591065293 [2025-03-13 22:27:10,692 INFO L175 Difference]: Start difference. First operand has 94 places, 88 transitions, 216 flow. Second operand 3 states and 232 transitions. [2025-03-13 22:27:10,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 90 transitions, 262 flow [2025-03-13 22:27:10,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 90 transitions, 262 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:27:10,694 INFO L231 Difference]: Finished difference. Result has 97 places, 86 transitions, 222 flow [2025-03-13 22:27:10,694 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=222, PETRI_PLACES=97, PETRI_TRANSITIONS=86} [2025-03-13 22:27:10,694 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -3 predicate places. [2025-03-13 22:27:10,694 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 86 transitions, 222 flow [2025-03-13 22:27:10,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 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:27:10,694 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:10,695 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:27:10,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-13 22:27:10,695 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-03-13 22:27:10,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:10,695 INFO L85 PathProgramCache]: Analyzing trace with hash -2106833947, now seen corresponding path program 1 times [2025-03-13 22:27:10,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:10,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860416629] [2025-03-13 22:27:10,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:10,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:10,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-13 22:27:10,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-13 22:27:10,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:10,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:10,818 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:27:10,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:10,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860416629] [2025-03-13 22:27:10,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860416629] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:10,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:10,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:27:10,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373511252] [2025-03-13 22:27:10,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:10,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:27:10,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:10,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:27:10,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:27:10,886 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 97 [2025-03-13 22:27:10,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 86 transitions, 222 flow. Second operand has 6 states, 6 states have (on average 59.666666666666664) internal successors, (358), 6 states have internal predecessors, (358), 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:27:10,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:10,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 97 [2025-03-13 22:27:10,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:11,133 INFO L124 PetriNetUnfolderBase]: 1099/3285 cut-off events. [2025-03-13 22:27:11,133 INFO L125 PetriNetUnfolderBase]: For 513/513 co-relation queries the response was YES. [2025-03-13 22:27:11,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5364 conditions, 3285 events. 1099/3285 cut-off events. For 513/513 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 24333 event pairs, 150 based on Foata normal form. 0/3063 useless extension candidates. Maximal degree in co-relation 5355. Up to 1372 conditions per place. [2025-03-13 22:27:11,148 INFO L140 encePairwiseOnDemand]: 91/97 looper letters, 39 selfloop transitions, 6 changer transitions 2/101 dead transitions. [2025-03-13 22:27:11,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 101 transitions, 344 flow [2025-03-13 22:27:11,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:27:11,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:27:11,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 394 transitions. [2025-03-13 22:27:11,149 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6769759450171822 [2025-03-13 22:27:11,149 INFO L175 Difference]: Start difference. First operand has 97 places, 86 transitions, 222 flow. Second operand 6 states and 394 transitions. [2025-03-13 22:27:11,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 101 transitions, 344 flow [2025-03-13 22:27:11,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 101 transitions, 342 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:27:11,151 INFO L231 Difference]: Finished difference. Result has 97 places, 83 transitions, 226 flow [2025-03-13 22:27:11,151 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=226, PETRI_PLACES=97, PETRI_TRANSITIONS=83} [2025-03-13 22:27:11,152 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -3 predicate places. [2025-03-13 22:27:11,152 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 83 transitions, 226 flow [2025-03-13 22:27:11,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 59.666666666666664) internal successors, (358), 6 states have internal predecessors, (358), 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:27:11,152 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:11,152 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] [2025-03-13 22:27:11,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-13 22:27:11,152 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-03-13 22:27:11,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:11,153 INFO L85 PathProgramCache]: Analyzing trace with hash 305776255, now seen corresponding path program 1 times [2025-03-13 22:27:11,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:11,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522448108] [2025-03-13 22:27:11,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:11,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:11,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-13 22:27:11,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-13 22:27:11,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:11,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:11,188 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:27:11,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:11,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522448108] [2025-03-13 22:27:11,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522448108] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:11,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:11,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:27:11,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603200061] [2025-03-13 22:27:11,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:11,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 22:27:11,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:11,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 22:27:11,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 22:27:11,226 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 97 [2025-03-13 22:27:11,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 83 transitions, 226 flow. Second operand has 5 states, 5 states have (on average 69.8) internal successors, (349), 5 states have internal predecessors, (349), 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:27:11,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:11,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 97 [2025-03-13 22:27:11,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:11,398 INFO L124 PetriNetUnfolderBase]: 408/2431 cut-off events. [2025-03-13 22:27:11,399 INFO L125 PetriNetUnfolderBase]: For 561/561 co-relation queries the response was YES. [2025-03-13 22:27:11,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3465 conditions, 2431 events. 408/2431 cut-off events. For 561/561 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 19031 event pairs, 167 based on Foata normal form. 2/2189 useless extension candidates. Maximal degree in co-relation 3456. Up to 615 conditions per place. [2025-03-13 22:27:11,407 INFO L140 encePairwiseOnDemand]: 92/97 looper letters, 25 selfloop transitions, 5 changer transitions 0/92 dead transitions. [2025-03-13 22:27:11,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 92 transitions, 308 flow [2025-03-13 22:27:11,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:27:11,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:27:11,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 439 transitions. [2025-03-13 22:27:11,409 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7542955326460481 [2025-03-13 22:27:11,409 INFO L175 Difference]: Start difference. First operand has 97 places, 83 transitions, 226 flow. Second operand 6 states and 439 transitions. [2025-03-13 22:27:11,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 92 transitions, 308 flow [2025-03-13 22:27:11,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 92 transitions, 294 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:27:11,411 INFO L231 Difference]: Finished difference. Result has 98 places, 86 transitions, 246 flow [2025-03-13 22:27:11,411 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=246, PETRI_PLACES=98, PETRI_TRANSITIONS=86} [2025-03-13 22:27:11,411 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -2 predicate places. [2025-03-13 22:27:11,411 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 86 transitions, 246 flow [2025-03-13 22:27:11,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 69.8) internal successors, (349), 5 states have internal predecessors, (349), 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:27:11,412 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:11,412 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:27:11,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-13 22:27:11,412 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-03-13 22:27:11,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:11,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1807685937, now seen corresponding path program 1 times [2025-03-13 22:27:11,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:11,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334497233] [2025-03-13 22:27:11,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:11,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:11,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-13 22:27:11,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-13 22:27:11,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:11,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:11,432 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:27:11,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:11,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334497233] [2025-03-13 22:27:11,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334497233] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:11,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:11,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:27:11,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5639887] [2025-03-13 22:27:11,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:11,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:27:11,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:11,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:27:11,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:27:11,435 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 97 [2025-03-13 22:27:11,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 86 transitions, 246 flow. Second operand has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:27:11,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:11,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 97 [2025-03-13 22:27:11,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:11,618 INFO L124 PetriNetUnfolderBase]: 488/2976 cut-off events. [2025-03-13 22:27:11,618 INFO L125 PetriNetUnfolderBase]: For 886/1127 co-relation queries the response was YES. [2025-03-13 22:27:11,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4079 conditions, 2976 events. 488/2976 cut-off events. For 886/1127 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 25732 event pairs, 185 based on Foata normal form. 9/2617 useless extension candidates. Maximal degree in co-relation 4067. Up to 580 conditions per place. [2025-03-13 22:27:11,640 INFO L140 encePairwiseOnDemand]: 90/97 looper letters, 19 selfloop transitions, 6 changer transitions 0/95 dead transitions. [2025-03-13 22:27:11,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 95 transitions, 326 flow [2025-03-13 22:27:11,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:27:11,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:27:11,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 245 transitions. [2025-03-13 22:27:11,641 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8419243986254296 [2025-03-13 22:27:11,641 INFO L175 Difference]: Start difference. First operand has 98 places, 86 transitions, 246 flow. Second operand 3 states and 245 transitions. [2025-03-13 22:27:11,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 95 transitions, 326 flow [2025-03-13 22:27:11,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 95 transitions, 320 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-13 22:27:11,645 INFO L231 Difference]: Finished difference. Result has 100 places, 91 transitions, 286 flow [2025-03-13 22:27:11,645 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=286, PETRI_PLACES=100, PETRI_TRANSITIONS=91} [2025-03-13 22:27:11,645 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 0 predicate places. [2025-03-13 22:27:11,646 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 91 transitions, 286 flow [2025-03-13 22:27:11,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:27:11,646 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:11,646 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:27:11,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-13 22:27:11,646 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-03-13 22:27:11,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:11,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1820739487, now seen corresponding path program 1 times [2025-03-13 22:27:11,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:11,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661070450] [2025-03-13 22:27:11,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:11,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:11,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-13 22:27:11,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-13 22:27:11,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:11,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:11,716 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:27:11,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:11,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661070450] [2025-03-13 22:27:11,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661070450] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:11,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:11,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-13 22:27:11,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122439634] [2025-03-13 22:27:11,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:11,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 22:27:11,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:11,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 22:27:11,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-13 22:27:11,757 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 97 [2025-03-13 22:27:11,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 91 transitions, 286 flow. Second operand has 7 states, 7 states have (on average 70.0) internal successors, (490), 7 states have internal predecessors, (490), 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:27:11,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:11,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 97 [2025-03-13 22:27:11,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:12,007 INFO L124 PetriNetUnfolderBase]: 704/3434 cut-off events. [2025-03-13 22:27:12,008 INFO L125 PetriNetUnfolderBase]: For 1807/1906 co-relation queries the response was YES. [2025-03-13 22:27:12,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5864 conditions, 3434 events. 704/3434 cut-off events. For 1807/1906 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 29815 event pairs, 204 based on Foata normal form. 4/3127 useless extension candidates. Maximal degree in co-relation 5851. Up to 942 conditions per place. [2025-03-13 22:27:12,023 INFO L140 encePairwiseOnDemand]: 92/97 looper letters, 36 selfloop transitions, 8 changer transitions 0/107 dead transitions. [2025-03-13 22:27:12,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 107 transitions, 440 flow [2025-03-13 22:27:12,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 22:27:12,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 22:27:12,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 653 transitions. [2025-03-13 22:27:12,025 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7479954180985109 [2025-03-13 22:27:12,025 INFO L175 Difference]: Start difference. First operand has 100 places, 91 transitions, 286 flow. Second operand 9 states and 653 transitions. [2025-03-13 22:27:12,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 107 transitions, 440 flow [2025-03-13 22:27:12,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 107 transitions, 428 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:27:12,028 INFO L231 Difference]: Finished difference. Result has 109 places, 94 transitions, 318 flow [2025-03-13 22:27:12,028 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=318, PETRI_PLACES=109, PETRI_TRANSITIONS=94} [2025-03-13 22:27:12,029 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 9 predicate places. [2025-03-13 22:27:12,029 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 94 transitions, 318 flow [2025-03-13 22:27:12,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 70.0) internal successors, (490), 7 states have internal predecessors, (490), 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:27:12,029 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:12,029 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:27:12,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-13 22:27:12,029 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-03-13 22:27:12,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:12,030 INFO L85 PathProgramCache]: Analyzing trace with hash -982004368, now seen corresponding path program 1 times [2025-03-13 22:27:12,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:12,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112696596] [2025-03-13 22:27:12,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:12,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:12,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-13 22:27:12,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-13 22:27:12,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:12,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:12,112 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:27:12,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:12,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112696596] [2025-03-13 22:27:12,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112696596] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:12,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:12,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-13 22:27:12,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082260650] [2025-03-13 22:27:12,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:12,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-13 22:27:12,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:12,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-13 22:27:12,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-13 22:27:12,158 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 97 [2025-03-13 22:27:12,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 94 transitions, 318 flow. Second operand has 9 states, 9 states have (on average 70.0) internal successors, (630), 9 states have internal predecessors, (630), 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:27:12,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:12,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 97 [2025-03-13 22:27:12,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:12,454 INFO L124 PetriNetUnfolderBase]: 616/3345 cut-off events. [2025-03-13 22:27:12,455 INFO L125 PetriNetUnfolderBase]: For 1632/1708 co-relation queries the response was YES. [2025-03-13 22:27:12,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5455 conditions, 3345 events. 616/3345 cut-off events. For 1632/1708 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 28226 event pairs, 119 based on Foata normal form. 8/3038 useless extension candidates. Maximal degree in co-relation 5439. Up to 711 conditions per place. [2025-03-13 22:27:12,467 INFO L140 encePairwiseOnDemand]: 92/97 looper letters, 44 selfloop transitions, 11 changer transitions 0/118 dead transitions. [2025-03-13 22:27:12,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 118 transitions, 528 flow [2025-03-13 22:27:12,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-13 22:27:12,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-13 22:27:12,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 868 transitions. [2025-03-13 22:27:12,470 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7457044673539519 [2025-03-13 22:27:12,470 INFO L175 Difference]: Start difference. First operand has 109 places, 94 transitions, 318 flow. Second operand 12 states and 868 transitions. [2025-03-13 22:27:12,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 118 transitions, 528 flow [2025-03-13 22:27:12,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 118 transitions, 510 flow, removed 4 selfloop flow, removed 5 redundant places. [2025-03-13 22:27:12,474 INFO L231 Difference]: Finished difference. Result has 118 places, 96 transitions, 346 flow [2025-03-13 22:27:12,474 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=346, PETRI_PLACES=118, PETRI_TRANSITIONS=96} [2025-03-13 22:27:12,475 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 18 predicate places. [2025-03-13 22:27:12,475 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 96 transitions, 346 flow [2025-03-13 22:27:12,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 70.0) internal successors, (630), 9 states have internal predecessors, (630), 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:27:12,475 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:12,475 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:27:12,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-13 22:27:12,476 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-03-13 22:27:12,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:12,476 INFO L85 PathProgramCache]: Analyzing trace with hash -899112098, now seen corresponding path program 1 times [2025-03-13 22:27:12,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:12,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293368841] [2025-03-13 22:27:12,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:12,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:12,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-13 22:27:12,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-13 22:27:12,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:12,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:12,599 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:27:12,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:12,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293368841] [2025-03-13 22:27:12,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293368841] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:12,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:12,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-13 22:27:12,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912424992] [2025-03-13 22:27:12,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:12,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-13 22:27:12,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:12,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-13 22:27:12,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-13 22:27:12,656 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 97 [2025-03-13 22:27:12,656 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 96 transitions, 346 flow. Second operand has 11 states, 11 states have (on average 70.0) internal successors, (770), 11 states have internal predecessors, (770), 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:27:12,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:12,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 97 [2025-03-13 22:27:12,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:12,792 INFO L124 PetriNetUnfolderBase]: 181/716 cut-off events. [2025-03-13 22:27:12,793 INFO L125 PetriNetUnfolderBase]: For 820/820 co-relation queries the response was YES. [2025-03-13 22:27:12,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1611 conditions, 716 events. 181/716 cut-off events. For 820/820 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3727 event pairs, 0 based on Foata normal form. 16/732 useless extension candidates. Maximal degree in co-relation 1592. Up to 197 conditions per place. [2025-03-13 22:27:12,799 INFO L140 encePairwiseOnDemand]: 92/97 looper letters, 40 selfloop transitions, 13 changer transitions 0/92 dead transitions. [2025-03-13 22:27:12,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 92 transitions, 468 flow [2025-03-13 22:27:12,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-13 22:27:12,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-13 22:27:12,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1074 transitions. [2025-03-13 22:27:12,802 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7381443298969073 [2025-03-13 22:27:12,802 INFO L175 Difference]: Start difference. First operand has 118 places, 96 transitions, 346 flow. Second operand 15 states and 1074 transitions. [2025-03-13 22:27:12,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 92 transitions, 468 flow [2025-03-13 22:27:12,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 92 transitions, 424 flow, removed 10 selfloop flow, removed 12 redundant places. [2025-03-13 22:27:12,805 INFO L231 Difference]: Finished difference. Result has 94 places, 62 transitions, 224 flow [2025-03-13 22:27:12,805 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=224, PETRI_PLACES=94, PETRI_TRANSITIONS=62} [2025-03-13 22:27:12,806 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -6 predicate places. [2025-03-13 22:27:12,806 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 62 transitions, 224 flow [2025-03-13 22:27:12,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 70.0) internal successors, (770), 11 states have internal predecessors, (770), 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:27:12,806 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:12,806 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:27:12,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-13 22:27:12,807 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-03-13 22:27:12,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:12,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1826313890, now seen corresponding path program 1 times [2025-03-13 22:27:12,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:12,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851175750] [2025-03-13 22:27:12,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:12,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:12,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-13 22:27:12,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-13 22:27:12,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:12,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:27:12,825 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 22:27:12,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-13 22:27:12,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-13 22:27:12,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:12,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:27:12,843 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 22:27:12,844 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 22:27:12,844 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-03-13 22:27:12,844 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2025-03-13 22:27:12,844 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2025-03-13 22:27:12,844 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2025-03-13 22:27:12,844 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2025-03-13 22:27:12,844 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2025-03-13 22:27:12,844 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2025-03-13 22:27:12,845 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2025-03-13 22:27:12,845 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2025-03-13 22:27:12,845 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2025-03-13 22:27:12,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-13 22:27:12,845 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:27:12,845 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 22:27:12,845 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-03-13 22:27:12,862 INFO L143 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2025-03-13 22:27:12,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 105 transitions, 265 flow [2025-03-13 22:27:12,919 INFO L124 PetriNetUnfolderBase]: 66/934 cut-off events. [2025-03-13 22:27:12,919 INFO L125 PetriNetUnfolderBase]: For 110/110 co-relation queries the response was YES. [2025-03-13 22:27:12,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1040 conditions, 934 events. 66/934 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 4457 event pairs, 23 based on Foata normal form. 0/834 useless extension candidates. Maximal degree in co-relation 576. Up to 80 conditions per place. [2025-03-13 22:27:12,921 INFO L82 GeneralOperation]: Start removeDead. Operand has 109 places, 105 transitions, 265 flow [2025-03-13 22:27:12,923 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 109 places, 105 transitions, 265 flow [2025-03-13 22:27:12,924 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:27:12,924 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;@7829f4d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:27:12,924 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-03-13 22:27:12,925 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:27:12,926 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-03-13 22:27:12,926 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:27:12,926 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:12,926 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:27:12,926 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-13 22:27:12,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:12,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1595225542, now seen corresponding path program 1 times [2025-03-13 22:27:12,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:12,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932121180] [2025-03-13 22:27:12,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:12,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:12,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-13 22:27:12,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-13 22:27:12,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:12,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:12,934 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:27:12,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:12,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932121180] [2025-03-13 22:27:12,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932121180] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:12,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:12,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-13 22:27:12,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699161476] [2025-03-13 22:27:12,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:12,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-13 22:27:12,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:12,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-13 22:27:12,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-13 22:27:12,936 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 105 [2025-03-13 22:27:12,936 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 105 transitions, 265 flow. Second operand has 2 states, 2 states have (on average 80.5) internal successors, (161), 2 states have internal predecessors, (161), 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:27:12,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:12,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 105 [2025-03-13 22:27:12,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:13,197 INFO L124 PetriNetUnfolderBase]: 622/3788 cut-off events. [2025-03-13 22:27:13,197 INFO L125 PetriNetUnfolderBase]: For 1651/2957 co-relation queries the response was YES. [2025-03-13 22:27:13,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5251 conditions, 3788 events. 622/3788 cut-off events. For 1651/2957 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 33627 event pairs, 527 based on Foata normal form. 41/3338 useless extension candidates. Maximal degree in co-relation 3055. Up to 892 conditions per place. [2025-03-13 22:27:13,214 INFO L140 encePairwiseOnDemand]: 97/105 looper letters, 16 selfloop transitions, 0 changer transitions 0/95 dead transitions. [2025-03-13 22:27:13,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 95 transitions, 277 flow [2025-03-13 22:27:13,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-13 22:27:13,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-13 22:27:13,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 184 transitions. [2025-03-13 22:27:13,215 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8761904761904762 [2025-03-13 22:27:13,215 INFO L175 Difference]: Start difference. First operand has 109 places, 105 transitions, 265 flow. Second operand 2 states and 184 transitions. [2025-03-13 22:27:13,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 95 transitions, 277 flow [2025-03-13 22:27:13,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 95 transitions, 277 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:27:13,218 INFO L231 Difference]: Finished difference. Result has 102 places, 95 transitions, 245 flow [2025-03-13 22:27:13,218 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=245, PETRI_PLACES=102, PETRI_TRANSITIONS=95} [2025-03-13 22:27:13,219 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, -7 predicate places. [2025-03-13 22:27:13,219 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 95 transitions, 245 flow [2025-03-13 22:27:13,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 80.5) internal successors, (161), 2 states have internal predecessors, (161), 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:27:13,219 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:13,219 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:27:13,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-13 22:27:13,219 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-13 22:27:13,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:13,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1795968587, now seen corresponding path program 1 times [2025-03-13 22:27:13,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:13,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710221466] [2025-03-13 22:27:13,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:13,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:13,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-13 22:27:13,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-13 22:27:13,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:13,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:13,231 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:27:13,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:13,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710221466] [2025-03-13 22:27:13,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710221466] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:13,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:13,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 22:27:13,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438032977] [2025-03-13 22:27:13,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:13,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:27:13,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:13,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:27:13,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:27:13,246 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 105 [2025-03-13 22:27:13,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 95 transitions, 245 flow. Second operand has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 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:27:13,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:13,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 105 [2025-03-13 22:27:13,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:13,756 INFO L124 PetriNetUnfolderBase]: 1439/8085 cut-off events. [2025-03-13 22:27:13,757 INFO L125 PetriNetUnfolderBase]: For 1886/1886 co-relation queries the response was YES. [2025-03-13 22:27:13,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10772 conditions, 8085 events. 1439/8085 cut-off events. For 1886/1886 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 81631 event pairs, 1050 based on Foata normal form. 1/7383 useless extension candidates. Maximal degree in co-relation 10764. Up to 2112 conditions per place. [2025-03-13 22:27:13,790 INFO L140 encePairwiseOnDemand]: 102/105 looper letters, 21 selfloop transitions, 2 changer transitions 3/97 dead transitions. [2025-03-13 22:27:13,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 97 transitions, 297 flow [2025-03-13 22:27:13,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:27:13,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:27:13,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 247 transitions. [2025-03-13 22:27:13,791 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7841269841269841 [2025-03-13 22:27:13,791 INFO L175 Difference]: Start difference. First operand has 102 places, 95 transitions, 245 flow. Second operand 3 states and 247 transitions. [2025-03-13 22:27:13,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 97 transitions, 297 flow [2025-03-13 22:27:13,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 97 transitions, 297 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:27:13,794 INFO L231 Difference]: Finished difference. Result has 105 places, 93 transitions, 251 flow [2025-03-13 22:27:13,794 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=251, PETRI_PLACES=105, PETRI_TRANSITIONS=93} [2025-03-13 22:27:13,794 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, -4 predicate places. [2025-03-13 22:27:13,794 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 93 transitions, 251 flow [2025-03-13 22:27:13,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 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:27:13,796 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:13,796 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:27:13,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-13 22:27:13,796 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-13 22:27:13,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:13,796 INFO L85 PathProgramCache]: Analyzing trace with hash 149219022, now seen corresponding path program 1 times [2025-03-13 22:27:13,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:13,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931684563] [2025-03-13 22:27:13,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:13,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:13,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-13 22:27:13,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-13 22:27:13,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:13,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:13,914 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:27:13,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:13,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931684563] [2025-03-13 22:27:13,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931684563] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:13,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:13,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:27:13,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236720890] [2025-03-13 22:27:13,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:13,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:27:13,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:13,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:27:13,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:27:13,978 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 105 [2025-03-13 22:27:13,978 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 93 transitions, 251 flow. Second operand has 6 states, 6 states have (on average 63.666666666666664) internal successors, (382), 6 states have internal predecessors, (382), 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:27:13,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:13,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 105 [2025-03-13 22:27:13,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:14,595 INFO L124 PetriNetUnfolderBase]: 3704/9558 cut-off events. [2025-03-13 22:27:14,595 INFO L125 PetriNetUnfolderBase]: For 1820/1820 co-relation queries the response was YES. [2025-03-13 22:27:14,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15928 conditions, 9558 events. 3704/9558 cut-off events. For 1820/1820 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 81065 event pairs, 460 based on Foata normal form. 0/8948 useless extension candidates. Maximal degree in co-relation 15918. Up to 4549 conditions per place. [2025-03-13 22:27:14,650 INFO L140 encePairwiseOnDemand]: 99/105 looper letters, 46 selfloop transitions, 6 changer transitions 2/112 dead transitions. [2025-03-13 22:27:14,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 112 transitions, 395 flow [2025-03-13 22:27:14,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:27:14,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:27:14,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 425 transitions. [2025-03-13 22:27:14,652 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6746031746031746 [2025-03-13 22:27:14,652 INFO L175 Difference]: Start difference. First operand has 105 places, 93 transitions, 251 flow. Second operand 6 states and 425 transitions. [2025-03-13 22:27:14,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 112 transitions, 395 flow [2025-03-13 22:27:14,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 112 transitions, 393 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:27:14,654 INFO L231 Difference]: Finished difference. Result has 105 places, 90 transitions, 255 flow [2025-03-13 22:27:14,655 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=255, PETRI_PLACES=105, PETRI_TRANSITIONS=90} [2025-03-13 22:27:14,655 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, -4 predicate places. [2025-03-13 22:27:14,655 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 90 transitions, 255 flow [2025-03-13 22:27:14,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 63.666666666666664) internal successors, (382), 6 states have internal predecessors, (382), 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:27:14,656 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:14,656 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] [2025-03-13 22:27:14,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-13 22:27:14,656 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-13 22:27:14,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:14,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1466958370, now seen corresponding path program 1 times [2025-03-13 22:27:14,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:14,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107021015] [2025-03-13 22:27:14,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:14,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:14,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-13 22:27:14,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-13 22:27:14,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:14,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:14,705 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:27:14,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:14,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107021015] [2025-03-13 22:27:14,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107021015] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:14,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:14,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:27:14,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382987113] [2025-03-13 22:27:14,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:14,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 22:27:14,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:14,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 22:27:14,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 22:27:14,738 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 105 [2025-03-13 22:27:14,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 90 transitions, 255 flow. Second operand has 5 states, 5 states have (on average 73.8) internal successors, (369), 5 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:27:14,739 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:14,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 105 [2025-03-13 22:27:14,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:15,180 INFO L124 PetriNetUnfolderBase]: 1288/6671 cut-off events. [2025-03-13 22:27:15,180 INFO L125 PetriNetUnfolderBase]: For 1950/1950 co-relation queries the response was YES. [2025-03-13 22:27:15,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9525 conditions, 6671 events. 1288/6671 cut-off events. For 1950/1950 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 63414 event pairs, 682 based on Foata normal form. 2/6013 useless extension candidates. Maximal degree in co-relation 9515. Up to 1817 conditions per place. [2025-03-13 22:27:15,217 INFO L140 encePairwiseOnDemand]: 100/105 looper letters, 28 selfloop transitions, 5 changer transitions 0/99 dead transitions. [2025-03-13 22:27:15,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 99 transitions, 343 flow [2025-03-13 22:27:15,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:27:15,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:27:15,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 466 transitions. [2025-03-13 22:27:15,218 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7396825396825397 [2025-03-13 22:27:15,218 INFO L175 Difference]: Start difference. First operand has 105 places, 90 transitions, 255 flow. Second operand 6 states and 466 transitions. [2025-03-13 22:27:15,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 99 transitions, 343 flow [2025-03-13 22:27:15,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 99 transitions, 329 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:27:15,223 INFO L231 Difference]: Finished difference. Result has 106 places, 93 transitions, 275 flow [2025-03-13 22:27:15,223 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=275, PETRI_PLACES=106, PETRI_TRANSITIONS=93} [2025-03-13 22:27:15,224 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, -3 predicate places. [2025-03-13 22:27:15,224 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 93 transitions, 275 flow [2025-03-13 22:27:15,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 73.8) internal successors, (369), 5 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:27:15,224 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:15,224 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:27:15,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-13 22:27:15,224 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-13 22:27:15,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:15,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1282260142, now seen corresponding path program 1 times [2025-03-13 22:27:15,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:15,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121356888] [2025-03-13 22:27:15,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:15,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:15,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-13 22:27:15,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-13 22:27:15,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:15,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:15,247 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:27:15,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:15,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121356888] [2025-03-13 22:27:15,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121356888] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:15,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:15,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:27:15,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716622909] [2025-03-13 22:27:15,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:15,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:27:15,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:15,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:27:15,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:27:15,251 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 105 [2025-03-13 22:27:15,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 93 transitions, 275 flow. Second operand has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:27:15,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:15,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 105 [2025-03-13 22:27:15,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:15,916 INFO L124 PetriNetUnfolderBase]: 1754/8829 cut-off events. [2025-03-13 22:27:15,916 INFO L125 PetriNetUnfolderBase]: For 3134/3973 co-relation queries the response was YES. [2025-03-13 22:27:15,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12392 conditions, 8829 events. 1754/8829 cut-off events. For 3134/3973 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 92476 event pairs, 727 based on Foata normal form. 14/7777 useless extension candidates. Maximal degree in co-relation 12379. Up to 1919 conditions per place. [2025-03-13 22:27:15,954 INFO L140 encePairwiseOnDemand]: 97/105 looper letters, 23 selfloop transitions, 7 changer transitions 0/104 dead transitions. [2025-03-13 22:27:15,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 104 transitions, 372 flow [2025-03-13 22:27:15,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:27:15,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:27:15,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 262 transitions. [2025-03-13 22:27:15,956 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8317460317460318 [2025-03-13 22:27:15,956 INFO L175 Difference]: Start difference. First operand has 106 places, 93 transitions, 275 flow. Second operand 3 states and 262 transitions. [2025-03-13 22:27:15,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 104 transitions, 372 flow [2025-03-13 22:27:15,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 104 transitions, 366 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-13 22:27:15,960 INFO L231 Difference]: Finished difference. Result has 108 places, 99 transitions, 323 flow [2025-03-13 22:27:15,960 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=323, PETRI_PLACES=108, PETRI_TRANSITIONS=99} [2025-03-13 22:27:15,960 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, -1 predicate places. [2025-03-13 22:27:15,960 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 99 transitions, 323 flow [2025-03-13 22:27:15,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:27:15,961 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:15,961 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:27:15,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-13 22:27:15,961 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-13 22:27:15,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:15,961 INFO L85 PathProgramCache]: Analyzing trace with hash 375115155, now seen corresponding path program 1 times [2025-03-13 22:27:15,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:15,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827690775] [2025-03-13 22:27:15,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:15,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:15,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-13 22:27:15,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-13 22:27:15,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:15,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:16,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:27:16,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:16,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827690775] [2025-03-13 22:27:16,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827690775] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:16,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:16,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-13 22:27:16,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359346477] [2025-03-13 22:27:16,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:16,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 22:27:16,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:16,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 22:27:16,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-13 22:27:16,043 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 105 [2025-03-13 22:27:16,044 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 99 transitions, 323 flow. Second operand has 7 states, 7 states have (on average 74.0) internal successors, (518), 7 states have internal predecessors, (518), 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:27:16,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:16,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 105 [2025-03-13 22:27:16,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:16,761 INFO L124 PetriNetUnfolderBase]: 2370/9833 cut-off events. [2025-03-13 22:27:16,761 INFO L125 PetriNetUnfolderBase]: For 6093/6429 co-relation queries the response was YES. [2025-03-13 22:27:16,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17304 conditions, 9833 events. 2370/9833 cut-off events. For 6093/6429 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 99796 event pairs, 612 based on Foata normal form. 4/8888 useless extension candidates. Maximal degree in co-relation 17290. Up to 3107 conditions per place. [2025-03-13 22:27:16,794 INFO L140 encePairwiseOnDemand]: 100/105 looper letters, 40 selfloop transitions, 8 changer transitions 0/115 dead transitions. [2025-03-13 22:27:16,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 115 transitions, 485 flow [2025-03-13 22:27:16,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 22:27:16,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 22:27:16,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 692 transitions. [2025-03-13 22:27:16,796 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7322751322751323 [2025-03-13 22:27:16,796 INFO L175 Difference]: Start difference. First operand has 108 places, 99 transitions, 323 flow. Second operand 9 states and 692 transitions. [2025-03-13 22:27:16,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 115 transitions, 485 flow [2025-03-13 22:27:16,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 115 transitions, 471 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:27:16,802 INFO L231 Difference]: Finished difference. Result has 117 places, 102 transitions, 353 flow [2025-03-13 22:27:16,802 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=353, PETRI_PLACES=117, PETRI_TRANSITIONS=102} [2025-03-13 22:27:16,802 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, 8 predicate places. [2025-03-13 22:27:16,802 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 102 transitions, 353 flow [2025-03-13 22:27:16,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 74.0) internal successors, (518), 7 states have internal predecessors, (518), 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:27:16,803 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:16,803 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:27:16,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-13 22:27:16,803 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-13 22:27:16,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:16,803 INFO L85 PathProgramCache]: Analyzing trace with hash 771075912, now seen corresponding path program 1 times [2025-03-13 22:27:16,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:16,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399557397] [2025-03-13 22:27:16,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:16,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:16,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-13 22:27:16,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-13 22:27:16,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:16,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:16,875 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:27:16,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:16,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399557397] [2025-03-13 22:27:16,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399557397] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:16,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:16,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-13 22:27:16,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785764710] [2025-03-13 22:27:16,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:16,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-13 22:27:16,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:16,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-13 22:27:16,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-13 22:27:16,916 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 105 [2025-03-13 22:27:16,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 102 transitions, 353 flow. Second operand has 9 states, 9 states have (on average 74.0) internal successors, (666), 9 states have internal predecessors, (666), 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:27:16,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:16,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 105 [2025-03-13 22:27:16,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:17,646 INFO L124 PetriNetUnfolderBase]: 2282/9728 cut-off events. [2025-03-13 22:27:17,647 INFO L125 PetriNetUnfolderBase]: For 5449/5762 co-relation queries the response was YES. [2025-03-13 22:27:17,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16535 conditions, 9728 events. 2282/9728 cut-off events. For 5449/5762 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 100591 event pairs, 461 based on Foata normal form. 8/8764 useless extension candidates. Maximal degree in co-relation 16518. Up to 2876 conditions per place. [2025-03-13 22:27:17,682 INFO L140 encePairwiseOnDemand]: 100/105 looper letters, 50 selfloop transitions, 11 changer transitions 0/128 dead transitions. [2025-03-13 22:27:17,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 128 transitions, 589 flow [2025-03-13 22:27:17,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-13 22:27:17,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-13 22:27:17,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 921 transitions. [2025-03-13 22:27:17,684 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7309523809523809 [2025-03-13 22:27:17,684 INFO L175 Difference]: Start difference. First operand has 117 places, 102 transitions, 353 flow. Second operand 12 states and 921 transitions. [2025-03-13 22:27:17,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 128 transitions, 589 flow [2025-03-13 22:27:17,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 128 transitions, 571 flow, removed 4 selfloop flow, removed 5 redundant places. [2025-03-13 22:27:17,687 INFO L231 Difference]: Finished difference. Result has 126 places, 105 transitions, 391 flow [2025-03-13 22:27:17,687 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=335, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=391, PETRI_PLACES=126, PETRI_TRANSITIONS=105} [2025-03-13 22:27:17,688 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, 17 predicate places. [2025-03-13 22:27:17,688 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 105 transitions, 391 flow [2025-03-13 22:27:17,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 74.0) internal successors, (666), 9 states have internal predecessors, (666), 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:27:17,688 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:17,688 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:27:17,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-13 22:27:17,688 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-13 22:27:17,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:17,689 INFO L85 PathProgramCache]: Analyzing trace with hash 2067309310, now seen corresponding path program 1 times [2025-03-13 22:27:17,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:17,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084464053] [2025-03-13 22:27:17,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:17,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:17,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-13 22:27:17,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-13 22:27:17,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:17,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:17,783 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:27:17,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:17,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084464053] [2025-03-13 22:27:17,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084464053] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:17,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:17,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-13 22:27:17,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841514191] [2025-03-13 22:27:17,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:17,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-13 22:27:17,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:17,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-13 22:27:17,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-13 22:27:17,850 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 105 [2025-03-13 22:27:17,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 105 transitions, 391 flow. Second operand has 11 states, 11 states have (on average 74.0) internal successors, (814), 11 states have internal predecessors, (814), 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:27:17,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:17,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 105 [2025-03-13 22:27:17,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:18,537 INFO L124 PetriNetUnfolderBase]: 2037/9565 cut-off events. [2025-03-13 22:27:18,537 INFO L125 PetriNetUnfolderBase]: For 5644/5881 co-relation queries the response was YES. [2025-03-13 22:27:18,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15957 conditions, 9565 events. 2037/9565 cut-off events. For 5644/5881 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 98993 event pairs, 494 based on Foata normal form. 16/8632 useless extension candidates. Maximal degree in co-relation 15937. Up to 2296 conditions per place. [2025-03-13 22:27:18,579 INFO L140 encePairwiseOnDemand]: 100/105 looper letters, 61 selfloop transitions, 14 changer transitions 0/142 dead transitions. [2025-03-13 22:27:18,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 142 transitions, 697 flow [2025-03-13 22:27:18,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-13 22:27:18,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-13 22:27:18,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1151 transitions. [2025-03-13 22:27:18,580 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7307936507936508 [2025-03-13 22:27:18,580 INFO L175 Difference]: Start difference. First operand has 126 places, 105 transitions, 391 flow. Second operand 15 states and 1151 transitions. [2025-03-13 22:27:18,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 142 transitions, 697 flow [2025-03-13 22:27:18,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 142 transitions, 667 flow, removed 7 selfloop flow, removed 8 redundant places. [2025-03-13 22:27:18,584 INFO L231 Difference]: Finished difference. Result has 135 places, 107 transitions, 417 flow [2025-03-13 22:27:18,585 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=361, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=417, PETRI_PLACES=135, PETRI_TRANSITIONS=107} [2025-03-13 22:27:18,585 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, 26 predicate places. [2025-03-13 22:27:18,585 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 107 transitions, 417 flow [2025-03-13 22:27:18,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 74.0) internal successors, (814), 11 states have internal predecessors, (814), 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:27:18,585 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:18,586 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 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:27:18,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-13 22:27:18,586 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-13 22:27:18,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:18,586 INFO L85 PathProgramCache]: Analyzing trace with hash 699962101, now seen corresponding path program 1 times [2025-03-13 22:27:18,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:18,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043892205] [2025-03-13 22:27:18,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:18,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:18,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-13 22:27:18,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-13 22:27:18,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:18,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:18,726 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:27:18,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:18,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043892205] [2025-03-13 22:27:18,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043892205] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:18,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:18,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-13 22:27:18,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722614964] [2025-03-13 22:27:18,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:18,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-13 22:27:18,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:18,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-13 22:27:18,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-03-13 22:27:18,802 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 105 [2025-03-13 22:27:18,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 107 transitions, 417 flow. Second operand has 13 states, 13 states have (on average 74.0) internal successors, (962), 13 states have internal predecessors, (962), 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:27:18,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:18,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 105 [2025-03-13 22:27:18,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:19,069 INFO L124 PetriNetUnfolderBase]: 485/1596 cut-off events. [2025-03-13 22:27:19,069 INFO L125 PetriNetUnfolderBase]: For 2656/2656 co-relation queries the response was YES. [2025-03-13 22:27:19,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3799 conditions, 1596 events. 485/1596 cut-off events. For 2656/2656 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 10084 event pairs, 0 based on Foata normal form. 32/1628 useless extension candidates. Maximal degree in co-relation 3776. Up to 517 conditions per place. [2025-03-13 22:27:19,077 INFO L140 encePairwiseOnDemand]: 100/105 looper letters, 57 selfloop transitions, 16 changer transitions 0/116 dead transitions. [2025-03-13 22:27:19,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 116 transitions, 628 flow [2025-03-13 22:27:19,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-13 22:27:19,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-13 22:27:19,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1370 transitions. [2025-03-13 22:27:19,079 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7248677248677249 [2025-03-13 22:27:19,079 INFO L175 Difference]: Start difference. First operand has 135 places, 107 transitions, 417 flow. Second operand 18 states and 1370 transitions. [2025-03-13 22:27:19,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 116 transitions, 628 flow [2025-03-13 22:27:19,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 116 transitions, 564 flow, removed 16 selfloop flow, removed 16 redundant places. [2025-03-13 22:27:19,084 INFO L231 Difference]: Finished difference. Result has 110 places, 71 transitions, 270 flow [2025-03-13 22:27:19,084 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=270, PETRI_PLACES=110, PETRI_TRANSITIONS=71} [2025-03-13 22:27:19,085 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, 1 predicate places. [2025-03-13 22:27:19,085 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 71 transitions, 270 flow [2025-03-13 22:27:19,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 74.0) internal successors, (962), 13 states have internal predecessors, (962), 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:27:19,085 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:19,085 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 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:27:19,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-13 22:27:19,085 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-13 22:27:19,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:19,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1751477161, now seen corresponding path program 1 times [2025-03-13 22:27:19,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:19,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183255086] [2025-03-13 22:27:19,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:19,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:19,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-13 22:27:19,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-13 22:27:19,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:19,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:27:19,110 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 22:27:19,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-13 22:27:19,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-13 22:27:19,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:19,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:27:19,135 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 22:27:19,136 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 22:27:19,136 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2025-03-13 22:27:19,137 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2025-03-13 22:27:19,137 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2025-03-13 22:27:19,137 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2025-03-13 22:27:19,137 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2025-03-13 22:27:19,137 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining) [2025-03-13 22:27:19,137 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2025-03-13 22:27:19,137 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2025-03-13 22:27:19,137 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2025-03-13 22:27:19,137 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2025-03-13 22:27:19,137 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2025-03-13 22:27:19,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-13 22:27:19,137 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:27:19,138 WARN L246 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 22:27:19,138 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2025-03-13 22:27:19,160 INFO L143 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2025-03-13 22:27:19,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 113 transitions, 298 flow [2025-03-13 22:27:19,283 INFO L124 PetriNetUnfolderBase]: 149/1721 cut-off events. [2025-03-13 22:27:19,284 INFO L125 PetriNetUnfolderBase]: For 242/242 co-relation queries the response was YES. [2025-03-13 22:27:19,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1947 conditions, 1721 events. 149/1721 cut-off events. For 242/242 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 10512 event pairs, 72 based on Foata normal form. 0/1551 useless extension candidates. Maximal degree in co-relation 1033. Up to 192 conditions per place. [2025-03-13 22:27:19,287 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 113 transitions, 298 flow [2025-03-13 22:27:19,291 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 113 transitions, 298 flow [2025-03-13 22:27:19,292 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:27:19,292 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;@7829f4d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:27:19,292 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-03-13 22:27:19,294 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:27:19,294 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-03-13 22:27:19,294 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:27:19,294 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:19,294 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:27:19,294 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-13 22:27:19,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:19,294 INFO L85 PathProgramCache]: Analyzing trace with hash -68582118, now seen corresponding path program 1 times [2025-03-13 22:27:19,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:19,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408815203] [2025-03-13 22:27:19,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:19,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:19,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-13 22:27:19,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-13 22:27:19,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:19,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:19,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:27:19,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:19,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408815203] [2025-03-13 22:27:19,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408815203] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:19,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:19,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-13 22:27:19,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255109079] [2025-03-13 22:27:19,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:19,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-13 22:27:19,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:19,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-13 22:27:19,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-13 22:27:19,305 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 113 [2025-03-13 22:27:19,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 113 transitions, 298 flow. Second operand has 2 states, 2 states have (on average 84.5) internal successors, (169), 2 states have internal predecessors, (169), 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:27:19,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:19,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 113 [2025-03-13 22:27:19,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:20,223 INFO L124 PetriNetUnfolderBase]: 2323/11440 cut-off events. [2025-03-13 22:27:20,223 INFO L125 PetriNetUnfolderBase]: For 5875/11201 co-relation queries the response was YES. [2025-03-13 22:27:20,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16399 conditions, 11440 events. 2323/11440 cut-off events. For 5875/11201 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 125997 event pairs, 2016 based on Foata normal form. 107/10045 useless extension candidates. Maximal degree in co-relation 9915. Up to 3110 conditions per place. [2025-03-13 22:27:20,257 INFO L140 encePairwiseOnDemand]: 104/113 looper letters, 19 selfloop transitions, 0 changer transitions 0/102 dead transitions. [2025-03-13 22:27:20,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 102 transitions, 314 flow [2025-03-13 22:27:20,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-13 22:27:20,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-13 22:27:20,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 196 transitions. [2025-03-13 22:27:20,257 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8672566371681416 [2025-03-13 22:27:20,257 INFO L175 Difference]: Start difference. First operand has 118 places, 113 transitions, 298 flow. Second operand 2 states and 196 transitions. [2025-03-13 22:27:20,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 102 transitions, 314 flow [2025-03-13 22:27:20,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 102 transitions, 314 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:27:20,260 INFO L231 Difference]: Finished difference. Result has 110 places, 102 transitions, 276 flow [2025-03-13 22:27:20,260 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=276, PETRI_PLACES=110, PETRI_TRANSITIONS=102} [2025-03-13 22:27:20,261 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, -8 predicate places. [2025-03-13 22:27:20,261 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 102 transitions, 276 flow [2025-03-13 22:27:20,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 84.5) internal successors, (169), 2 states have internal predecessors, (169), 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:27:20,261 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:20,261 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:27:20,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-13 22:27:20,261 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-13 22:27:20,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:20,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1388590854, now seen corresponding path program 1 times [2025-03-13 22:27:20,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:20,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442107290] [2025-03-13 22:27:20,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:20,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:20,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-13 22:27:20,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-13 22:27:20,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:20,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:20,275 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:27:20,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:20,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442107290] [2025-03-13 22:27:20,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442107290] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:20,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:20,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 22:27:20,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077335412] [2025-03-13 22:27:20,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:20,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:27:20,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:20,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:27:20,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:27:20,289 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 113 [2025-03-13 22:27:20,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 102 transitions, 276 flow. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:27:20,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:20,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 113 [2025-03-13 22:27:20,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:21,758 INFO L124 PetriNetUnfolderBase]: 4800/23166 cut-off events. [2025-03-13 22:27:21,758 INFO L125 PetriNetUnfolderBase]: For 6342/6342 co-relation queries the response was YES. [2025-03-13 22:27:21,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31656 conditions, 23166 events. 4800/23166 cut-off events. For 6342/6342 co-relation queries the response was YES. Maximal size of possible extension queue 458. Compared 277346 event pairs, 4436 based on Foata normal form. 1/21274 useless extension candidates. Maximal degree in co-relation 31647. Up to 6637 conditions per place. [2025-03-13 22:27:21,847 INFO L140 encePairwiseOnDemand]: 110/113 looper letters, 24 selfloop transitions, 2 changer transitions 3/104 dead transitions. [2025-03-13 22:27:21,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 104 transitions, 334 flow [2025-03-13 22:27:21,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:27:21,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:27:21,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 262 transitions. [2025-03-13 22:27:21,848 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7728613569321534 [2025-03-13 22:27:21,848 INFO L175 Difference]: Start difference. First operand has 110 places, 102 transitions, 276 flow. Second operand 3 states and 262 transitions. [2025-03-13 22:27:21,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 104 transitions, 334 flow [2025-03-13 22:27:21,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 104 transitions, 334 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:27:21,850 INFO L231 Difference]: Finished difference. Result has 113 places, 100 transitions, 282 flow [2025-03-13 22:27:21,850 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=282, PETRI_PLACES=113, PETRI_TRANSITIONS=100} [2025-03-13 22:27:21,851 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, -5 predicate places. [2025-03-13 22:27:21,851 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 100 transitions, 282 flow [2025-03-13 22:27:21,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:27:21,851 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:21,851 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:27:21,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-13 22:27:21,851 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-13 22:27:21,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:21,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1268219327, now seen corresponding path program 1 times [2025-03-13 22:27:21,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:21,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651481127] [2025-03-13 22:27:21,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:21,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:21,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-13 22:27:21,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-13 22:27:21,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:21,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:22,046 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:27:22,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:22,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651481127] [2025-03-13 22:27:22,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651481127] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:22,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:22,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:27:22,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66400632] [2025-03-13 22:27:22,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:22,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:27:22,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:22,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:27:22,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:27:22,111 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 113 [2025-03-13 22:27:22,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 100 transitions, 282 flow. Second operand has 6 states, 6 states have (on average 67.66666666666667) internal successors, (406), 6 states have internal predecessors, (406), 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:27:22,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:22,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 113 [2025-03-13 22:27:22,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:24,307 INFO L124 PetriNetUnfolderBase]: 12237/28343 cut-off events. [2025-03-13 22:27:24,307 INFO L125 PetriNetUnfolderBase]: For 6163/6163 co-relation queries the response was YES. [2025-03-13 22:27:24,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48080 conditions, 28343 events. 12237/28343 cut-off events. For 6163/6163 co-relation queries the response was YES. Maximal size of possible extension queue 663. Compared 269707 event pairs, 1392 based on Foata normal form. 0/26633 useless extension candidates. Maximal degree in co-relation 48069. Up to 15006 conditions per place. [2025-03-13 22:27:24,484 INFO L140 encePairwiseOnDemand]: 107/113 looper letters, 53 selfloop transitions, 6 changer transitions 2/123 dead transitions. [2025-03-13 22:27:24,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 123 transitions, 448 flow [2025-03-13 22:27:24,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:27:24,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:27:24,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 456 transitions. [2025-03-13 22:27:24,486 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.672566371681416 [2025-03-13 22:27:24,486 INFO L175 Difference]: Start difference. First operand has 113 places, 100 transitions, 282 flow. Second operand 6 states and 456 transitions. [2025-03-13 22:27:24,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 123 transitions, 448 flow [2025-03-13 22:27:24,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 123 transitions, 446 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:27:24,488 INFO L231 Difference]: Finished difference. Result has 113 places, 97 transitions, 286 flow [2025-03-13 22:27:24,488 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=286, PETRI_PLACES=113, PETRI_TRANSITIONS=97} [2025-03-13 22:27:24,489 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, -5 predicate places. [2025-03-13 22:27:24,489 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 97 transitions, 286 flow [2025-03-13 22:27:24,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 67.66666666666667) internal successors, (406), 6 states have internal predecessors, (406), 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:27:24,489 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:24,489 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] [2025-03-13 22:27:24,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-13 22:27:24,489 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-13 22:27:24,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:24,490 INFO L85 PathProgramCache]: Analyzing trace with hash -534368819, now seen corresponding path program 1 times [2025-03-13 22:27:24,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:24,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461957142] [2025-03-13 22:27:24,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:24,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:24,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-13 22:27:24,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-13 22:27:24,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:24,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:24,523 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:27:24,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:24,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461957142] [2025-03-13 22:27:24,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461957142] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:24,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:24,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:27:24,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599541805] [2025-03-13 22:27:24,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:24,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 22:27:24,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:24,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 22:27:24,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 22:27:24,546 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 113 [2025-03-13 22:27:24,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 97 transitions, 286 flow. Second operand has 5 states, 5 states have (on average 77.8) internal successors, (389), 5 states have internal predecessors, (389), 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:27:24,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:24,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 113 [2025-03-13 22:27:24,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:26,123 INFO L124 PetriNetUnfolderBase]: 3980/18675 cut-off events. [2025-03-13 22:27:26,123 INFO L125 PetriNetUnfolderBase]: For 6485/6485 co-relation queries the response was YES. [2025-03-13 22:27:26,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26753 conditions, 18675 events. 3980/18675 cut-off events. For 6485/6485 co-relation queries the response was YES. Maximal size of possible extension queue 379. Compared 211486 event pairs, 2455 based on Foata normal form. 2/16849 useless extension candidates. Maximal degree in co-relation 26742. Up to 5315 conditions per place. [2025-03-13 22:27:26,207 INFO L140 encePairwiseOnDemand]: 108/113 looper letters, 31 selfloop transitions, 5 changer transitions 0/106 dead transitions. [2025-03-13 22:27:26,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 106 transitions, 380 flow [2025-03-13 22:27:26,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:27:26,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:27:26,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 493 transitions. [2025-03-13 22:27:26,208 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7271386430678466 [2025-03-13 22:27:26,208 INFO L175 Difference]: Start difference. First operand has 113 places, 97 transitions, 286 flow. Second operand 6 states and 493 transitions. [2025-03-13 22:27:26,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 106 transitions, 380 flow [2025-03-13 22:27:26,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 106 transitions, 366 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:27:26,211 INFO L231 Difference]: Finished difference. Result has 114 places, 100 transitions, 306 flow [2025-03-13 22:27:26,211 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=306, PETRI_PLACES=114, PETRI_TRANSITIONS=100} [2025-03-13 22:27:26,212 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, -4 predicate places. [2025-03-13 22:27:26,212 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 100 transitions, 306 flow [2025-03-13 22:27:26,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 77.8) internal successors, (389), 5 states have internal predecessors, (389), 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:27:26,212 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:26,212 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:27:26,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-13 22:27:26,212 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-13 22:27:26,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:26,213 INFO L85 PathProgramCache]: Analyzing trace with hash 156395827, now seen corresponding path program 1 times [2025-03-13 22:27:26,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:26,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319993997] [2025-03-13 22:27:26,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:26,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:26,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-13 22:27:26,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-13 22:27:26,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:26,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:26,229 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:27:26,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:26,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319993997] [2025-03-13 22:27:26,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319993997] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:26,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:26,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:27:26,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461013534] [2025-03-13 22:27:26,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:26,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:27:26,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:26,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:27:26,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:27:26,232 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 113 [2025-03-13 22:27:26,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 100 transitions, 306 flow. Second operand has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 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:27:26,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:26,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 113 [2025-03-13 22:27:26,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:27,941 INFO L124 PetriNetUnfolderBase]: 5985/26381 cut-off events. [2025-03-13 22:27:27,941 INFO L125 PetriNetUnfolderBase]: For 10449/13035 co-relation queries the response was YES. [2025-03-13 22:27:28,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37849 conditions, 26381 events. 5985/26381 cut-off events. For 10449/13035 co-relation queries the response was YES. Maximal size of possible extension queue 634. Compared 324622 event pairs, 2690 based on Foata normal form. 20/23295 useless extension candidates. Maximal degree in co-relation 37835. Up to 6163 conditions per place. [2025-03-13 22:27:28,087 INFO L140 encePairwiseOnDemand]: 104/113 looper letters, 27 selfloop transitions, 8 changer transitions 0/113 dead transitions. [2025-03-13 22:27:28,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 113 transitions, 420 flow [2025-03-13 22:27:28,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:27:28,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:27:28,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 279 transitions. [2025-03-13 22:27:28,088 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8230088495575221 [2025-03-13 22:27:28,088 INFO L175 Difference]: Start difference. First operand has 114 places, 100 transitions, 306 flow. Second operand 3 states and 279 transitions. [2025-03-13 22:27:28,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 113 transitions, 420 flow [2025-03-13 22:27:28,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 113 transitions, 414 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-13 22:27:28,097 INFO L231 Difference]: Finished difference. Result has 116 places, 107 transitions, 362 flow [2025-03-13 22:27:28,097 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=362, PETRI_PLACES=116, PETRI_TRANSITIONS=107} [2025-03-13 22:27:28,098 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, -2 predicate places. [2025-03-13 22:27:28,098 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 107 transitions, 362 flow [2025-03-13 22:27:28,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 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:27:28,098 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:28,098 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:27:28,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-13 22:27:28,098 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-13 22:27:28,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:28,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1190023071, now seen corresponding path program 1 times [2025-03-13 22:27:28,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:28,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926322263] [2025-03-13 22:27:28,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:28,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:28,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-13 22:27:28,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-13 22:27:28,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:28,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:28,148 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:27:28,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:28,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926322263] [2025-03-13 22:27:28,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926322263] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:28,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:28,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-13 22:27:28,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779468798] [2025-03-13 22:27:28,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:28,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 22:27:28,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:28,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 22:27:28,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-13 22:27:28,187 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 113 [2025-03-13 22:27:28,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 107 transitions, 362 flow. Second operand has 7 states, 7 states have (on average 78.0) internal successors, (546), 7 states have internal predecessors, (546), 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:27:28,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:28,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 113 [2025-03-13 22:27:28,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:30,305 INFO L124 PetriNetUnfolderBase]: 7561/28064 cut-off events. [2025-03-13 22:27:30,306 INFO L125 PetriNetUnfolderBase]: For 19957/21015 co-relation queries the response was YES. [2025-03-13 22:27:30,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50526 conditions, 28064 events. 7561/28064 cut-off events. For 19957/21015 co-relation queries the response was YES. Maximal size of possible extension queue 566. Compared 326468 event pairs, 2561 based on Foata normal form. 4/25166 useless extension candidates. Maximal degree in co-relation 50511. Up to 9621 conditions per place. [2025-03-13 22:27:30,487 INFO L140 encePairwiseOnDemand]: 108/113 looper letters, 44 selfloop transitions, 8 changer transitions 0/123 dead transitions. [2025-03-13 22:27:30,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 123 transitions, 532 flow [2025-03-13 22:27:30,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 22:27:30,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 22:27:30,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 731 transitions. [2025-03-13 22:27:30,488 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7187807276302851 [2025-03-13 22:27:30,488 INFO L175 Difference]: Start difference. First operand has 116 places, 107 transitions, 362 flow. Second operand 9 states and 731 transitions. [2025-03-13 22:27:30,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 123 transitions, 532 flow [2025-03-13 22:27:30,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 123 transitions, 516 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:27:30,499 INFO L231 Difference]: Finished difference. Result has 125 places, 110 transitions, 390 flow [2025-03-13 22:27:30,499 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=390, PETRI_PLACES=125, PETRI_TRANSITIONS=110} [2025-03-13 22:27:30,499 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 7 predicate places. [2025-03-13 22:27:30,500 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 110 transitions, 390 flow [2025-03-13 22:27:30,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 78.0) internal successors, (546), 7 states have internal predecessors, (546), 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:27:30,500 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:30,500 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:27:30,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-03-13 22:27:30,500 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-13 22:27:30,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:30,500 INFO L85 PathProgramCache]: Analyzing trace with hash 760998042, now seen corresponding path program 1 times [2025-03-13 22:27:30,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:30,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797444576] [2025-03-13 22:27:30,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:30,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:30,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-13 22:27:30,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-13 22:27:30,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:30,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:30,570 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 22:27:30,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:30,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797444576] [2025-03-13 22:27:30,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797444576] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:30,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:30,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-13 22:27:30,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912809453] [2025-03-13 22:27:30,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:30,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-13 22:27:30,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:30,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-13 22:27:30,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-13 22:27:30,610 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 113 [2025-03-13 22:27:30,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 110 transitions, 390 flow. Second operand has 9 states, 9 states have (on average 78.0) internal successors, (702), 9 states have internal predecessors, (702), 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:27:30,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:30,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 113 [2025-03-13 22:27:30,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:33,191 INFO L124 PetriNetUnfolderBase]: 7473/27953 cut-off events. [2025-03-13 22:27:33,191 INFO L125 PetriNetUnfolderBase]: For 17394/18429 co-relation queries the response was YES. [2025-03-13 22:27:33,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48555 conditions, 27953 events. 7473/27953 cut-off events. For 17394/18429 co-relation queries the response was YES. Maximal size of possible extension queue 584. Compared 328779 event pairs, 2019 based on Foata normal form. 8/24973 useless extension candidates. Maximal degree in co-relation 48537. Up to 9390 conditions per place. [2025-03-13 22:27:33,393 INFO L140 encePairwiseOnDemand]: 108/113 looper letters, 54 selfloop transitions, 11 changer transitions 0/136 dead transitions. [2025-03-13 22:27:33,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 136 transitions, 634 flow [2025-03-13 22:27:33,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-13 22:27:33,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-13 22:27:33,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 972 transitions. [2025-03-13 22:27:33,395 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7168141592920354 [2025-03-13 22:27:33,395 INFO L175 Difference]: Start difference. First operand has 125 places, 110 transitions, 390 flow. Second operand 12 states and 972 transitions. [2025-03-13 22:27:33,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 136 transitions, 634 flow [2025-03-13 22:27:33,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 136 transitions, 616 flow, removed 4 selfloop flow, removed 5 redundant places. [2025-03-13 22:27:33,401 INFO L231 Difference]: Finished difference. Result has 134 places, 113 transitions, 428 flow [2025-03-13 22:27:33,401 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=428, PETRI_PLACES=134, PETRI_TRANSITIONS=113} [2025-03-13 22:27:33,402 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 16 predicate places. [2025-03-13 22:27:33,402 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 113 transitions, 428 flow [2025-03-13 22:27:33,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 78.0) internal successors, (702), 9 states have internal predecessors, (702), 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:27:33,402 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:33,402 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:27:33,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-03-13 22:27:33,402 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-13 22:27:33,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:33,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1413786712, now seen corresponding path program 1 times [2025-03-13 22:27:33,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:33,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306107600] [2025-03-13 22:27:33,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:33,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:33,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-13 22:27:33,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-13 22:27:33,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:33,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:33,515 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-13 22:27:33,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:33,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306107600] [2025-03-13 22:27:33,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306107600] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:33,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:33,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-13 22:27:33,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019745166] [2025-03-13 22:27:33,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:33,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-13 22:27:33,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:33,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-13 22:27:33,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-13 22:27:33,565 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 113 [2025-03-13 22:27:33,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 113 transitions, 428 flow. Second operand has 11 states, 11 states have (on average 78.0) internal successors, (858), 11 states have internal predecessors, (858), 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:27:33,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:33,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 113 [2025-03-13 22:27:33,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:36,069 INFO L124 PetriNetUnfolderBase]: 7228/27800 cut-off events. [2025-03-13 22:27:36,069 INFO L125 PetriNetUnfolderBase]: For 18348/19307 co-relation queries the response was YES. [2025-03-13 22:27:36,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48243 conditions, 27800 events. 7228/27800 cut-off events. For 18348/19307 co-relation queries the response was YES. Maximal size of possible extension queue 682. Compared 333575 event pairs, 1731 based on Foata normal form. 16/24883 useless extension candidates. Maximal degree in co-relation 48222. Up to 8810 conditions per place. [2025-03-13 22:27:36,202 INFO L140 encePairwiseOnDemand]: 108/113 looper letters, 67 selfloop transitions, 14 changer transitions 0/152 dead transitions. [2025-03-13 22:27:36,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 152 transitions, 764 flow [2025-03-13 22:27:36,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-13 22:27:36,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-13 22:27:36,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1216 transitions. [2025-03-13 22:27:36,204 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7174041297935103 [2025-03-13 22:27:36,204 INFO L175 Difference]: Start difference. First operand has 134 places, 113 transitions, 428 flow. Second operand 15 states and 1216 transitions. [2025-03-13 22:27:36,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 152 transitions, 764 flow [2025-03-13 22:27:36,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 152 transitions, 734 flow, removed 7 selfloop flow, removed 8 redundant places. [2025-03-13 22:27:36,209 INFO L231 Difference]: Finished difference. Result has 143 places, 116 transitions, 466 flow [2025-03-13 22:27:36,209 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=398, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=466, PETRI_PLACES=143, PETRI_TRANSITIONS=116} [2025-03-13 22:27:36,210 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 25 predicate places. [2025-03-13 22:27:36,210 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 116 transitions, 466 flow [2025-03-13 22:27:36,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 78.0) internal successors, (858), 11 states have internal predecessors, (858), 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:27:36,210 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:36,210 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 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:27:36,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-03-13 22:27:36,210 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-13 22:27:36,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:36,211 INFO L85 PathProgramCache]: Analyzing trace with hash 2012526005, now seen corresponding path program 1 times [2025-03-13 22:27:36,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:36,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316157306] [2025-03-13 22:27:36,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:36,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:36,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-13 22:27:36,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-13 22:27:36,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:36,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:36,330 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-13 22:27:36,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:36,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316157306] [2025-03-13 22:27:36,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316157306] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:36,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:36,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-13 22:27:36,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965132027] [2025-03-13 22:27:36,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:36,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-13 22:27:36,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:36,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-13 22:27:36,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-03-13 22:27:36,379 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 113 [2025-03-13 22:27:36,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 116 transitions, 466 flow. Second operand has 13 states, 13 states have (on average 78.0) internal successors, (1014), 13 states have internal predecessors, (1014), 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:27:36,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:36,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 113 [2025-03-13 22:27:36,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:38,705 INFO L124 PetriNetUnfolderBase]: 6602/27921 cut-off events. [2025-03-13 22:27:38,705 INFO L125 PetriNetUnfolderBase]: For 19066/19788 co-relation queries the response was YES. [2025-03-13 22:27:38,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47191 conditions, 27921 events. 6602/27921 cut-off events. For 19066/19788 co-relation queries the response was YES. Maximal size of possible extension queue 692. Compared 340429 event pairs, 1919 based on Foata normal form. 32/25061 useless extension candidates. Maximal degree in co-relation 47167. Up to 7417 conditions per place. [2025-03-13 22:27:38,881 INFO L140 encePairwiseOnDemand]: 108/113 looper letters, 81 selfloop transitions, 17 changer transitions 0/169 dead transitions. [2025-03-13 22:27:38,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 169 transitions, 886 flow [2025-03-13 22:27:38,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-13 22:27:38,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-13 22:27:38,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1461 transitions. [2025-03-13 22:27:38,882 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7182890855457227 [2025-03-13 22:27:38,882 INFO L175 Difference]: Start difference. First operand has 143 places, 116 transitions, 466 flow. Second operand 18 states and 1461 transitions. [2025-03-13 22:27:38,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 169 transitions, 886 flow [2025-03-13 22:27:38,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 169 transitions, 844 flow, removed 10 selfloop flow, removed 11 redundant places. [2025-03-13 22:27:38,889 INFO L231 Difference]: Finished difference. Result has 152 places, 118 transitions, 490 flow [2025-03-13 22:27:38,889 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=490, PETRI_PLACES=152, PETRI_TRANSITIONS=118} [2025-03-13 22:27:38,890 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 34 predicate places. [2025-03-13 22:27:38,890 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 118 transitions, 490 flow [2025-03-13 22:27:38,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 78.0) internal successors, (1014), 13 states have internal predecessors, (1014), 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:27:38,890 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:38,890 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 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:27:38,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-03-13 22:27:38,891 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-13 22:27:38,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:38,891 INFO L85 PathProgramCache]: Analyzing trace with hash 141136979, now seen corresponding path program 1 times [2025-03-13 22:27:38,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:38,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449535987] [2025-03-13 22:27:38,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:38,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:38,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-13 22:27:38,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-13 22:27:38,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:38,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:39,024 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-13 22:27:39,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:39,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449535987] [2025-03-13 22:27:39,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449535987] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:39,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:39,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-13 22:27:39,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065572036] [2025-03-13 22:27:39,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:39,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-13 22:27:39,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:39,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-13 22:27:39,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-13 22:27:39,099 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 113 [2025-03-13 22:27:39,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 118 transitions, 490 flow. Second operand has 15 states, 15 states have (on average 78.0) internal successors, (1170), 15 states have internal predecessors, (1170), 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:27:39,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:39,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 113 [2025-03-13 22:27:39,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:39,452 INFO L124 PetriNetUnfolderBase]: 1221/3418 cut-off events. [2025-03-13 22:27:39,452 INFO L125 PetriNetUnfolderBase]: For 7522/7522 co-relation queries the response was YES. [2025-03-13 22:27:39,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8649 conditions, 3418 events. 1221/3418 cut-off events. For 7522/7522 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 24589 event pairs, 0 based on Foata normal form. 64/3482 useless extension candidates. Maximal degree in co-relation 8622. Up to 1285 conditions per place. [2025-03-13 22:27:39,471 INFO L140 encePairwiseOnDemand]: 108/113 looper letters, 77 selfloop transitions, 19 changer transitions 0/143 dead transitions. [2025-03-13 22:27:39,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 143 transitions, 808 flow [2025-03-13 22:27:39,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-13 22:27:39,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-13 22:27:39,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1693 transitions. [2025-03-13 22:27:39,473 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7134428992836073 [2025-03-13 22:27:39,473 INFO L175 Difference]: Start difference. First operand has 152 places, 118 transitions, 490 flow. Second operand 21 states and 1693 transitions. [2025-03-13 22:27:39,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 143 transitions, 808 flow [2025-03-13 22:27:39,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 143 transitions, 722 flow, removed 23 selfloop flow, removed 20 redundant places. [2025-03-13 22:27:39,480 INFO L231 Difference]: Finished difference. Result has 126 places, 80 transitions, 316 flow [2025-03-13 22:27:39,480 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=316, PETRI_PLACES=126, PETRI_TRANSITIONS=80} [2025-03-13 22:27:39,480 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 8 predicate places. [2025-03-13 22:27:39,480 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 80 transitions, 316 flow [2025-03-13 22:27:39,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 78.0) internal successors, (1170), 15 states have internal predecessors, (1170), 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:27:39,480 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:39,481 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 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:27:39,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-03-13 22:27:39,481 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-13 22:27:39,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:39,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1695386457, now seen corresponding path program 1 times [2025-03-13 22:27:39,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:39,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852305165] [2025-03-13 22:27:39,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:39,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:39,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-13 22:27:39,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-13 22:27:39,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:39,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:27:39,500 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 22:27:39,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-13 22:27:39,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-13 22:27:39,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:39,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:27:39,517 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 22:27:39,517 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 22:27:39,517 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 12 remaining) [2025-03-13 22:27:39,517 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining) [2025-03-13 22:27:39,517 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining) [2025-03-13 22:27:39,517 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining) [2025-03-13 22:27:39,517 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 12 remaining) [2025-03-13 22:27:39,518 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (6 of 12 remaining) [2025-03-13 22:27:39,518 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 12 remaining) [2025-03-13 22:27:39,518 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining) [2025-03-13 22:27:39,518 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining) [2025-03-13 22:27:39,518 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining) [2025-03-13 22:27:39,518 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining) [2025-03-13 22:27:39,518 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining) [2025-03-13 22:27:39,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-03-13 22:27:39,518 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:27:39,518 WARN L246 ceAbstractionStarter]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 22:27:39,518 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 7 thread instances. [2025-03-13 22:27:39,532 INFO L143 ThreadInstanceAdder]: Constructed 7 joinOtherThreadTransitions. [2025-03-13 22:27:39,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 121 transitions, 333 flow [2025-03-13 22:27:39,727 INFO L124 PetriNetUnfolderBase]: 344/3292 cut-off events. [2025-03-13 22:27:39,727 INFO L125 PetriNetUnfolderBase]: For 525/525 co-relation queries the response was YES. [2025-03-13 22:27:39,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3783 conditions, 3292 events. 344/3292 cut-off events. For 525/525 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 25139 event pairs, 201 based on Foata normal form. 0/2988 useless extension candidates. Maximal degree in co-relation 1939. Up to 448 conditions per place. [2025-03-13 22:27:39,735 INFO L82 GeneralOperation]: Start removeDead. Operand has 127 places, 121 transitions, 333 flow [2025-03-13 22:27:39,741 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 127 places, 121 transitions, 333 flow [2025-03-13 22:27:39,741 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:27:39,741 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;@7829f4d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:27:39,741 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-03-13 22:27:39,742 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:27:39,742 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-03-13 22:27:39,742 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:27:39,742 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:39,742 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:27:39,742 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-13 22:27:39,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:39,742 INFO L85 PathProgramCache]: Analyzing trace with hash -144242950, now seen corresponding path program 1 times [2025-03-13 22:27:39,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:39,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170569761] [2025-03-13 22:27:39,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:39,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:39,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-13 22:27:39,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-13 22:27:39,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:39,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:39,748 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:27:39,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:39,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170569761] [2025-03-13 22:27:39,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170569761] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:39,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:39,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-13 22:27:39,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422729615] [2025-03-13 22:27:39,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:39,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-13 22:27:39,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:39,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-13 22:27:39,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-13 22:27:39,749 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 121 [2025-03-13 22:27:39,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 121 transitions, 333 flow. Second operand has 2 states, 2 states have (on average 88.5) internal successors, (177), 2 states have internal predecessors, (177), 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:27:39,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:39,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 121 [2025-03-13 22:27:39,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:42,228 INFO L124 PetriNetUnfolderBase]: 8348/35176 cut-off events. [2025-03-13 22:27:42,228 INFO L125 PetriNetUnfolderBase]: For 19512/38926 co-relation queries the response was YES. [2025-03-13 22:27:42,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51839 conditions, 35176 events. 8348/35176 cut-off events. For 19512/38926 co-relation queries the response was YES. Maximal size of possible extension queue 865. Compared 458015 event pairs, 7375 based on Foata normal form. 272/30823 useless extension candidates. Maximal degree in co-relation 32111. Up to 10656 conditions per place. [2025-03-13 22:27:42,432 INFO L140 encePairwiseOnDemand]: 111/121 looper letters, 22 selfloop transitions, 0 changer transitions 0/109 dead transitions. [2025-03-13 22:27:42,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 109 transitions, 353 flow [2025-03-13 22:27:42,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-13 22:27:42,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-13 22:27:42,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 208 transitions. [2025-03-13 22:27:42,433 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.859504132231405 [2025-03-13 22:27:42,433 INFO L175 Difference]: Start difference. First operand has 127 places, 121 transitions, 333 flow. Second operand 2 states and 208 transitions. [2025-03-13 22:27:42,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 109 transitions, 353 flow [2025-03-13 22:27:42,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 109 transitions, 353 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:27:42,440 INFO L231 Difference]: Finished difference. Result has 118 places, 109 transitions, 309 flow [2025-03-13 22:27:42,441 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=309, PETRI_PLACES=118, PETRI_TRANSITIONS=109} [2025-03-13 22:27:42,441 INFO L279 CegarLoopForPetriNet]: 127 programPoint places, -9 predicate places. [2025-03-13 22:27:42,441 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 109 transitions, 309 flow [2025-03-13 22:27:42,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 88.5) internal successors, (177), 2 states have internal predecessors, (177), 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:27:42,441 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:42,441 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:27:42,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-03-13 22:27:42,441 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-13 22:27:42,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:42,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1548823713, now seen corresponding path program 1 times [2025-03-13 22:27:42,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:42,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976706885] [2025-03-13 22:27:42,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:42,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:42,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-13 22:27:42,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-13 22:27:42,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:42,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:42,450 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:27:42,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:42,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976706885] [2025-03-13 22:27:42,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976706885] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:42,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:42,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 22:27:42,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532709336] [2025-03-13 22:27:42,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:42,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:27:42,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:42,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:27:42,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:27:42,464 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 121 [2025-03-13 22:27:42,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 109 transitions, 309 flow. Second operand has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 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:27:42,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:42,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 121 [2025-03-13 22:27:42,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:48,212 INFO L124 PetriNetUnfolderBase]: 15877/68051 cut-off events. [2025-03-13 22:27:48,213 INFO L125 PetriNetUnfolderBase]: For 20812/20812 co-relation queries the response was YES. [2025-03-13 22:27:48,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95076 conditions, 68051 events. 15877/68051 cut-off events. For 20812/20812 co-relation queries the response was YES. Maximal size of possible extension queue 1199. Compared 937386 event pairs, 12884 based on Foata normal form. 1/62789 useless extension candidates. Maximal degree in co-relation 95066. Up to 21014 conditions per place. [2025-03-13 22:27:48,497 INFO L140 encePairwiseOnDemand]: 118/121 looper letters, 27 selfloop transitions, 2 changer transitions 3/111 dead transitions. [2025-03-13 22:27:48,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 111 transitions, 373 flow [2025-03-13 22:27:48,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:27:48,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:27:48,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 277 transitions. [2025-03-13 22:27:48,498 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7630853994490359 [2025-03-13 22:27:48,498 INFO L175 Difference]: Start difference. First operand has 118 places, 109 transitions, 309 flow. Second operand 3 states and 277 transitions. [2025-03-13 22:27:48,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 111 transitions, 373 flow [2025-03-13 22:27:48,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 111 transitions, 373 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:27:48,501 INFO L231 Difference]: Finished difference. Result has 121 places, 107 transitions, 315 flow [2025-03-13 22:27:48,501 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=315, PETRI_PLACES=121, PETRI_TRANSITIONS=107} [2025-03-13 22:27:48,501 INFO L279 CegarLoopForPetriNet]: 127 programPoint places, -6 predicate places. [2025-03-13 22:27:48,501 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 107 transitions, 315 flow [2025-03-13 22:27:48,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 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:27:48,501 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:48,501 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:27:48,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-03-13 22:27:48,501 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-13 22:27:48,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:48,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1250166968, now seen corresponding path program 1 times [2025-03-13 22:27:48,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:48,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123009389] [2025-03-13 22:27:48,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:48,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:48,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-13 22:27:48,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-13 22:27:48,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:48,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:48,574 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:27:48,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:48,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123009389] [2025-03-13 22:27:48,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123009389] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:48,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:48,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:27:48,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690338932] [2025-03-13 22:27:48,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:48,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:27:48,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:48,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:27:48,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:27:48,634 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 121 [2025-03-13 22:27:48,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 107 transitions, 315 flow. Second operand has 6 states, 6 states have (on average 71.66666666666667) internal successors, (430), 6 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:27:48,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:48,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 121 [2025-03-13 22:27:48,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:56,003 INFO L124 PetriNetUnfolderBase]: 40248/84724 cut-off events. [2025-03-13 22:27:56,004 INFO L125 PetriNetUnfolderBase]: For 20298/20298 co-relation queries the response was YES. [2025-03-13 22:27:56,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146532 conditions, 84724 events. 40248/84724 cut-off events. For 20298/20298 co-relation queries the response was YES. Maximal size of possible extension queue 1786. Compared 881798 event pairs, 30118 based on Foata normal form. 0/81288 useless extension candidates. Maximal degree in co-relation 146520. Up to 49511 conditions per place. [2025-03-13 22:27:56,554 INFO L140 encePairwiseOnDemand]: 115/121 looper letters, 60 selfloop transitions, 6 changer transitions 2/134 dead transitions. [2025-03-13 22:27:56,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 134 transitions, 503 flow [2025-03-13 22:27:56,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:27:56,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:27:56,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 487 transitions. [2025-03-13 22:27:56,555 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6707988980716253 [2025-03-13 22:27:56,555 INFO L175 Difference]: Start difference. First operand has 121 places, 107 transitions, 315 flow. Second operand 6 states and 487 transitions. [2025-03-13 22:27:56,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 134 transitions, 503 flow [2025-03-13 22:27:56,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 134 transitions, 501 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:27:56,583 INFO L231 Difference]: Finished difference. Result has 121 places, 104 transitions, 319 flow [2025-03-13 22:27:56,583 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=311, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=319, PETRI_PLACES=121, PETRI_TRANSITIONS=104} [2025-03-13 22:27:56,583 INFO L279 CegarLoopForPetriNet]: 127 programPoint places, -6 predicate places. [2025-03-13 22:27:56,583 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 104 transitions, 319 flow [2025-03-13 22:27:56,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 71.66666666666667) internal successors, (430), 6 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:27:56,583 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:56,583 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] [2025-03-13 22:27:56,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-03-13 22:27:56,583 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-13 22:27:56,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:56,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1403238016, now seen corresponding path program 1 times [2025-03-13 22:27:56,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:56,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530754477] [2025-03-13 22:27:56,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:56,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:56,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-13 22:27:56,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-13 22:27:56,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:56,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:56,607 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:27:56,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:56,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530754477] [2025-03-13 22:27:56,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530754477] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:56,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:56,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:27:56,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667410318] [2025-03-13 22:27:56,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:56,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 22:27:56,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:56,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 22:27:56,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 22:27:56,634 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 121 [2025-03-13 22:27:56,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 104 transitions, 319 flow. Second operand has 5 states, 5 states have (on average 81.8) internal successors, (409), 5 states have internal predecessors, (409), 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:27:56,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:56,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 121 [2025-03-13 22:27:56,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:28:01,560 INFO L124 PetriNetUnfolderBase]: 12308/53403 cut-off events. [2025-03-13 22:28:01,561 INFO L125 PetriNetUnfolderBase]: For 21068/21068 co-relation queries the response was YES. [2025-03-13 22:28:01,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76961 conditions, 53403 events. 12308/53403 cut-off events. For 21068/21068 co-relation queries the response was YES. Maximal size of possible extension queue 993. Compared 705855 event pairs, 8378 based on Foata normal form. 2/48281 useless extension candidates. Maximal degree in co-relation 76949. Up to 15741 conditions per place. [2025-03-13 22:28:01,848 INFO L140 encePairwiseOnDemand]: 116/121 looper letters, 34 selfloop transitions, 5 changer transitions 0/113 dead transitions. [2025-03-13 22:28:01,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 113 transitions, 419 flow [2025-03-13 22:28:01,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:28:01,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:28:01,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 520 transitions. [2025-03-13 22:28:01,849 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7162534435261708 [2025-03-13 22:28:01,849 INFO L175 Difference]: Start difference. First operand has 121 places, 104 transitions, 319 flow. Second operand 6 states and 520 transitions. [2025-03-13 22:28:01,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 113 transitions, 419 flow [2025-03-13 22:28:01,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 113 transitions, 405 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:28:01,855 INFO L231 Difference]: Finished difference. Result has 122 places, 107 transitions, 339 flow [2025-03-13 22:28:01,855 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=307, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=339, PETRI_PLACES=122, PETRI_TRANSITIONS=107} [2025-03-13 22:28:01,855 INFO L279 CegarLoopForPetriNet]: 127 programPoint places, -5 predicate places. [2025-03-13 22:28:01,855 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 107 transitions, 339 flow [2025-03-13 22:28:01,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 81.8) internal successors, (409), 5 states have internal predecessors, (409), 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:28:01,856 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:28:01,856 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:28:01,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-03-13 22:28:01,856 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-13 22:28:01,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:28:01,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1569907008, now seen corresponding path program 1 times [2025-03-13 22:28:01,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:28:01,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779588814] [2025-03-13 22:28:01,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:28:01,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:28:01,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-13 22:28:01,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-13 22:28:01,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:28:01,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:28:01,870 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:28:01,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:28:01,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779588814] [2025-03-13 22:28:01,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779588814] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:28:01,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:28:01,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:28:01,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108990371] [2025-03-13 22:28:01,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:28:01,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:28:01,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:28:01,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:28:01,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:28:01,872 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 121 [2025-03-13 22:28:01,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 107 transitions, 339 flow. Second operand has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:28:01,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:28:01,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 121 [2025-03-13 22:28:01,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand