./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 8fc3dc66 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-?-8fc3dc6-m [2025-03-17 11:15:33,283 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:15:33,339 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-17 11:15:33,343 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:15:33,343 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:15:33,368 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:15:33,368 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:15:33,369 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:15:33,369 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:15:33,369 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:15:33,369 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:15:33,370 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:15:33,370 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:15:33,370 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:15:33,370 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 11:15:33,371 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 11:15:33,371 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:15:33,371 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 11:15:33,371 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:15:33,371 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 11:15:33,371 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:15:33,371 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 11:15:33,371 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-17 11:15:33,372 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:15:33,372 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 11:15:33,372 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 11:15:33,372 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:15:33,372 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:15:33,372 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:15:33,372 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:15:33,372 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:15:33,372 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:15:33,372 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:15:33,373 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:15:33,373 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 11:15:33,373 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 11:15:33,373 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:15:33,373 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:15:33,373 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:15:33,373 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:15:33,373 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:15:33,373 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:15:33,374 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-17 11:15:33,609 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:15:33,617 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:15:33,619 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:15:33,620 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:15:33,620 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:15:33,621 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-17 11:15:34,788 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54119e288/a3b19d0cd2b841fe9c26664f06a16478/FLAG8bdfe7e54 [2025-03-17 11:15:35,054 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:15:35,055 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/floating_read-20.i [2025-03-17 11:15:35,071 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54119e288/a3b19d0cd2b841fe9c26664f06a16478/FLAG8bdfe7e54 [2025-03-17 11:15:35,088 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54119e288/a3b19d0cd2b841fe9c26664f06a16478 [2025-03-17 11:15:35,091 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:15:35,092 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:15:35,093 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:15:35,094 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:15:35,097 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:15:35,098 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:15:35" (1/1) ... [2025-03-17 11:15:35,100 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cf0269b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:15:35, skipping insertion in model container [2025-03-17 11:15:35,100 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:15:35" (1/1) ... [2025-03-17 11:15:35,130 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:15:35,322 WARN L1731 CHandler]: Possible shadowing of function thread [2025-03-17 11:15:35,336 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:15:35,344 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:15:35,376 WARN L1731 CHandler]: Possible shadowing of function thread [2025-03-17 11:15:35,382 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:15:35,407 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:15:35,408 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:15:35 WrapperNode [2025-03-17 11:15:35,408 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:15:35,409 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:15:35,409 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:15:35,409 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:15:35,414 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:15:35" (1/1) ... [2025-03-17 11:15:35,425 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:15:35" (1/1) ... [2025-03-17 11:15:35,440 INFO L138 Inliner]: procedures = 162, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 62 [2025-03-17 11:15:35,440 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:15:35,441 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:15:35,441 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:15:35,441 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:15:35,444 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:15:35" (1/1) ... [2025-03-17 11:15:35,445 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:15:35" (1/1) ... [2025-03-17 11:15:35,447 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:15:35" (1/1) ... [2025-03-17 11:15:35,447 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:15:35" (1/1) ... [2025-03-17 11:15:35,456 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:15:35" (1/1) ... [2025-03-17 11:15:35,456 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:15:35" (1/1) ... [2025-03-17 11:15:35,457 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:15:35" (1/1) ... [2025-03-17 11:15:35,458 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:15:35" (1/1) ... [2025-03-17 11:15:35,459 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:15:35,459 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:15:35,459 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:15:35,459 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:15:35,460 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:15:35" (1/1) ... [2025-03-17 11:15:35,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:15:35,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:15:35,491 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-17 11:15:35,495 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-17 11:15:35,509 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 11:15:35,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 11:15:35,509 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-17 11:15:35,509 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 11:15:35,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 11:15:35,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 11:15:35,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 11:15:35,510 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-03-17 11:15:35,510 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-03-17 11:15:35,510 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-17 11:15:35,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:15:35,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:15:35,511 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 11:15:35,602 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:15:35,603 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:15:35,744 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L719: havoc main_~#t~0#1.base, main_~#t~0#1.offset; [2025-03-17 11:15:35,745 INFO L1322 $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-17 11:15:35,753 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 11:15:35,754 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:15:35,779 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:15:35,780 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 11:15:35,780 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:15:35 BoogieIcfgContainer [2025-03-17 11:15:35,781 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:15:35,782 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:15:35,782 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:15:35,786 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:15:35,786 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:15:35" (1/3) ... [2025-03-17 11:15:35,787 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@430641fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:15:35, skipping insertion in model container [2025-03-17 11:15:35,787 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:15:35" (2/3) ... [2025-03-17 11:15:35,787 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@430641fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:15:35, skipping insertion in model container [2025-03-17 11:15:35,787 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:15:35" (3/3) ... [2025-03-17 11:15:35,789 INFO L128 eAbstractionObserver]: Analyzing ICFG floating_read-20.i [2025-03-17 11:15:35,799 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:15:35,801 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-17 11:15:35,802 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 11:15:35,845 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-17 11:15:35,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 73 transitions, 153 flow [2025-03-17 11:15:35,916 INFO L124 PetriNetUnfolderBase]: 5/115 cut-off events. [2025-03-17 11:15:35,917 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 11:15:35,920 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 227 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-17 11:15:35,920 INFO L82 GeneralOperation]: Start removeDead. Operand has 73 places, 73 transitions, 153 flow [2025-03-17 11:15:35,925 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 73 transitions, 153 flow [2025-03-17 11:15:35,930 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:15:35,942 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;@133872e1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:15:35,944 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-17 11:15:35,948 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:15:35,951 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-03-17 11:15:35,951 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:15:35,951 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:35,951 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:15:35,952 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-17 11:15:35,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:35,957 INFO L85 PathProgramCache]: Analyzing trace with hash 267114124, now seen corresponding path program 1 times [2025-03-17 11:15:35,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:35,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954111123] [2025-03-17 11:15:35,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:35,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:36,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 11:15:36,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 11:15:36,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:36,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:36,078 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-17 11:15:36,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:36,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954111123] [2025-03-17 11:15:36,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954111123] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:36,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:36,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 11:15:36,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025542328] [2025-03-17 11:15:36,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:36,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 11:15:36,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:36,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 11:15:36,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 11:15:36,110 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 73 [2025-03-17 11:15:36,111 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-17 11:15:36,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:36,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 73 [2025-03-17 11:15:36,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:36,144 INFO L124 PetriNetUnfolderBase]: 1/105 cut-off events. [2025-03-17 11:15:36,144 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2025-03-17 11:15:36,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 1/105 cut-off events. For 4/5 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-17 11:15:36,145 INFO L140 encePairwiseOnDemand]: 69/73 looper letters, 4 selfloop transitions, 0 changer transitions 12/67 dead transitions. [2025-03-17 11:15:36,145 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 67 transitions, 149 flow [2025-03-17 11:15:36,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 11:15:36,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-17 11:15:36,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 136 transitions. [2025-03-17 11:15:36,156 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9315068493150684 [2025-03-17 11:15:36,157 INFO L175 Difference]: Start difference. First operand has 73 places, 73 transitions, 153 flow. Second operand 2 states and 136 transitions. [2025-03-17 11:15:36,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 67 transitions, 149 flow [2025-03-17 11:15:36,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 67 transitions, 149 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:15:36,165 INFO L231 Difference]: Finished difference. Result has 70 places, 55 transitions, 117 flow [2025-03-17 11:15:36,166 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-17 11:15:36,171 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, -3 predicate places. [2025-03-17 11:15:36,171 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 55 transitions, 117 flow [2025-03-17 11:15:36,171 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-17 11:15:36,171 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:36,171 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-17 11:15:36,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 11:15:36,172 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-17 11:15:36,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:36,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1334624145, now seen corresponding path program 1 times [2025-03-17 11:15:36,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:36,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046247536] [2025-03-17 11:15:36,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:36,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:36,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 11:15:36,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 11:15:36,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:36,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:36,267 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-17 11:15:36,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:36,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046247536] [2025-03-17 11:15:36,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046247536] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:36,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:36,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:15:36,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089991735] [2025-03-17 11:15:36,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:36,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:15:36,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:36,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:15:36,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:15:36,304 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 73 [2025-03-17 11:15:36,304 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-17 11:15:36,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:36,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 73 [2025-03-17 11:15:36,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:36,340 INFO L124 PetriNetUnfolderBase]: 3/106 cut-off events. [2025-03-17 11:15:36,341 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-17 11:15:36,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 106 events. 3/106 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 195 event pairs, 0 based on Foata normal form. 1/99 useless extension candidates. Maximal degree in co-relation 124. Up to 13 conditions per place. [2025-03-17 11:15:36,341 INFO L140 encePairwiseOnDemand]: 70/73 looper letters, 8 selfloop transitions, 2 changer transitions 0/56 dead transitions. [2025-03-17 11:15:36,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 56 transitions, 139 flow [2025-03-17 11:15:36,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:15:36,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:15:36,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 185 transitions. [2025-03-17 11:15:36,344 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8447488584474886 [2025-03-17 11:15:36,344 INFO L175 Difference]: Start difference. First operand has 70 places, 55 transitions, 117 flow. Second operand 3 states and 185 transitions. [2025-03-17 11:15:36,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 56 transitions, 139 flow [2025-03-17 11:15:36,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 56 transitions, 139 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:15:36,347 INFO L231 Difference]: Finished difference. Result has 61 places, 55 transitions, 125 flow [2025-03-17 11:15:36,347 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-17 11:15:36,347 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, -12 predicate places. [2025-03-17 11:15:36,348 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 55 transitions, 125 flow [2025-03-17 11:15:36,348 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-17 11:15:36,348 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:36,348 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-17 11:15:36,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 11:15:36,348 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-17 11:15:36,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:36,350 INFO L85 PathProgramCache]: Analyzing trace with hash 248469515, now seen corresponding path program 1 times [2025-03-17 11:15:36,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:36,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344991207] [2025-03-17 11:15:36,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:36,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:36,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 11:15:36,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 11:15:36,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:36,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:36,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-17 11:15:36,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:36,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344991207] [2025-03-17 11:15:36,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344991207] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:36,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:36,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:15:36,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346703015] [2025-03-17 11:15:36,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:36,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:15:36,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:36,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:15:36,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:15:36,838 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 73 [2025-03-17 11:15:36,839 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-17 11:15:36,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:36,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 73 [2025-03-17 11:15:36,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:36,898 INFO L124 PetriNetUnfolderBase]: 12/112 cut-off events. [2025-03-17 11:15:36,899 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-17 11:15:36,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181 conditions, 112 events. 12/112 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 261 event pairs, 2 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 175. Up to 32 conditions per place. [2025-03-17 11:15:36,899 INFO L140 encePairwiseOnDemand]: 67/73 looper letters, 18 selfloop transitions, 5 changer transitions 0/58 dead transitions. [2025-03-17 11:15:36,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 58 transitions, 177 flow [2025-03-17 11:15:36,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:15:36,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:15:36,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 300 transitions. [2025-03-17 11:15:36,901 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.684931506849315 [2025-03-17 11:15:36,901 INFO L175 Difference]: Start difference. First operand has 61 places, 55 transitions, 125 flow. Second operand 6 states and 300 transitions. [2025-03-17 11:15:36,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 58 transitions, 177 flow [2025-03-17 11:15:36,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 58 transitions, 173 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:15:36,903 INFO L231 Difference]: Finished difference. Result has 63 places, 54 transitions, 129 flow [2025-03-17 11:15:36,903 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-17 11:15:36,903 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, -10 predicate places. [2025-03-17 11:15:36,904 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 54 transitions, 129 flow [2025-03-17 11:15:36,904 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-17 11:15:36,904 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:36,904 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-17 11:15:36,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 11:15:36,904 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-17 11:15:36,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:36,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1453979015, now seen corresponding path program 1 times [2025-03-17 11:15:36,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:36,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984952284] [2025-03-17 11:15:36,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:36,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:36,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 11:15:36,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 11:15:36,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:36,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:36,960 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-17 11:15:36,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:36,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984952284] [2025-03-17 11:15:36,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984952284] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:36,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:36,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:15:36,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101780352] [2025-03-17 11:15:36,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:36,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:15:36,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:36,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:15:36,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:15:36,995 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 73 [2025-03-17 11:15:36,996 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-17 11:15:36,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:36,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 73 [2025-03-17 11:15:36,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:37,028 INFO L124 PetriNetUnfolderBase]: 3/62 cut-off events. [2025-03-17 11:15:37,028 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 11:15:37,029 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-17 11:15:37,029 INFO L140 encePairwiseOnDemand]: 68/73 looper letters, 7 selfloop transitions, 4 changer transitions 0/38 dead transitions. [2025-03-17 11:15:37,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 38 transitions, 114 flow [2025-03-17 11:15:37,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:15:37,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:15:37,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 348 transitions. [2025-03-17 11:15:37,034 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7945205479452054 [2025-03-17 11:15:37,034 INFO L175 Difference]: Start difference. First operand has 63 places, 54 transitions, 129 flow. Second operand 6 states and 348 transitions. [2025-03-17 11:15:37,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 38 transitions, 114 flow [2025-03-17 11:15:37,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 38 transitions, 102 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-17 11:15:37,035 INFO L231 Difference]: Finished difference. Result has 44 places, 35 transitions, 82 flow [2025-03-17 11:15:37,035 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-17 11:15:37,035 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, -29 predicate places. [2025-03-17 11:15:37,035 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 35 transitions, 82 flow [2025-03-17 11:15:37,036 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-17 11:15:37,036 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:37,036 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-17 11:15:37,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 11:15:37,036 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-17 11:15:37,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:37,036 INFO L85 PathProgramCache]: Analyzing trace with hash -935605763, now seen corresponding path program 1 times [2025-03-17 11:15:37,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:37,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513241136] [2025-03-17 11:15:37,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:37,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:37,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-17 11:15:37,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 11:15:37,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:37,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:15:37,061 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 11:15:37,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-17 11:15:37,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 11:15:37,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:37,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:15:37,086 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 11:15:37,086 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 11:15:37,088 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2025-03-17 11:15:37,089 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2025-03-17 11:15:37,090 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2025-03-17 11:15:37,090 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2025-03-17 11:15:37,090 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2025-03-17 11:15:37,090 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2025-03-17 11:15:37,090 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2025-03-17 11:15:37,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 11:15:37,090 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-17 11:15:37,092 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 11:15:37,093 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-17 11:15:37,110 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-17 11:15:37,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 81 transitions, 178 flow [2025-03-17 11:15:37,135 INFO L124 PetriNetUnfolderBase]: 9/193 cut-off events. [2025-03-17 11:15:37,136 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-17 11:15:37,136 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 442 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-17 11:15:37,136 INFO L82 GeneralOperation]: Start removeDead. Operand has 82 places, 81 transitions, 178 flow [2025-03-17 11:15:37,137 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 82 places, 81 transitions, 178 flow [2025-03-17 11:15:37,137 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:15:37,137 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;@133872e1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:15:37,138 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-17 11:15:37,139 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:15:37,139 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-03-17 11:15:37,139 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:15:37,139 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:37,139 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:15:37,139 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-17 11:15:37,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:37,139 INFO L85 PathProgramCache]: Analyzing trace with hash -386960020, now seen corresponding path program 1 times [2025-03-17 11:15:37,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:37,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962821292] [2025-03-17 11:15:37,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:37,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:37,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 11:15:37,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 11:15:37,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:37,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:37,150 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-17 11:15:37,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:37,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962821292] [2025-03-17 11:15:37,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962821292] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:37,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:37,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 11:15:37,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156848148] [2025-03-17 11:15:37,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:37,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 11:15:37,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:37,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 11:15:37,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 11:15:37,151 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 81 [2025-03-17 11:15:37,151 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-17 11:15:37,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:37,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 81 [2025-03-17 11:15:37,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:37,175 INFO L124 PetriNetUnfolderBase]: 7/212 cut-off events. [2025-03-17 11:15:37,175 INFO L125 PetriNetUnfolderBase]: For 29/38 co-relation queries the response was YES. [2025-03-17 11:15:37,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 247 conditions, 212 events. 7/212 cut-off events. For 29/38 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-17 11:15:37,177 INFO L140 encePairwiseOnDemand]: 76/81 looper letters, 7 selfloop transitions, 0 changer transitions 0/74 dead transitions. [2025-03-17 11:15:37,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 74 transitions, 178 flow [2025-03-17 11:15:37,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 11:15:37,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-17 11:15:37,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 148 transitions. [2025-03-17 11:15:37,178 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9135802469135802 [2025-03-17 11:15:37,179 INFO L175 Difference]: Start difference. First operand has 82 places, 81 transitions, 178 flow. Second operand 2 states and 148 transitions. [2025-03-17 11:15:37,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 74 transitions, 178 flow [2025-03-17 11:15:37,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 74 transitions, 178 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:15:37,181 INFO L231 Difference]: Finished difference. Result has 78 places, 74 transitions, 164 flow [2025-03-17 11:15:37,181 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-17 11:15:37,182 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, -4 predicate places. [2025-03-17 11:15:37,183 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 74 transitions, 164 flow [2025-03-17 11:15:37,183 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-17 11:15:37,183 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:37,183 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:15:37,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 11:15:37,184 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-17 11:15:37,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:37,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1057691454, now seen corresponding path program 1 times [2025-03-17 11:15:37,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:37,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253013173] [2025-03-17 11:15:37,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:37,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:37,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 11:15:37,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 11:15:37,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:37,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:37,208 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-17 11:15:37,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:37,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253013173] [2025-03-17 11:15:37,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253013173] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:37,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:37,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:15:37,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924242572] [2025-03-17 11:15:37,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:37,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:15:37,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:37,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:15:37,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:15:37,233 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 81 [2025-03-17 11:15:37,234 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-17 11:15:37,234 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:37,234 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 81 [2025-03-17 11:15:37,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:37,281 INFO L124 PetriNetUnfolderBase]: 28/388 cut-off events. [2025-03-17 11:15:37,281 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2025-03-17 11:15:37,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 474 conditions, 388 events. 28/388 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1864 event pairs, 10 based on Foata normal form. 1/350 useless extension candidates. Maximal degree in co-relation 469. Up to 65 conditions per place. [2025-03-17 11:15:37,283 INFO L140 encePairwiseOnDemand]: 78/81 looper letters, 12 selfloop transitions, 2 changer transitions 3/76 dead transitions. [2025-03-17 11:15:37,283 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 76 transitions, 198 flow [2025-03-17 11:15:37,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:15:37,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:15:37,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 202 transitions. [2025-03-17 11:15:37,284 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.831275720164609 [2025-03-17 11:15:37,284 INFO L175 Difference]: Start difference. First operand has 78 places, 74 transitions, 164 flow. Second operand 3 states and 202 transitions. [2025-03-17 11:15:37,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 76 transitions, 198 flow [2025-03-17 11:15:37,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 76 transitions, 198 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:15:37,285 INFO L231 Difference]: Finished difference. Result has 81 places, 72 transitions, 170 flow [2025-03-17 11:15:37,285 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-17 11:15:37,286 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, -1 predicate places. [2025-03-17 11:15:37,286 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 72 transitions, 170 flow [2025-03-17 11:15:37,286 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-17 11:15:37,286 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:37,286 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-17 11:15:37,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 11:15:37,286 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-17 11:15:37,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:37,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1620713180, now seen corresponding path program 1 times [2025-03-17 11:15:37,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:37,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221803913] [2025-03-17 11:15:37,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:37,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:37,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 11:15:37,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 11:15:37,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:37,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:37,500 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-17 11:15:37,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:37,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221803913] [2025-03-17 11:15:37,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221803913] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:37,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:37,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:15:37,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649276162] [2025-03-17 11:15:37,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:37,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:15:37,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:37,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:15:37,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:15:37,583 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 81 [2025-03-17 11:15:37,583 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-17 11:15:37,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:37,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 81 [2025-03-17 11:15:37,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:37,678 INFO L124 PetriNetUnfolderBase]: 77/403 cut-off events. [2025-03-17 11:15:37,678 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2025-03-17 11:15:37,679 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 2019 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-17 11:15:37,680 INFO L140 encePairwiseOnDemand]: 75/81 looper letters, 25 selfloop transitions, 6 changer transitions 2/79 dead transitions. [2025-03-17 11:15:37,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 79 transitions, 248 flow [2025-03-17 11:15:37,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:15:37,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:15:37,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 332 transitions. [2025-03-17 11:15:37,682 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6831275720164609 [2025-03-17 11:15:37,682 INFO L175 Difference]: Start difference. First operand has 81 places, 72 transitions, 170 flow. Second operand 6 states and 332 transitions. [2025-03-17 11:15:37,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 79 transitions, 248 flow [2025-03-17 11:15:37,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 79 transitions, 246 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:15:37,684 INFO L231 Difference]: Finished difference. Result has 81 places, 69 transitions, 174 flow [2025-03-17 11:15:37,684 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-17 11:15:37,684 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, -1 predicate places. [2025-03-17 11:15:37,684 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 69 transitions, 174 flow [2025-03-17 11:15:37,685 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-17 11:15:37,685 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:37,685 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:15:37,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 11:15:37,685 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-17 11:15:37,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:37,685 INFO L85 PathProgramCache]: Analyzing trace with hash 604796420, now seen corresponding path program 1 times [2025-03-17 11:15:37,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:37,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447792565] [2025-03-17 11:15:37,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:37,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:37,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 11:15:37,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 11:15:37,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:37,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:37,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:15:37,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:37,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447792565] [2025-03-17 11:15:37,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447792565] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:37,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:37,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:15:37,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515414845] [2025-03-17 11:15:37,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:37,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:15:37,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:37,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:15:37,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:15:37,768 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 81 [2025-03-17 11:15:37,769 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-17 11:15:37,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:37,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 81 [2025-03-17 11:15:37,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:37,825 INFO L124 PetriNetUnfolderBase]: 28/321 cut-off events. [2025-03-17 11:15:37,825 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-03-17 11:15:37,826 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 1303 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-17 11:15:37,826 INFO L140 encePairwiseOnDemand]: 76/81 looper letters, 17 selfloop transitions, 5 changer transitions 0/76 dead transitions. [2025-03-17 11:15:37,826 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 76 transitions, 232 flow [2025-03-17 11:15:37,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:15:37,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:15:37,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 383 transitions. [2025-03-17 11:15:37,828 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7880658436213992 [2025-03-17 11:15:37,828 INFO L175 Difference]: Start difference. First operand has 81 places, 69 transitions, 174 flow. Second operand 6 states and 383 transitions. [2025-03-17 11:15:37,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 76 transitions, 232 flow [2025-03-17 11:15:37,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 76 transitions, 220 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:15:37,829 INFO L231 Difference]: Finished difference. Result has 82 places, 71 transitions, 188 flow [2025-03-17 11:15:37,829 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-17 11:15:37,830 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, 0 predicate places. [2025-03-17 11:15:37,830 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 71 transitions, 188 flow [2025-03-17 11:15:37,830 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-17 11:15:37,830 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:37,830 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-17 11:15:37,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 11:15:37,830 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-17 11:15:37,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:37,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1054594213, now seen corresponding path program 1 times [2025-03-17 11:15:37,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:37,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342137267] [2025-03-17 11:15:37,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:37,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:37,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-17 11:15:37,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-17 11:15:37,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:37,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:37,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:15:37,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:37,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342137267] [2025-03-17 11:15:37,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342137267] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:37,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:37,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:15:37,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27000139] [2025-03-17 11:15:37,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:37,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:15:37,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:37,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:15:37,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:15:37,861 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 81 [2025-03-17 11:15:37,861 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-17 11:15:37,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:37,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 81 [2025-03-17 11:15:37,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:37,912 INFO L124 PetriNetUnfolderBase]: 19/335 cut-off events. [2025-03-17 11:15:37,912 INFO L125 PetriNetUnfolderBase]: For 53/62 co-relation queries the response was YES. [2025-03-17 11:15:37,912 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 1471 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-17 11:15:37,913 INFO L140 encePairwiseOnDemand]: 76/81 looper letters, 11 selfloop transitions, 4 changer transitions 0/76 dead transitions. [2025-03-17 11:15:37,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 76 transitions, 234 flow [2025-03-17 11:15:37,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:15:37,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:15:37,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 211 transitions. [2025-03-17 11:15:37,914 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8683127572016461 [2025-03-17 11:15:37,914 INFO L175 Difference]: Start difference. First operand has 82 places, 71 transitions, 188 flow. Second operand 3 states and 211 transitions. [2025-03-17 11:15:37,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 76 transitions, 234 flow [2025-03-17 11:15:37,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 76 transitions, 228 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-17 11:15:37,915 INFO L231 Difference]: Finished difference. Result has 84 places, 74 transitions, 212 flow [2025-03-17 11:15:37,915 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-17 11:15:37,916 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, 2 predicate places. [2025-03-17 11:15:37,916 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 74 transitions, 212 flow [2025-03-17 11:15:37,916 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-17 11:15:37,916 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:37,916 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-17 11:15:37,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 11:15:37,916 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-17 11:15:37,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:37,917 INFO L85 PathProgramCache]: Analyzing trace with hash -267534053, now seen corresponding path program 1 times [2025-03-17 11:15:37,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:37,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151460879] [2025-03-17 11:15:37,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:37,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:37,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 11:15:37,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 11:15:37,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:37,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:38,007 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-17 11:15:38,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:38,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151460879] [2025-03-17 11:15:38,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151460879] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:38,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:38,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 11:15:38,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465125985] [2025-03-17 11:15:38,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:38,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 11:15:38,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:38,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 11:15:38,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:15:38,058 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 81 [2025-03-17 11:15:38,059 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-17 11:15:38,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:38,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 81 [2025-03-17 11:15:38,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:38,114 INFO L124 PetriNetUnfolderBase]: 17/142 cut-off events. [2025-03-17 11:15:38,115 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2025-03-17 11:15:38,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 142 events. 17/142 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 345 event pairs, 0 based on Foata normal form. 4/146 useless extension candidates. Maximal degree in co-relation 239. Up to 21 conditions per place. [2025-03-17 11:15:38,115 INFO L140 encePairwiseOnDemand]: 76/81 looper letters, 15 selfloop transitions, 7 changer transitions 0/53 dead transitions. [2025-03-17 11:15:38,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 53 transitions, 202 flow [2025-03-17 11:15:38,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 11:15:38,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 11:15:38,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 563 transitions. [2025-03-17 11:15:38,117 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7722908093278463 [2025-03-17 11:15:38,117 INFO L175 Difference]: Start difference. First operand has 84 places, 74 transitions, 212 flow. Second operand 9 states and 563 transitions. [2025-03-17 11:15:38,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 53 transitions, 202 flow [2025-03-17 11:15:38,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 53 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:15:38,119 INFO L231 Difference]: Finished difference. Result has 63 places, 44 transitions, 132 flow [2025-03-17 11:15:38,119 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-17 11:15:38,119 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, -19 predicate places. [2025-03-17 11:15:38,119 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 44 transitions, 132 flow [2025-03-17 11:15:38,120 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-17 11:15:38,120 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:38,120 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-17 11:15:38,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 11:15:38,120 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-17 11:15:38,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:38,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1226884024, now seen corresponding path program 1 times [2025-03-17 11:15:38,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:38,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202581463] [2025-03-17 11:15:38,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:38,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:38,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-17 11:15:38,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-17 11:15:38,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:38,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:15:38,144 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 11:15:38,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-17 11:15:38,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-17 11:15:38,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:38,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:15:38,163 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 11:15:38,164 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 11:15:38,164 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2025-03-17 11:15:38,164 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (6 of 8 remaining) [2025-03-17 11:15:38,164 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 8 remaining) [2025-03-17 11:15:38,164 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 8 remaining) [2025-03-17 11:15:38,164 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (3 of 8 remaining) [2025-03-17 11:15:38,164 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 8 remaining) [2025-03-17 11:15:38,164 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 8 remaining) [2025-03-17 11:15:38,164 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 8 remaining) [2025-03-17 11:15:38,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 11:15:38,164 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:15:38,165 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 11:15:38,165 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-17 11:15:38,180 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-17 11:15:38,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 89 transitions, 205 flow [2025-03-17 11:15:38,204 INFO L124 PetriNetUnfolderBase]: 16/316 cut-off events. [2025-03-17 11:15:38,204 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-03-17 11:15:38,205 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 862 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-17 11:15:38,205 INFO L82 GeneralOperation]: Start removeDead. Operand has 91 places, 89 transitions, 205 flow [2025-03-17 11:15:38,206 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 91 places, 89 transitions, 205 flow [2025-03-17 11:15:38,207 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:15:38,207 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;@133872e1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:15:38,207 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-03-17 11:15:38,208 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:15:38,208 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-03-17 11:15:38,208 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:15:38,209 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:38,209 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:15:38,209 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-17 11:15:38,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:38,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1651628876, now seen corresponding path program 1 times [2025-03-17 11:15:38,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:38,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589323574] [2025-03-17 11:15:38,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:38,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:38,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 11:15:38,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 11:15:38,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:38,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:38,217 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-17 11:15:38,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:38,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589323574] [2025-03-17 11:15:38,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589323574] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:38,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:38,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 11:15:38,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924510177] [2025-03-17 11:15:38,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:38,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 11:15:38,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:38,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 11:15:38,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 11:15:38,219 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 89 [2025-03-17 11:15:38,219 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-17 11:15:38,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:38,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 89 [2025-03-17 11:15:38,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:38,269 INFO L124 PetriNetUnfolderBase]: 36/492 cut-off events. [2025-03-17 11:15:38,269 INFO L125 PetriNetUnfolderBase]: For 123/178 co-relation queries the response was YES. [2025-03-17 11:15:38,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 615 conditions, 492 events. 36/492 cut-off events. For 123/178 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2154 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-17 11:15:38,271 INFO L140 encePairwiseOnDemand]: 83/89 looper letters, 10 selfloop transitions, 0 changer transitions 0/81 dead transitions. [2025-03-17 11:15:38,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 81 transitions, 209 flow [2025-03-17 11:15:38,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 11:15:38,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-17 11:15:38,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 160 transitions. [2025-03-17 11:15:38,273 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.898876404494382 [2025-03-17 11:15:38,273 INFO L175 Difference]: Start difference. First operand has 91 places, 89 transitions, 205 flow. Second operand 2 states and 160 transitions. [2025-03-17 11:15:38,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 81 transitions, 209 flow [2025-03-17 11:15:38,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 81 transitions, 209 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:15:38,274 INFO L231 Difference]: Finished difference. Result has 86 places, 81 transitions, 189 flow [2025-03-17 11:15:38,274 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-17 11:15:38,275 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, -5 predicate places. [2025-03-17 11:15:38,275 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 81 transitions, 189 flow [2025-03-17 11:15:38,275 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-17 11:15:38,275 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:38,275 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-17 11:15:38,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 11:15:38,275 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-17 11:15:38,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:38,276 INFO L85 PathProgramCache]: Analyzing trace with hash -982046469, now seen corresponding path program 1 times [2025-03-17 11:15:38,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:38,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807396515] [2025-03-17 11:15:38,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:38,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:38,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 11:15:38,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 11:15:38,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:38,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:38,293 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-17 11:15:38,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:38,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807396515] [2025-03-17 11:15:38,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807396515] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:38,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:38,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:15:38,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163692536] [2025-03-17 11:15:38,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:38,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:15:38,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:38,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:15:38,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:15:38,313 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 89 [2025-03-17 11:15:38,314 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-17 11:15:38,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:38,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 89 [2025-03-17 11:15:38,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:38,419 INFO L124 PetriNetUnfolderBase]: 117/1051 cut-off events. [2025-03-17 11:15:38,419 INFO L125 PetriNetUnfolderBase]: For 136/136 co-relation queries the response was YES. [2025-03-17 11:15:38,421 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 6797 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-17 11:15:38,424 INFO L140 encePairwiseOnDemand]: 86/89 looper letters, 15 selfloop transitions, 2 changer transitions 3/83 dead transitions. [2025-03-17 11:15:38,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 83 transitions, 229 flow [2025-03-17 11:15:38,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:15:38,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:15:38,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 217 transitions. [2025-03-17 11:15:38,425 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8127340823970037 [2025-03-17 11:15:38,425 INFO L175 Difference]: Start difference. First operand has 86 places, 81 transitions, 189 flow. Second operand 3 states and 217 transitions. [2025-03-17 11:15:38,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 83 transitions, 229 flow [2025-03-17 11:15:38,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 83 transitions, 229 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:15:38,427 INFO L231 Difference]: Finished difference. Result has 89 places, 79 transitions, 195 flow [2025-03-17 11:15:38,427 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-17 11:15:38,427 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, -2 predicate places. [2025-03-17 11:15:38,428 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 79 transitions, 195 flow [2025-03-17 11:15:38,428 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-17 11:15:38,428 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:38,428 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-17 11:15:38,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 11:15:38,428 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-17 11:15:38,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:38,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1855904181, now seen corresponding path program 1 times [2025-03-17 11:15:38,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:38,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490142095] [2025-03-17 11:15:38,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:38,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:38,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 11:15:38,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 11:15:38,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:38,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:38,603 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-17 11:15:38,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:38,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490142095] [2025-03-17 11:15:38,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490142095] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:38,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:38,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:15:38,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117787064] [2025-03-17 11:15:38,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:38,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:15:38,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:38,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:15:38,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:15:38,689 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 89 [2025-03-17 11:15:38,690 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-17 11:15:38,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:38,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 89 [2025-03-17 11:15:38,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:38,813 INFO L124 PetriNetUnfolderBase]: 312/1108 cut-off events. [2025-03-17 11:15:38,813 INFO L125 PetriNetUnfolderBase]: For 134/134 co-relation queries the response was YES. [2025-03-17 11:15:38,815 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 6579 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-17 11:15:38,818 INFO L140 encePairwiseOnDemand]: 83/89 looper letters, 32 selfloop transitions, 6 changer transitions 2/90 dead transitions. [2025-03-17 11:15:38,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 90 transitions, 295 flow [2025-03-17 11:15:38,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:15:38,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:15:38,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 363 transitions. [2025-03-17 11:15:38,819 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6797752808988764 [2025-03-17 11:15:38,820 INFO L175 Difference]: Start difference. First operand has 89 places, 79 transitions, 195 flow. Second operand 6 states and 363 transitions. [2025-03-17 11:15:38,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 90 transitions, 295 flow [2025-03-17 11:15:38,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 90 transitions, 293 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:15:38,821 INFO L231 Difference]: Finished difference. Result has 89 places, 76 transitions, 199 flow [2025-03-17 11:15:38,821 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-17 11:15:38,822 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, -2 predicate places. [2025-03-17 11:15:38,822 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 76 transitions, 199 flow [2025-03-17 11:15:38,823 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-17 11:15:38,823 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:38,823 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-17 11:15:38,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 11:15:38,823 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-17 11:15:38,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:38,824 INFO L85 PathProgramCache]: Analyzing trace with hash -498937449, now seen corresponding path program 1 times [2025-03-17 11:15:38,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:38,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324688093] [2025-03-17 11:15:38,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:38,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:38,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 11:15:38,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 11:15:38,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:38,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:38,871 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-17 11:15:38,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:38,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324688093] [2025-03-17 11:15:38,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324688093] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:38,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:38,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:15:38,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133657729] [2025-03-17 11:15:38,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:38,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:15:38,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:38,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:15:38,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:15:38,912 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 89 [2025-03-17 11:15:38,912 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-17 11:15:38,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:38,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 89 [2025-03-17 11:15:38,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:38,994 INFO L124 PetriNetUnfolderBase]: 120/883 cut-off events. [2025-03-17 11:15:38,994 INFO L125 PetriNetUnfolderBase]: For 154/154 co-relation queries the response was YES. [2025-03-17 11:15:38,996 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 5424 event pairs, 65 based on Foata normal form. 2/801 useless extension candidates. Maximal degree in co-relation 1245. Up to 193 conditions per place. [2025-03-17 11:15:38,998 INFO L140 encePairwiseOnDemand]: 84/89 looper letters, 22 selfloop transitions, 5 changer transitions 0/85 dead transitions. [2025-03-17 11:15:38,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 85 transitions, 275 flow [2025-03-17 11:15:38,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:15:38,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:15:38,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 412 transitions. [2025-03-17 11:15:38,999 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7715355805243446 [2025-03-17 11:15:38,999 INFO L175 Difference]: Start difference. First operand has 89 places, 76 transitions, 199 flow. Second operand 6 states and 412 transitions. [2025-03-17 11:15:38,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 85 transitions, 275 flow [2025-03-17 11:15:39,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 85 transitions, 261 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:15:39,001 INFO L231 Difference]: Finished difference. Result has 90 places, 79 transitions, 219 flow [2025-03-17 11:15:39,001 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-17 11:15:39,001 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, -1 predicate places. [2025-03-17 11:15:39,002 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 79 transitions, 219 flow [2025-03-17 11:15:39,002 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-17 11:15:39,002 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:39,002 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-17 11:15:39,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 11:15:39,002 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-17 11:15:39,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:39,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1730045458, now seen corresponding path program 1 times [2025-03-17 11:15:39,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:39,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526397758] [2025-03-17 11:15:39,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:39,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:39,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-17 11:15:39,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-17 11:15:39,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:39,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:39,032 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-17 11:15:39,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:39,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526397758] [2025-03-17 11:15:39,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526397758] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:39,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:39,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:15:39,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207176536] [2025-03-17 11:15:39,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:39,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:15:39,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:39,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:15:39,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:15:39,035 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 89 [2025-03-17 11:15:39,036 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-17 11:15:39,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:39,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 89 [2025-03-17 11:15:39,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:39,110 INFO L124 PetriNetUnfolderBase]: 119/1006 cut-off events. [2025-03-17 11:15:39,110 INFO L125 PetriNetUnfolderBase]: For 230/286 co-relation queries the response was YES. [2025-03-17 11:15:39,112 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 6856 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-17 11:15:39,115 INFO L140 encePairwiseOnDemand]: 83/89 looper letters, 15 selfloop transitions, 5 changer transitions 0/86 dead transitions. [2025-03-17 11:15:39,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 86 transitions, 282 flow [2025-03-17 11:15:39,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:15:39,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:15:39,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 228 transitions. [2025-03-17 11:15:39,116 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8539325842696629 [2025-03-17 11:15:39,116 INFO L175 Difference]: Start difference. First operand has 90 places, 79 transitions, 219 flow. Second operand 3 states and 228 transitions. [2025-03-17 11:15:39,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 86 transitions, 282 flow [2025-03-17 11:15:39,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 86 transitions, 276 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-17 11:15:39,118 INFO L231 Difference]: Finished difference. Result has 92 places, 83 transitions, 251 flow [2025-03-17 11:15:39,118 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-17 11:15:39,118 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 1 predicate places. [2025-03-17 11:15:39,118 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 83 transitions, 251 flow [2025-03-17 11:15:39,118 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-17 11:15:39,118 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:39,119 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-17 11:15:39,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 11:15:39,119 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-17 11:15:39,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:39,119 INFO L85 PathProgramCache]: Analyzing trace with hash 179181755, now seen corresponding path program 1 times [2025-03-17 11:15:39,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:39,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273613344] [2025-03-17 11:15:39,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:39,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:39,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 11:15:39,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 11:15:39,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:39,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:39,186 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-17 11:15:39,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:39,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273613344] [2025-03-17 11:15:39,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273613344] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:39,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:39,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 11:15:39,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896342600] [2025-03-17 11:15:39,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:39,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 11:15:39,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:39,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 11:15:39,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:15:39,237 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 89 [2025-03-17 11:15:39,238 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-17 11:15:39,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:39,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 89 [2025-03-17 11:15:39,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:39,373 INFO L124 PetriNetUnfolderBase]: 175/1161 cut-off events. [2025-03-17 11:15:39,374 INFO L125 PetriNetUnfolderBase]: For 471/494 co-relation queries the response was YES. [2025-03-17 11:15:39,376 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 7496 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-17 11:15:39,379 INFO L140 encePairwiseOnDemand]: 84/89 looper letters, 30 selfloop transitions, 8 changer transitions 0/97 dead transitions. [2025-03-17 11:15:39,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 97 transitions, 383 flow [2025-03-17 11:15:39,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 11:15:39,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 11:15:39,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 612 transitions. [2025-03-17 11:15:39,381 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7640449438202247 [2025-03-17 11:15:39,381 INFO L175 Difference]: Start difference. First operand has 92 places, 83 transitions, 251 flow. Second operand 9 states and 612 transitions. [2025-03-17 11:15:39,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 97 transitions, 383 flow [2025-03-17 11:15:39,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 97 transitions, 373 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:15:39,383 INFO L231 Difference]: Finished difference. Result has 101 places, 85 transitions, 277 flow [2025-03-17 11:15:39,383 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-17 11:15:39,383 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 10 predicate places. [2025-03-17 11:15:39,383 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 85 transitions, 277 flow [2025-03-17 11:15:39,384 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-17 11:15:39,384 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:39,384 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-17 11:15:39,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 11:15:39,384 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-17 11:15:39,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:39,384 INFO L85 PathProgramCache]: Analyzing trace with hash -722903967, now seen corresponding path program 1 times [2025-03-17 11:15:39,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:39,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038775366] [2025-03-17 11:15:39,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:39,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:39,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-17 11:15:39,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-17 11:15:39,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:39,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:39,486 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-17 11:15:39,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:39,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038775366] [2025-03-17 11:15:39,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038775366] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:39,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:39,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 11:15:39,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924831775] [2025-03-17 11:15:39,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:39,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 11:15:39,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:39,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 11:15:39,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-17 11:15:39,538 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 89 [2025-03-17 11:15:39,539 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-17 11:15:39,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:39,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 89 [2025-03-17 11:15:39,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:39,622 INFO L124 PetriNetUnfolderBase]: 61/318 cut-off events. [2025-03-17 11:15:39,622 INFO L125 PetriNetUnfolderBase]: For 215/215 co-relation queries the response was YES. [2025-03-17 11:15:39,623 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 1249 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-17 11:15:39,624 INFO L140 encePairwiseOnDemand]: 84/89 looper letters, 26 selfloop transitions, 10 changer transitions 0/71 dead transitions. [2025-03-17 11:15:39,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 71 transitions, 328 flow [2025-03-17 11:15:39,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 11:15:39,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-17 11:15:39,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 805 transitions. [2025-03-17 11:15:39,626 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7537453183520599 [2025-03-17 11:15:39,626 INFO L175 Difference]: Start difference. First operand has 101 places, 85 transitions, 277 flow. Second operand 12 states and 805 transitions. [2025-03-17 11:15:39,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 71 transitions, 328 flow [2025-03-17 11:15:39,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 71 transitions, 302 flow, removed 5 selfloop flow, removed 8 redundant places. [2025-03-17 11:15:39,627 INFO L231 Difference]: Finished difference. Result has 78 places, 53 transitions, 178 flow [2025-03-17 11:15:39,627 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-17 11:15:39,628 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, -13 predicate places. [2025-03-17 11:15:39,628 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 53 transitions, 178 flow [2025-03-17 11:15:39,628 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-17 11:15:39,628 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:39,628 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-17 11:15:39,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 11:15:39,628 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-17 11:15:39,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:39,629 INFO L85 PathProgramCache]: Analyzing trace with hash -727283232, now seen corresponding path program 1 times [2025-03-17 11:15:39,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:39,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012387840] [2025-03-17 11:15:39,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:39,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:39,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-17 11:15:39,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-17 11:15:39,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:39,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:15:39,643 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 11:15:39,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-17 11:15:39,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-17 11:15:39,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:39,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:15:39,658 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 11:15:39,659 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 11:15:39,659 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2025-03-17 11:15:39,659 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2025-03-17 11:15:39,659 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2025-03-17 11:15:39,659 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2025-03-17 11:15:39,659 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2025-03-17 11:15:39,659 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2025-03-17 11:15:39,659 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2025-03-17 11:15:39,659 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2025-03-17 11:15:39,659 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2025-03-17 11:15:39,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 11:15:39,659 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:15:39,659 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 11:15:39,660 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-17 11:15:39,671 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-17 11:15:39,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 97 transitions, 234 flow [2025-03-17 11:15:39,696 INFO L124 PetriNetUnfolderBase]: 31/531 cut-off events. [2025-03-17 11:15:39,696 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-03-17 11:15:39,697 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 1917 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-17 11:15:39,697 INFO L82 GeneralOperation]: Start removeDead. Operand has 100 places, 97 transitions, 234 flow [2025-03-17 11:15:39,699 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 100 places, 97 transitions, 234 flow [2025-03-17 11:15:39,699 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:15:39,700 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;@133872e1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:15:39,700 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-17 11:15:39,700 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:15:39,701 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-03-17 11:15:39,701 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:15:39,701 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:39,701 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:15:39,701 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-17 11:15:39,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:39,701 INFO L85 PathProgramCache]: Analyzing trace with hash 2087913516, now seen corresponding path program 1 times [2025-03-17 11:15:39,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:39,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266031602] [2025-03-17 11:15:39,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:39,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:39,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 11:15:39,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 11:15:39,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:39,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:39,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:15:39,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:39,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266031602] [2025-03-17 11:15:39,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266031602] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:39,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:39,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 11:15:39,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998908667] [2025-03-17 11:15:39,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:39,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 11:15:39,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:39,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 11:15:39,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 11:15:39,717 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 97 [2025-03-17 11:15:39,717 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-17 11:15:39,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:39,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 97 [2025-03-17 11:15:39,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:39,802 INFO L124 PetriNetUnfolderBase]: 157/1308 cut-off events. [2025-03-17 11:15:39,802 INFO L125 PetriNetUnfolderBase]: For 491/776 co-relation queries the response was YES. [2025-03-17 11:15:39,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1735 conditions, 1308 events. 157/1308 cut-off events. For 491/776 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 8560 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-17 11:15:39,809 INFO L140 encePairwiseOnDemand]: 90/97 looper letters, 13 selfloop transitions, 0 changer transitions 0/88 dead transitions. [2025-03-17 11:15:39,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 88 transitions, 242 flow [2025-03-17 11:15:39,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 11:15:39,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-17 11:15:39,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 172 transitions. [2025-03-17 11:15:39,810 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8865979381443299 [2025-03-17 11:15:39,810 INFO L175 Difference]: Start difference. First operand has 100 places, 97 transitions, 234 flow. Second operand 2 states and 172 transitions. [2025-03-17 11:15:39,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 88 transitions, 242 flow [2025-03-17 11:15:39,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 88 transitions, 242 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:15:39,811 INFO L231 Difference]: Finished difference. Result has 94 places, 88 transitions, 216 flow [2025-03-17 11:15:39,811 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-17 11:15:39,811 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -6 predicate places. [2025-03-17 11:15:39,811 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 88 transitions, 216 flow [2025-03-17 11:15:39,812 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-17 11:15:39,812 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:39,812 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-17 11:15:39,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 11:15:39,812 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-17 11:15:39,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:39,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1561559100, now seen corresponding path program 1 times [2025-03-17 11:15:39,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:39,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846259897] [2025-03-17 11:15:39,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:39,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:39,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 11:15:39,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 11:15:39,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:39,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:39,851 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-17 11:15:39,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:39,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846259897] [2025-03-17 11:15:39,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846259897] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:39,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:39,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:15:39,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066578656] [2025-03-17 11:15:39,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:39,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:15:39,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:39,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:15:39,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:15:39,867 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 97 [2025-03-17 11:15:39,867 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-17 11:15:39,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:39,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 97 [2025-03-17 11:15:39,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:40,044 INFO L124 PetriNetUnfolderBase]: 422/2882 cut-off events. [2025-03-17 11:15:40,045 INFO L125 PetriNetUnfolderBase]: For 531/531 co-relation queries the response was YES. [2025-03-17 11:15:40,051 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 23781 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-17 11:15:40,059 INFO L140 encePairwiseOnDemand]: 94/97 looper letters, 18 selfloop transitions, 2 changer transitions 3/90 dead transitions. [2025-03-17 11:15:40,059 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 90 transitions, 262 flow [2025-03-17 11:15:40,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:15:40,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:15:40,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 232 transitions. [2025-03-17 11:15:40,060 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7972508591065293 [2025-03-17 11:15:40,060 INFO L175 Difference]: Start difference. First operand has 94 places, 88 transitions, 216 flow. Second operand 3 states and 232 transitions. [2025-03-17 11:15:40,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 90 transitions, 262 flow [2025-03-17 11:15:40,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 90 transitions, 262 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:15:40,061 INFO L231 Difference]: Finished difference. Result has 97 places, 86 transitions, 222 flow [2025-03-17 11:15:40,062 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-17 11:15:40,062 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -3 predicate places. [2025-03-17 11:15:40,062 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 86 transitions, 222 flow [2025-03-17 11:15:40,062 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-17 11:15:40,062 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:40,062 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-17 11:15:40,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 11:15:40,062 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-17 11:15:40,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:40,063 INFO L85 PathProgramCache]: Analyzing trace with hash 954042518, now seen corresponding path program 1 times [2025-03-17 11:15:40,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:40,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282789071] [2025-03-17 11:15:40,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:40,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:40,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 11:15:40,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 11:15:40,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:40,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:40,168 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-17 11:15:40,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:40,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282789071] [2025-03-17 11:15:40,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282789071] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:40,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:40,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:15:40,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565017852] [2025-03-17 11:15:40,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:40,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:15:40,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:40,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:15:40,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:15:40,241 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 97 [2025-03-17 11:15:40,242 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-17 11:15:40,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:40,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 97 [2025-03-17 11:15:40,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:40,519 INFO L124 PetriNetUnfolderBase]: 1099/3285 cut-off events. [2025-03-17 11:15:40,519 INFO L125 PetriNetUnfolderBase]: For 513/513 co-relation queries the response was YES. [2025-03-17 11:15:40,526 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 24265 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-17 11:15:40,537 INFO L140 encePairwiseOnDemand]: 91/97 looper letters, 39 selfloop transitions, 6 changer transitions 2/101 dead transitions. [2025-03-17 11:15:40,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 101 transitions, 344 flow [2025-03-17 11:15:40,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:15:40,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:15:40,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 394 transitions. [2025-03-17 11:15:40,539 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6769759450171822 [2025-03-17 11:15:40,539 INFO L175 Difference]: Start difference. First operand has 97 places, 86 transitions, 222 flow. Second operand 6 states and 394 transitions. [2025-03-17 11:15:40,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 101 transitions, 344 flow [2025-03-17 11:15:40,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 101 transitions, 342 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:15:40,541 INFO L231 Difference]: Finished difference. Result has 97 places, 83 transitions, 226 flow [2025-03-17 11:15:40,541 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-17 11:15:40,542 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -3 predicate places. [2025-03-17 11:15:40,542 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 83 transitions, 226 flow [2025-03-17 11:15:40,542 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-17 11:15:40,542 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:40,542 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-17 11:15:40,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 11:15:40,543 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-17 11:15:40,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:40,543 INFO L85 PathProgramCache]: Analyzing trace with hash -470213326, now seen corresponding path program 1 times [2025-03-17 11:15:40,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:40,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288720222] [2025-03-17 11:15:40,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:40,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:40,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 11:15:40,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 11:15:40,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:40,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:40,577 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-17 11:15:40,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:40,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288720222] [2025-03-17 11:15:40,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288720222] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:40,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:40,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:15:40,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405512241] [2025-03-17 11:15:40,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:40,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:15:40,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:40,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:15:40,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:15:40,617 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 97 [2025-03-17 11:15:40,618 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-17 11:15:40,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:40,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 97 [2025-03-17 11:15:40,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:40,781 INFO L124 PetriNetUnfolderBase]: 408/2431 cut-off events. [2025-03-17 11:15:40,782 INFO L125 PetriNetUnfolderBase]: For 561/561 co-relation queries the response was YES. [2025-03-17 11:15:40,788 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 18978 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-17 11:15:40,795 INFO L140 encePairwiseOnDemand]: 92/97 looper letters, 25 selfloop transitions, 5 changer transitions 0/92 dead transitions. [2025-03-17 11:15:40,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 92 transitions, 308 flow [2025-03-17 11:15:40,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:15:40,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:15:40,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 439 transitions. [2025-03-17 11:15:40,796 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7542955326460481 [2025-03-17 11:15:40,796 INFO L175 Difference]: Start difference. First operand has 97 places, 83 transitions, 226 flow. Second operand 6 states and 439 transitions. [2025-03-17 11:15:40,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 92 transitions, 308 flow [2025-03-17 11:15:40,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 92 transitions, 294 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:15:40,798 INFO L231 Difference]: Finished difference. Result has 98 places, 86 transitions, 246 flow [2025-03-17 11:15:40,799 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-17 11:15:40,799 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -2 predicate places. [2025-03-17 11:15:40,799 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 86 transitions, 246 flow [2025-03-17 11:15:40,799 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-17 11:15:40,799 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:40,799 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-17 11:15:40,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-17 11:15:40,800 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-17 11:15:40,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:40,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1805058183, now seen corresponding path program 1 times [2025-03-17 11:15:40,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:40,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636927588] [2025-03-17 11:15:40,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:40,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:40,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-17 11:15:40,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-17 11:15:40,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:40,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:40,828 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-17 11:15:40,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:40,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636927588] [2025-03-17 11:15:40,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636927588] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:40,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:40,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:15:40,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814177830] [2025-03-17 11:15:40,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:40,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:15:40,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:40,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:15:40,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:15:40,831 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 97 [2025-03-17 11:15:40,831 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-17 11:15:40,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:40,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 97 [2025-03-17 11:15:40,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:41,029 INFO L124 PetriNetUnfolderBase]: 488/2976 cut-off events. [2025-03-17 11:15:41,030 INFO L125 PetriNetUnfolderBase]: For 910/1151 co-relation queries the response was YES. [2025-03-17 11:15:41,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4079 conditions, 2976 events. 488/2976 cut-off events. For 910/1151 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 25750 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-17 11:15:41,049 INFO L140 encePairwiseOnDemand]: 90/97 looper letters, 19 selfloop transitions, 6 changer transitions 0/95 dead transitions. [2025-03-17 11:15:41,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 95 transitions, 326 flow [2025-03-17 11:15:41,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:15:41,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:15:41,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 245 transitions. [2025-03-17 11:15:41,050 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8419243986254296 [2025-03-17 11:15:41,050 INFO L175 Difference]: Start difference. First operand has 98 places, 86 transitions, 246 flow. Second operand 3 states and 245 transitions. [2025-03-17 11:15:41,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 95 transitions, 326 flow [2025-03-17 11:15:41,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 95 transitions, 320 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-17 11:15:41,052 INFO L231 Difference]: Finished difference. Result has 100 places, 91 transitions, 286 flow [2025-03-17 11:15:41,052 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-17 11:15:41,053 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 0 predicate places. [2025-03-17 11:15:41,053 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 91 transitions, 286 flow [2025-03-17 11:15:41,053 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-17 11:15:41,053 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:41,053 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-17 11:15:41,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-17 11:15:41,053 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-17 11:15:41,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:41,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1500189933, now seen corresponding path program 1 times [2025-03-17 11:15:41,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:41,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627384604] [2025-03-17 11:15:41,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:41,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:41,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 11:15:41,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 11:15:41,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:41,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:41,117 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-17 11:15:41,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:41,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627384604] [2025-03-17 11:15:41,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627384604] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:41,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:41,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 11:15:41,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235342851] [2025-03-17 11:15:41,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:41,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 11:15:41,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:41,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 11:15:41,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:15:41,159 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 97 [2025-03-17 11:15:41,160 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-17 11:15:41,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:41,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 97 [2025-03-17 11:15:41,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:41,424 INFO L124 PetriNetUnfolderBase]: 704/3458 cut-off events. [2025-03-17 11:15:41,424 INFO L125 PetriNetUnfolderBase]: For 1842/1941 co-relation queries the response was YES. [2025-03-17 11:15:41,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5888 conditions, 3458 events. 704/3458 cut-off events. For 1842/1941 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 30104 event pairs, 123 based on Foata normal form. 4/3155 useless extension candidates. Maximal degree in co-relation 5875. Up to 942 conditions per place. [2025-03-17 11:15:41,438 INFO L140 encePairwiseOnDemand]: 92/97 looper letters, 36 selfloop transitions, 8 changer transitions 0/107 dead transitions. [2025-03-17 11:15:41,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 107 transitions, 440 flow [2025-03-17 11:15:41,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 11:15:41,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 11:15:41,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 653 transitions. [2025-03-17 11:15:41,440 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7479954180985109 [2025-03-17 11:15:41,440 INFO L175 Difference]: Start difference. First operand has 100 places, 91 transitions, 286 flow. Second operand 9 states and 653 transitions. [2025-03-17 11:15:41,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 107 transitions, 440 flow [2025-03-17 11:15:41,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 107 transitions, 428 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:15:41,444 INFO L231 Difference]: Finished difference. Result has 109 places, 94 transitions, 318 flow [2025-03-17 11:15:41,444 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-17 11:15:41,444 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 9 predicate places. [2025-03-17 11:15:41,444 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 94 transitions, 318 flow [2025-03-17 11:15:41,444 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-17 11:15:41,444 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:41,444 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-17 11:15:41,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-17 11:15:41,445 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-17 11:15:41,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:41,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1807460103, now seen corresponding path program 1 times [2025-03-17 11:15:41,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:41,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247472673] [2025-03-17 11:15:41,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:41,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:41,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-17 11:15:41,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-17 11:15:41,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:41,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:41,535 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-17 11:15:41,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:41,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247472673] [2025-03-17 11:15:41,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247472673] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:41,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:41,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 11:15:41,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744799301] [2025-03-17 11:15:41,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:41,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 11:15:41,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:41,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 11:15:41,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-17 11:15:41,581 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 97 [2025-03-17 11:15:41,581 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-17 11:15:41,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:41,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 97 [2025-03-17 11:15:41,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:41,867 INFO L124 PetriNetUnfolderBase]: 616/3345 cut-off events. [2025-03-17 11:15:41,867 INFO L125 PetriNetUnfolderBase]: For 1654/1730 co-relation queries the response was YES. [2025-03-17 11:15:41,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5455 conditions, 3345 events. 616/3345 cut-off events. For 1654/1730 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 28303 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-17 11:15:41,880 INFO L140 encePairwiseOnDemand]: 92/97 looper letters, 44 selfloop transitions, 11 changer transitions 0/118 dead transitions. [2025-03-17 11:15:41,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 118 transitions, 528 flow [2025-03-17 11:15:41,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 11:15:41,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-17 11:15:41,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 868 transitions. [2025-03-17 11:15:41,882 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7457044673539519 [2025-03-17 11:15:41,882 INFO L175 Difference]: Start difference. First operand has 109 places, 94 transitions, 318 flow. Second operand 12 states and 868 transitions. [2025-03-17 11:15:41,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 118 transitions, 528 flow [2025-03-17 11:15:41,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 118 transitions, 510 flow, removed 4 selfloop flow, removed 5 redundant places. [2025-03-17 11:15:41,886 INFO L231 Difference]: Finished difference. Result has 118 places, 96 transitions, 346 flow [2025-03-17 11:15:41,886 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-17 11:15:41,886 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 18 predicate places. [2025-03-17 11:15:41,886 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 96 transitions, 346 flow [2025-03-17 11:15:41,887 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-17 11:15:41,887 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:41,887 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-17 11:15:41,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-17 11:15:41,887 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-17 11:15:41,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:41,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1925466822, now seen corresponding path program 1 times [2025-03-17 11:15:41,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:41,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520943906] [2025-03-17 11:15:41,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:41,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:41,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-17 11:15:41,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-17 11:15:41,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:41,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:42,014 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-17 11:15:42,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:42,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520943906] [2025-03-17 11:15:42,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520943906] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:42,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:42,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 11:15:42,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779138616] [2025-03-17 11:15:42,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:42,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 11:15:42,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:42,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 11:15:42,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-17 11:15:42,068 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 97 [2025-03-17 11:15:42,069 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-17 11:15:42,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:42,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 97 [2025-03-17 11:15:42,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:42,204 INFO L124 PetriNetUnfolderBase]: 181/716 cut-off events. [2025-03-17 11:15:42,204 INFO L125 PetriNetUnfolderBase]: For 820/820 co-relation queries the response was YES. [2025-03-17 11:15:42,207 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-17 11:15:42,209 INFO L140 encePairwiseOnDemand]: 92/97 looper letters, 40 selfloop transitions, 13 changer transitions 0/92 dead transitions. [2025-03-17 11:15:42,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 92 transitions, 468 flow [2025-03-17 11:15:42,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 11:15:42,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-17 11:15:42,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1074 transitions. [2025-03-17 11:15:42,213 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7381443298969073 [2025-03-17 11:15:42,213 INFO L175 Difference]: Start difference. First operand has 118 places, 96 transitions, 346 flow. Second operand 15 states and 1074 transitions. [2025-03-17 11:15:42,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 92 transitions, 468 flow [2025-03-17 11:15:42,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 92 transitions, 424 flow, removed 10 selfloop flow, removed 12 redundant places. [2025-03-17 11:15:42,216 INFO L231 Difference]: Finished difference. Result has 94 places, 62 transitions, 224 flow [2025-03-17 11:15:42,216 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-17 11:15:42,216 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -6 predicate places. [2025-03-17 11:15:42,217 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 62 transitions, 224 flow [2025-03-17 11:15:42,217 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-17 11:15:42,217 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:42,217 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-17 11:15:42,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-17 11:15:42,217 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-17 11:15:42,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:42,218 INFO L85 PathProgramCache]: Analyzing trace with hash -872361339, now seen corresponding path program 1 times [2025-03-17 11:15:42,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:42,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167614315] [2025-03-17 11:15:42,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:42,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:42,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-17 11:15:42,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-17 11:15:42,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:42,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:15:42,238 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 11:15:42,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-17 11:15:42,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-17 11:15:42,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:42,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:15:42,260 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 11:15:42,261 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 11:15:42,261 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-03-17 11:15:42,261 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2025-03-17 11:15:42,261 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2025-03-17 11:15:42,261 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2025-03-17 11:15:42,261 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2025-03-17 11:15:42,261 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2025-03-17 11:15:42,261 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2025-03-17 11:15:42,261 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2025-03-17 11:15:42,261 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2025-03-17 11:15:42,261 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2025-03-17 11:15:42,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-17 11:15:42,261 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:15:42,262 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 11:15:42,262 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-03-17 11:15:42,290 INFO L143 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2025-03-17 11:15:42,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 105 transitions, 265 flow [2025-03-17 11:15:42,343 INFO L124 PetriNetUnfolderBase]: 66/934 cut-off events. [2025-03-17 11:15:42,343 INFO L125 PetriNetUnfolderBase]: For 110/110 co-relation queries the response was YES. [2025-03-17 11:15:42,346 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 4458 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-17 11:15:42,347 INFO L82 GeneralOperation]: Start removeDead. Operand has 109 places, 105 transitions, 265 flow [2025-03-17 11:15:42,350 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 109 places, 105 transitions, 265 flow [2025-03-17 11:15:42,351 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:15:42,351 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;@133872e1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:15:42,351 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-03-17 11:15:42,353 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:15:42,353 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-03-17 11:15:42,353 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:15:42,353 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:42,353 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:15:42,353 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-17 11:15:42,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:42,353 INFO L85 PathProgramCache]: Analyzing trace with hash 921893900, now seen corresponding path program 1 times [2025-03-17 11:15:42,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:42,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619321688] [2025-03-17 11:15:42,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:42,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:42,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 11:15:42,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 11:15:42,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:42,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:42,362 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-17 11:15:42,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:42,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619321688] [2025-03-17 11:15:42,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619321688] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:42,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:42,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 11:15:42,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904731264] [2025-03-17 11:15:42,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:42,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 11:15:42,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:42,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 11:15:42,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 11:15:42,363 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 105 [2025-03-17 11:15:42,363 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-17 11:15:42,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:42,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 105 [2025-03-17 11:15:42,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:42,645 INFO L124 PetriNetUnfolderBase]: 622/3788 cut-off events. [2025-03-17 11:15:42,646 INFO L125 PetriNetUnfolderBase]: For 1730/3036 co-relation queries the response was YES. [2025-03-17 11:15:42,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5251 conditions, 3788 events. 622/3788 cut-off events. For 1730/3036 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 33552 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-17 11:15:42,666 INFO L140 encePairwiseOnDemand]: 97/105 looper letters, 16 selfloop transitions, 0 changer transitions 0/95 dead transitions. [2025-03-17 11:15:42,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 95 transitions, 277 flow [2025-03-17 11:15:42,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 11:15:42,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-17 11:15:42,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 184 transitions. [2025-03-17 11:15:42,667 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8761904761904762 [2025-03-17 11:15:42,667 INFO L175 Difference]: Start difference. First operand has 109 places, 105 transitions, 265 flow. Second operand 2 states and 184 transitions. [2025-03-17 11:15:42,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 95 transitions, 277 flow [2025-03-17 11:15:42,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 95 transitions, 277 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:15:42,669 INFO L231 Difference]: Finished difference. Result has 102 places, 95 transitions, 245 flow [2025-03-17 11:15:42,669 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-17 11:15:42,670 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, -7 predicate places. [2025-03-17 11:15:42,670 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 95 transitions, 245 flow [2025-03-17 11:15:42,670 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-17 11:15:42,670 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:42,670 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-17 11:15:42,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-17 11:15:42,670 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-17 11:15:42,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:42,671 INFO L85 PathProgramCache]: Analyzing trace with hash -2016809339, now seen corresponding path program 1 times [2025-03-17 11:15:42,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:42,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920541131] [2025-03-17 11:15:42,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:42,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:42,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 11:15:42,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 11:15:42,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:42,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:42,686 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-17 11:15:42,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:42,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920541131] [2025-03-17 11:15:42,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920541131] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:42,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:42,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:15:42,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708344666] [2025-03-17 11:15:42,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:42,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:15:42,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:42,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:15:42,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:15:42,703 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 105 [2025-03-17 11:15:42,703 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-17 11:15:42,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:42,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 105 [2025-03-17 11:15:42,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:43,173 INFO L124 PetriNetUnfolderBase]: 1439/8085 cut-off events. [2025-03-17 11:15:43,173 INFO L125 PetriNetUnfolderBase]: For 1886/1886 co-relation queries the response was YES. [2025-03-17 11:15:43,189 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 81597 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-17 11:15:43,201 INFO L140 encePairwiseOnDemand]: 102/105 looper letters, 21 selfloop transitions, 2 changer transitions 3/97 dead transitions. [2025-03-17 11:15:43,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 97 transitions, 297 flow [2025-03-17 11:15:43,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:15:43,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:15:43,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 247 transitions. [2025-03-17 11:15:43,202 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7841269841269841 [2025-03-17 11:15:43,202 INFO L175 Difference]: Start difference. First operand has 102 places, 95 transitions, 245 flow. Second operand 3 states and 247 transitions. [2025-03-17 11:15:43,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 97 transitions, 297 flow [2025-03-17 11:15:43,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 97 transitions, 297 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:15:43,204 INFO L231 Difference]: Finished difference. Result has 105 places, 93 transitions, 251 flow [2025-03-17 11:15:43,204 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-17 11:15:43,204 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, -4 predicate places. [2025-03-17 11:15:43,204 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 93 transitions, 251 flow [2025-03-17 11:15:43,204 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-17 11:15:43,205 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:43,205 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-17 11:15:43,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-17 11:15:43,205 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-17 11:15:43,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:43,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1084871809, now seen corresponding path program 1 times [2025-03-17 11:15:43,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:43,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536229279] [2025-03-17 11:15:43,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:43,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:43,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 11:15:43,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 11:15:43,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:43,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:43,302 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-17 11:15:43,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:43,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536229279] [2025-03-17 11:15:43,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536229279] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:43,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:43,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:15:43,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496733580] [2025-03-17 11:15:43,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:43,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:15:43,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:43,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:15:43,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:15:43,369 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 105 [2025-03-17 11:15:43,369 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-17 11:15:43,370 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:43,370 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 105 [2025-03-17 11:15:43,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:43,961 INFO L124 PetriNetUnfolderBase]: 3704/9558 cut-off events. [2025-03-17 11:15:43,961 INFO L125 PetriNetUnfolderBase]: For 1820/1820 co-relation queries the response was YES. [2025-03-17 11:15:43,990 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 80999 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-17 11:15:44,020 INFO L140 encePairwiseOnDemand]: 99/105 looper letters, 46 selfloop transitions, 6 changer transitions 2/112 dead transitions. [2025-03-17 11:15:44,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 112 transitions, 395 flow [2025-03-17 11:15:44,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:15:44,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:15:44,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 425 transitions. [2025-03-17 11:15:44,021 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6746031746031746 [2025-03-17 11:15:44,021 INFO L175 Difference]: Start difference. First operand has 105 places, 93 transitions, 251 flow. Second operand 6 states and 425 transitions. [2025-03-17 11:15:44,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 112 transitions, 395 flow [2025-03-17 11:15:44,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 112 transitions, 393 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:15:44,024 INFO L231 Difference]: Finished difference. Result has 105 places, 90 transitions, 255 flow [2025-03-17 11:15:44,024 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-17 11:15:44,025 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, -4 predicate places. [2025-03-17 11:15:44,025 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 90 transitions, 255 flow [2025-03-17 11:15:44,025 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-17 11:15:44,025 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:44,025 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-17 11:15:44,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-17 11:15:44,026 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-17 11:15:44,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:44,026 INFO L85 PathProgramCache]: Analyzing trace with hash 690968789, now seen corresponding path program 1 times [2025-03-17 11:15:44,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:44,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244879365] [2025-03-17 11:15:44,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:44,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:44,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 11:15:44,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 11:15:44,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:44,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:44,068 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-17 11:15:44,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:44,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244879365] [2025-03-17 11:15:44,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244879365] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:44,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:44,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:15:44,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698031015] [2025-03-17 11:15:44,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:44,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:15:44,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:44,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:15:44,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:15:44,102 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 105 [2025-03-17 11:15:44,103 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-17 11:15:44,103 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:44,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 105 [2025-03-17 11:15:44,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:44,505 INFO L124 PetriNetUnfolderBase]: 1288/6671 cut-off events. [2025-03-17 11:15:44,505 INFO L125 PetriNetUnfolderBase]: For 1950/1950 co-relation queries the response was YES. [2025-03-17 11:15:44,527 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 63364 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-17 11:15:44,539 INFO L140 encePairwiseOnDemand]: 100/105 looper letters, 28 selfloop transitions, 5 changer transitions 0/99 dead transitions. [2025-03-17 11:15:44,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 99 transitions, 343 flow [2025-03-17 11:15:44,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:15:44,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:15:44,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 466 transitions. [2025-03-17 11:15:44,541 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7396825396825397 [2025-03-17 11:15:44,541 INFO L175 Difference]: Start difference. First operand has 105 places, 90 transitions, 255 flow. Second operand 6 states and 466 transitions. [2025-03-17 11:15:44,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 99 transitions, 343 flow [2025-03-17 11:15:44,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 99 transitions, 329 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:15:44,543 INFO L231 Difference]: Finished difference. Result has 106 places, 93 transitions, 275 flow [2025-03-17 11:15:44,544 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-17 11:15:44,544 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, -3 predicate places. [2025-03-17 11:15:44,544 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 93 transitions, 275 flow [2025-03-17 11:15:44,544 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-17 11:15:44,544 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:44,544 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-17 11:15:44,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-17 11:15:44,545 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-17 11:15:44,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:44,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1279632388, now seen corresponding path program 1 times [2025-03-17 11:15:44,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:44,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365254704] [2025-03-17 11:15:44,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:44,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:44,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-17 11:15:44,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-17 11:15:44,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:44,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:44,562 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-17 11:15:44,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:44,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365254704] [2025-03-17 11:15:44,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365254704] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:44,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:44,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:15:44,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137603003] [2025-03-17 11:15:44,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:44,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:15:44,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:44,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:15:44,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:15:44,565 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 105 [2025-03-17 11:15:44,565 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-17 11:15:44,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:44,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 105 [2025-03-17 11:15:44,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:45,132 INFO L124 PetriNetUnfolderBase]: 1754/8829 cut-off events. [2025-03-17 11:15:45,132 INFO L125 PetriNetUnfolderBase]: For 3134/3973 co-relation queries the response was YES. [2025-03-17 11:15:45,150 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 92426 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-17 11:15:45,163 INFO L140 encePairwiseOnDemand]: 97/105 looper letters, 23 selfloop transitions, 7 changer transitions 0/104 dead transitions. [2025-03-17 11:15:45,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 104 transitions, 372 flow [2025-03-17 11:15:45,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:15:45,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:15:45,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 262 transitions. [2025-03-17 11:15:45,164 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8317460317460318 [2025-03-17 11:15:45,164 INFO L175 Difference]: Start difference. First operand has 106 places, 93 transitions, 275 flow. Second operand 3 states and 262 transitions. [2025-03-17 11:15:45,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 104 transitions, 372 flow [2025-03-17 11:15:45,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 104 transitions, 366 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-17 11:15:45,167 INFO L231 Difference]: Finished difference. Result has 108 places, 99 transitions, 323 flow [2025-03-17 11:15:45,167 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-17 11:15:45,167 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, -1 predicate places. [2025-03-17 11:15:45,167 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 99 transitions, 323 flow [2025-03-17 11:15:45,167 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-17 11:15:45,167 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:45,168 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-17 11:15:45,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-17 11:15:45,168 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-17 11:15:45,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:45,168 INFO L85 PathProgramCache]: Analyzing trace with hash -598922721, now seen corresponding path program 1 times [2025-03-17 11:15:45,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:45,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352759690] [2025-03-17 11:15:45,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:45,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:45,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 11:15:45,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 11:15:45,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:45,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:45,217 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-17 11:15:45,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:45,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352759690] [2025-03-17 11:15:45,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352759690] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:45,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:45,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 11:15:45,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250176371] [2025-03-17 11:15:45,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:45,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 11:15:45,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:45,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 11:15:45,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:15:45,249 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 105 [2025-03-17 11:15:45,249 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-17 11:15:45,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:45,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 105 [2025-03-17 11:15:45,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:46,011 INFO L124 PetriNetUnfolderBase]: 2370/9833 cut-off events. [2025-03-17 11:15:46,011 INFO L125 PetriNetUnfolderBase]: For 6093/6429 co-relation queries the response was YES. [2025-03-17 11:15:46,039 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 99764 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-17 11:15:46,063 INFO L140 encePairwiseOnDemand]: 100/105 looper letters, 40 selfloop transitions, 8 changer transitions 0/115 dead transitions. [2025-03-17 11:15:46,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 115 transitions, 485 flow [2025-03-17 11:15:46,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 11:15:46,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 11:15:46,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 692 transitions. [2025-03-17 11:15:46,064 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7322751322751323 [2025-03-17 11:15:46,064 INFO L175 Difference]: Start difference. First operand has 108 places, 99 transitions, 323 flow. Second operand 9 states and 692 transitions. [2025-03-17 11:15:46,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 115 transitions, 485 flow [2025-03-17 11:15:46,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 115 transitions, 471 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:15:46,071 INFO L231 Difference]: Finished difference. Result has 117 places, 102 transitions, 353 flow [2025-03-17 11:15:46,071 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-17 11:15:46,072 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, 8 predicate places. [2025-03-17 11:15:46,072 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 102 transitions, 353 flow [2025-03-17 11:15:46,072 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-17 11:15:46,072 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:46,072 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-17 11:15:46,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-17 11:15:46,072 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-17 11:15:46,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:46,073 INFO L85 PathProgramCache]: Analyzing trace with hash -253528687, now seen corresponding path program 1 times [2025-03-17 11:15:46,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:46,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145921438] [2025-03-17 11:15:46,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:46,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:46,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-17 11:15:46,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-17 11:15:46,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:46,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:46,165 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-17 11:15:46,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:46,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145921438] [2025-03-17 11:15:46,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145921438] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:46,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:46,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 11:15:46,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122201538] [2025-03-17 11:15:46,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:46,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 11:15:46,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:46,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 11:15:46,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-17 11:15:46,206 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 105 [2025-03-17 11:15:46,207 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-17 11:15:46,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:46,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 105 [2025-03-17 11:15:46,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:46,906 INFO L124 PetriNetUnfolderBase]: 2282/9674 cut-off events. [2025-03-17 11:15:46,906 INFO L125 PetriNetUnfolderBase]: For 5443/5756 co-relation queries the response was YES. [2025-03-17 11:15:46,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16481 conditions, 9674 events. 2282/9674 cut-off events. For 5443/5756 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 100134 event pairs, 632 based on Foata normal form. 8/8710 useless extension candidates. Maximal degree in co-relation 16464. Up to 2876 conditions per place. [2025-03-17 11:15:46,953 INFO L140 encePairwiseOnDemand]: 100/105 looper letters, 50 selfloop transitions, 11 changer transitions 0/128 dead transitions. [2025-03-17 11:15:46,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 128 transitions, 589 flow [2025-03-17 11:15:46,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 11:15:46,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-17 11:15:46,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 921 transitions. [2025-03-17 11:15:46,955 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7309523809523809 [2025-03-17 11:15:46,955 INFO L175 Difference]: Start difference. First operand has 117 places, 102 transitions, 353 flow. Second operand 12 states and 921 transitions. [2025-03-17 11:15:46,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 128 transitions, 589 flow [2025-03-17 11:15:46,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 128 transitions, 571 flow, removed 4 selfloop flow, removed 5 redundant places. [2025-03-17 11:15:46,958 INFO L231 Difference]: Finished difference. Result has 126 places, 105 transitions, 391 flow [2025-03-17 11:15:46,958 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-17 11:15:46,959 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, 17 predicate places. [2025-03-17 11:15:46,959 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 105 transitions, 391 flow [2025-03-17 11:15:46,959 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-17 11:15:46,959 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:46,959 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-17 11:15:46,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-17 11:15:46,959 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-17 11:15:46,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:46,960 INFO L85 PathProgramCache]: Analyzing trace with hash 666141764, now seen corresponding path program 1 times [2025-03-17 11:15:46,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:46,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22029279] [2025-03-17 11:15:46,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:46,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:46,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-17 11:15:46,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-17 11:15:46,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:46,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:47,048 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-17 11:15:47,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:47,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22029279] [2025-03-17 11:15:47,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22029279] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:47,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:47,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 11:15:47,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127517531] [2025-03-17 11:15:47,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:47,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 11:15:47,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:47,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 11:15:47,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-17 11:15:47,118 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 105 [2025-03-17 11:15:47,119 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-17 11:15:47,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:47,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 105 [2025-03-17 11:15:47,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:47,809 INFO L124 PetriNetUnfolderBase]: 2037/9561 cut-off events. [2025-03-17 11:15:47,809 INFO L125 PetriNetUnfolderBase]: For 5627/5864 co-relation queries the response was YES. [2025-03-17 11:15:47,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15953 conditions, 9561 events. 2037/9561 cut-off events. For 5627/5864 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 99186 event pairs, 494 based on Foata normal form. 16/8628 useless extension candidates. Maximal degree in co-relation 15933. Up to 2296 conditions per place. [2025-03-17 11:15:47,863 INFO L140 encePairwiseOnDemand]: 100/105 looper letters, 61 selfloop transitions, 14 changer transitions 0/142 dead transitions. [2025-03-17 11:15:47,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 142 transitions, 697 flow [2025-03-17 11:15:47,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 11:15:47,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-17 11:15:47,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1151 transitions. [2025-03-17 11:15:47,864 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7307936507936508 [2025-03-17 11:15:47,864 INFO L175 Difference]: Start difference. First operand has 126 places, 105 transitions, 391 flow. Second operand 15 states and 1151 transitions. [2025-03-17 11:15:47,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 142 transitions, 697 flow [2025-03-17 11:15:47,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 142 transitions, 667 flow, removed 7 selfloop flow, removed 8 redundant places. [2025-03-17 11:15:47,868 INFO L231 Difference]: Finished difference. Result has 135 places, 107 transitions, 417 flow [2025-03-17 11:15:47,868 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-17 11:15:47,868 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, 26 predicate places. [2025-03-17 11:15:47,869 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 107 transitions, 417 flow [2025-03-17 11:15:47,869 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-17 11:15:47,869 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:47,869 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-17 11:15:47,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-17 11:15:47,869 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-17 11:15:47,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:47,869 INFO L85 PathProgramCache]: Analyzing trace with hash 161660950, now seen corresponding path program 1 times [2025-03-17 11:15:47,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:47,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734924782] [2025-03-17 11:15:47,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:47,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:47,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-17 11:15:47,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-17 11:15:47,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:47,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:47,993 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-17 11:15:47,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:47,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734924782] [2025-03-17 11:15:47,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734924782] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:47,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:47,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 11:15:47,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586430102] [2025-03-17 11:15:47,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:47,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 11:15:47,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:47,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 11:15:47,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-03-17 11:15:48,074 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 105 [2025-03-17 11:15:48,075 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-17 11:15:48,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:48,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 105 [2025-03-17 11:15:48,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:48,280 INFO L124 PetriNetUnfolderBase]: 485/1596 cut-off events. [2025-03-17 11:15:48,281 INFO L125 PetriNetUnfolderBase]: For 2656/2656 co-relation queries the response was YES. [2025-03-17 11:15:48,284 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 10113 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-17 11:15:48,287 INFO L140 encePairwiseOnDemand]: 100/105 looper letters, 57 selfloop transitions, 16 changer transitions 0/116 dead transitions. [2025-03-17 11:15:48,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 116 transitions, 628 flow [2025-03-17 11:15:48,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 11:15:48,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-17 11:15:48,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1370 transitions. [2025-03-17 11:15:48,288 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7248677248677249 [2025-03-17 11:15:48,288 INFO L175 Difference]: Start difference. First operand has 135 places, 107 transitions, 417 flow. Second operand 18 states and 1370 transitions. [2025-03-17 11:15:48,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 116 transitions, 628 flow [2025-03-17 11:15:48,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 116 transitions, 564 flow, removed 16 selfloop flow, removed 16 redundant places. [2025-03-17 11:15:48,291 INFO L231 Difference]: Finished difference. Result has 110 places, 71 transitions, 270 flow [2025-03-17 11:15:48,291 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-17 11:15:48,292 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, 1 predicate places. [2025-03-17 11:15:48,292 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 71 transitions, 270 flow [2025-03-17 11:15:48,292 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-17 11:15:48,292 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:48,292 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-17 11:15:48,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-17 11:15:48,292 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-17 11:15:48,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:48,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1746814455, now seen corresponding path program 1 times [2025-03-17 11:15:48,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:48,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163986276] [2025-03-17 11:15:48,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:48,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:48,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-17 11:15:48,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-17 11:15:48,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:48,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:15:48,308 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 11:15:48,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-17 11:15:48,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-17 11:15:48,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:48,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:15:48,322 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 11:15:48,322 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 11:15:48,322 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2025-03-17 11:15:48,323 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2025-03-17 11:15:48,323 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2025-03-17 11:15:48,323 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2025-03-17 11:15:48,323 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2025-03-17 11:15:48,323 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining) [2025-03-17 11:15:48,323 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2025-03-17 11:15:48,323 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2025-03-17 11:15:48,323 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2025-03-17 11:15:48,323 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2025-03-17 11:15:48,323 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2025-03-17 11:15:48,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-17 11:15:48,323 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:15:48,324 WARN L246 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 11:15:48,324 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2025-03-17 11:15:48,336 INFO L143 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2025-03-17 11:15:48,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 113 transitions, 298 flow [2025-03-17 11:15:48,415 INFO L124 PetriNetUnfolderBase]: 149/1721 cut-off events. [2025-03-17 11:15:48,415 INFO L125 PetriNetUnfolderBase]: For 242/242 co-relation queries the response was YES. [2025-03-17 11:15:48,418 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 10535 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-17 11:15:48,418 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 113 transitions, 298 flow [2025-03-17 11:15:48,420 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 113 transitions, 298 flow [2025-03-17 11:15:48,421 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:15:48,421 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;@133872e1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:15:48,421 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-03-17 11:15:48,421 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:15:48,422 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-03-17 11:15:48,422 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:15:48,422 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:48,422 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:15:48,422 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-17 11:15:48,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:48,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1846429972, now seen corresponding path program 1 times [2025-03-17 11:15:48,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:48,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994935133] [2025-03-17 11:15:48,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:48,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:48,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 11:15:48,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 11:15:48,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:48,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:48,427 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-17 11:15:48,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:48,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994935133] [2025-03-17 11:15:48,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994935133] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:48,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:48,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 11:15:48,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476802955] [2025-03-17 11:15:48,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:48,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 11:15:48,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:48,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 11:15:48,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 11:15:48,427 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 113 [2025-03-17 11:15:48,428 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-17 11:15:48,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:48,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 113 [2025-03-17 11:15:48,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:49,120 INFO L124 PetriNetUnfolderBase]: 2323/11440 cut-off events. [2025-03-17 11:15:49,120 INFO L125 PetriNetUnfolderBase]: For 5697/11023 co-relation queries the response was YES. [2025-03-17 11:15:49,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16399 conditions, 11440 events. 2323/11440 cut-off events. For 5697/11023 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 126140 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-17 11:15:49,170 INFO L140 encePairwiseOnDemand]: 104/113 looper letters, 19 selfloop transitions, 0 changer transitions 0/102 dead transitions. [2025-03-17 11:15:49,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 102 transitions, 314 flow [2025-03-17 11:15:49,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 11:15:49,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-17 11:15:49,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 196 transitions. [2025-03-17 11:15:49,171 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8672566371681416 [2025-03-17 11:15:49,171 INFO L175 Difference]: Start difference. First operand has 118 places, 113 transitions, 298 flow. Second operand 2 states and 196 transitions. [2025-03-17 11:15:49,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 102 transitions, 314 flow [2025-03-17 11:15:49,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 102 transitions, 314 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:15:49,174 INFO L231 Difference]: Finished difference. Result has 110 places, 102 transitions, 276 flow [2025-03-17 11:15:49,174 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-17 11:15:49,175 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, -8 predicate places. [2025-03-17 11:15:49,175 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 102 transitions, 276 flow [2025-03-17 11:15:49,175 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-17 11:15:49,175 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:49,175 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-17 11:15:49,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-17 11:15:49,175 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-17 11:15:49,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:49,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1167750102, now seen corresponding path program 1 times [2025-03-17 11:15:49,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:49,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253107391] [2025-03-17 11:15:49,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:49,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:49,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 11:15:49,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 11:15:49,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:49,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:49,186 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-17 11:15:49,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:49,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253107391] [2025-03-17 11:15:49,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253107391] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:49,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:49,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:15:49,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586145312] [2025-03-17 11:15:49,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:49,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:15:49,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:49,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:15:49,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:15:49,202 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 113 [2025-03-17 11:15:49,203 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-17 11:15:49,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:49,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 113 [2025-03-17 11:15:49,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:51,120 INFO L124 PetriNetUnfolderBase]: 4800/23220 cut-off events. [2025-03-17 11:15:51,120 INFO L125 PetriNetUnfolderBase]: For 6357/6357 co-relation queries the response was YES. [2025-03-17 11:15:51,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31710 conditions, 23220 events. 4800/23220 cut-off events. For 6357/6357 co-relation queries the response was YES. Maximal size of possible extension queue 458. Compared 277665 event pairs, 3732 based on Foata normal form. 1/21322 useless extension candidates. Maximal degree in co-relation 31701. Up to 6637 conditions per place. [2025-03-17 11:15:51,200 INFO L140 encePairwiseOnDemand]: 110/113 looper letters, 24 selfloop transitions, 2 changer transitions 3/104 dead transitions. [2025-03-17 11:15:51,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 104 transitions, 334 flow [2025-03-17 11:15:51,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:15:51,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:15:51,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 262 transitions. [2025-03-17 11:15:51,201 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7728613569321534 [2025-03-17 11:15:51,201 INFO L175 Difference]: Start difference. First operand has 110 places, 102 transitions, 276 flow. Second operand 3 states and 262 transitions. [2025-03-17 11:15:51,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 104 transitions, 334 flow [2025-03-17 11:15:51,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 104 transitions, 334 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:15:51,203 INFO L231 Difference]: Finished difference. Result has 113 places, 100 transitions, 282 flow [2025-03-17 11:15:51,203 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-17 11:15:51,203 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, -5 predicate places. [2025-03-17 11:15:51,204 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 100 transitions, 282 flow [2025-03-17 11:15:51,204 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-17 11:15:51,204 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:51,204 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:15:51,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-17 11:15:51,204 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-17 11:15:51,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:51,204 INFO L85 PathProgramCache]: Analyzing trace with hash 34128496, now seen corresponding path program 1 times [2025-03-17 11:15:51,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:51,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508775657] [2025-03-17 11:15:51,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:51,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:51,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 11:15:51,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 11:15:51,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:51,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:51,291 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-17 11:15:51,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:51,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508775657] [2025-03-17 11:15:51,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508775657] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:51,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:51,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:15:51,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623015516] [2025-03-17 11:15:51,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:51,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:15:51,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:51,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:15:51,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:15:51,354 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 113 [2025-03-17 11:15:51,355 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-17 11:15:51,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:51,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 113 [2025-03-17 11:15:51,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:53,399 INFO L124 PetriNetUnfolderBase]: 12237/28343 cut-off events. [2025-03-17 11:15:53,399 INFO L125 PetriNetUnfolderBase]: For 6163/6163 co-relation queries the response was YES. [2025-03-17 11:15:53,488 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 269556 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-17 11:15:53,548 INFO L140 encePairwiseOnDemand]: 107/113 looper letters, 53 selfloop transitions, 6 changer transitions 2/123 dead transitions. [2025-03-17 11:15:53,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 123 transitions, 448 flow [2025-03-17 11:15:53,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:15:53,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:15:53,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 456 transitions. [2025-03-17 11:15:53,549 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.672566371681416 [2025-03-17 11:15:53,549 INFO L175 Difference]: Start difference. First operand has 113 places, 100 transitions, 282 flow. Second operand 6 states and 456 transitions. [2025-03-17 11:15:53,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 123 transitions, 448 flow [2025-03-17 11:15:53,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 123 transitions, 446 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:15:53,551 INFO L231 Difference]: Finished difference. Result has 113 places, 97 transitions, 286 flow [2025-03-17 11:15:53,551 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-17 11:15:53,551 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, -5 predicate places. [2025-03-17 11:15:53,552 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 97 transitions, 286 flow [2025-03-17 11:15:53,552 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-17 11:15:53,552 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:53,552 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-17 11:15:53,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-17 11:15:53,552 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-17 11:15:53,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:53,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1310358400, now seen corresponding path program 1 times [2025-03-17 11:15:53,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:53,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470142105] [2025-03-17 11:15:53,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:53,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:53,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 11:15:53,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 11:15:53,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:53,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:53,580 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-17 11:15:53,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:53,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470142105] [2025-03-17 11:15:53,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470142105] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:53,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:53,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:15:53,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960646589] [2025-03-17 11:15:53,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:53,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:15:53,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:53,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:15:53,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:15:53,602 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 113 [2025-03-17 11:15:53,602 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-17 11:15:53,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:53,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 113 [2025-03-17 11:15:53,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:55,107 INFO L124 PetriNetUnfolderBase]: 3980/18675 cut-off events. [2025-03-17 11:15:55,108 INFO L125 PetriNetUnfolderBase]: For 6485/6485 co-relation queries the response was YES. [2025-03-17 11:15:55,173 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 211417 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-17 11:15:55,223 INFO L140 encePairwiseOnDemand]: 108/113 looper letters, 31 selfloop transitions, 5 changer transitions 0/106 dead transitions. [2025-03-17 11:15:55,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 106 transitions, 380 flow [2025-03-17 11:15:55,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:15:55,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:15:55,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 493 transitions. [2025-03-17 11:15:55,224 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7271386430678466 [2025-03-17 11:15:55,224 INFO L175 Difference]: Start difference. First operand has 113 places, 97 transitions, 286 flow. Second operand 6 states and 493 transitions. [2025-03-17 11:15:55,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 106 transitions, 380 flow [2025-03-17 11:15:55,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 106 transitions, 366 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:15:55,229 INFO L231 Difference]: Finished difference. Result has 114 places, 100 transitions, 306 flow [2025-03-17 11:15:55,229 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-17 11:15:55,230 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, -4 predicate places. [2025-03-17 11:15:55,230 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 100 transitions, 306 flow [2025-03-17 11:15:55,230 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-17 11:15:55,230 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:55,230 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-17 11:15:55,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-17 11:15:55,230 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-17 11:15:55,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:55,230 INFO L85 PathProgramCache]: Analyzing trace with hash 153768073, now seen corresponding path program 1 times [2025-03-17 11:15:55,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:55,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597779829] [2025-03-17 11:15:55,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:55,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:55,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-17 11:15:55,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-17 11:15:55,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:55,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:55,258 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-17 11:15:55,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:55,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597779829] [2025-03-17 11:15:55,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597779829] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:55,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:55,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:15:55,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144723098] [2025-03-17 11:15:55,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:55,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:15:55,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:55,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:15:55,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:15:55,260 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 113 [2025-03-17 11:15:55,261 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-17 11:15:55,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:55,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 113 [2025-03-17 11:15:55,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:57,491 INFO L124 PetriNetUnfolderBase]: 5985/26381 cut-off events. [2025-03-17 11:15:57,491 INFO L125 PetriNetUnfolderBase]: For 10449/13035 co-relation queries the response was YES. [2025-03-17 11:15:57,564 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 324550 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-17 11:15:57,611 INFO L140 encePairwiseOnDemand]: 104/113 looper letters, 27 selfloop transitions, 8 changer transitions 0/113 dead transitions. [2025-03-17 11:15:57,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 113 transitions, 420 flow [2025-03-17 11:15:57,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:15:57,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:15:57,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 279 transitions. [2025-03-17 11:15:57,611 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8230088495575221 [2025-03-17 11:15:57,611 INFO L175 Difference]: Start difference. First operand has 114 places, 100 transitions, 306 flow. Second operand 3 states and 279 transitions. [2025-03-17 11:15:57,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 113 transitions, 420 flow [2025-03-17 11:15:57,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 113 transitions, 414 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-17 11:15:57,619 INFO L231 Difference]: Finished difference. Result has 116 places, 107 transitions, 362 flow [2025-03-17 11:15:57,619 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-17 11:15:57,619 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, -2 predicate places. [2025-03-17 11:15:57,619 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 107 transitions, 362 flow [2025-03-17 11:15:57,619 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-17 11:15:57,619 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:57,619 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-17 11:15:57,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-17 11:15:57,619 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-17 11:15:57,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:57,620 INFO L85 PathProgramCache]: Analyzing trace with hash 784753645, now seen corresponding path program 1 times [2025-03-17 11:15:57,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:57,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725387449] [2025-03-17 11:15:57,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:57,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:57,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 11:15:57,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 11:15:57,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:57,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:57,665 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-17 11:15:57,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:57,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725387449] [2025-03-17 11:15:57,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725387449] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:57,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:57,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 11:15:57,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691086534] [2025-03-17 11:15:57,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:57,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 11:15:57,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:57,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 11:15:57,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:15:57,700 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 113 [2025-03-17 11:15:57,701 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-17 11:15:57,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:57,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 113 [2025-03-17 11:15:57,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:59,949 INFO L124 PetriNetUnfolderBase]: 7561/28064 cut-off events. [2025-03-17 11:15:59,949 INFO L125 PetriNetUnfolderBase]: For 19957/21015 co-relation queries the response was YES. [2025-03-17 11:16:00,030 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 326613 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-17 11:16:00,113 INFO L140 encePairwiseOnDemand]: 108/113 looper letters, 44 selfloop transitions, 8 changer transitions 0/123 dead transitions. [2025-03-17 11:16:00,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 123 transitions, 532 flow [2025-03-17 11:16:00,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 11:16:00,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 11:16:00,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 731 transitions. [2025-03-17 11:16:00,114 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7187807276302851 [2025-03-17 11:16:00,114 INFO L175 Difference]: Start difference. First operand has 116 places, 107 transitions, 362 flow. Second operand 9 states and 731 transitions. [2025-03-17 11:16:00,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 123 transitions, 532 flow [2025-03-17 11:16:00,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 123 transitions, 516 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:16:00,123 INFO L231 Difference]: Finished difference. Result has 125 places, 110 transitions, 390 flow [2025-03-17 11:16:00,123 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-17 11:16:00,123 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 7 predicate places. [2025-03-17 11:16:00,123 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 110 transitions, 390 flow [2025-03-17 11:16:00,124 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-17 11:16:00,124 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:16:00,124 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-17 11:16:00,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-03-17 11:16:00,124 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-17 11:16:00,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:16:00,124 INFO L85 PathProgramCache]: Analyzing trace with hash -354968827, now seen corresponding path program 1 times [2025-03-17 11:16:00,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:16:00,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371448153] [2025-03-17 11:16:00,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:16:00,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:16:00,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-17 11:16:00,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-17 11:16:00,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:16:00,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:16:00,208 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-17 11:16:00,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:16:00,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371448153] [2025-03-17 11:16:00,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371448153] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:16:00,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:16:00,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 11:16:00,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348194247] [2025-03-17 11:16:00,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:16:00,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 11:16:00,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:16:00,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 11:16:00,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-17 11:16:00,253 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 113 [2025-03-17 11:16:00,254 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-17 11:16:00,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:16:00,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 113 [2025-03-17 11:16:00,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:16:03,055 INFO L124 PetriNetUnfolderBase]: 7473/27953 cut-off events. [2025-03-17 11:16:03,055 INFO L125 PetriNetUnfolderBase]: For 17394/18429 co-relation queries the response was YES. [2025-03-17 11:16:03,137 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 329095 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-17 11:16:03,204 INFO L140 encePairwiseOnDemand]: 108/113 looper letters, 54 selfloop transitions, 11 changer transitions 0/136 dead transitions. [2025-03-17 11:16:03,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 136 transitions, 634 flow [2025-03-17 11:16:03,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 11:16:03,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-17 11:16:03,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 972 transitions. [2025-03-17 11:16:03,205 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7168141592920354 [2025-03-17 11:16:03,205 INFO L175 Difference]: Start difference. First operand has 125 places, 110 transitions, 390 flow. Second operand 12 states and 972 transitions. [2025-03-17 11:16:03,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 136 transitions, 634 flow [2025-03-17 11:16:03,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 136 transitions, 616 flow, removed 4 selfloop flow, removed 5 redundant places. [2025-03-17 11:16:03,209 INFO L231 Difference]: Finished difference. Result has 134 places, 113 transitions, 428 flow [2025-03-17 11:16:03,210 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-17 11:16:03,210 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 16 predicate places. [2025-03-17 11:16:03,210 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 113 transitions, 428 flow [2025-03-17 11:16:03,210 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-17 11:16:03,210 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:16:03,210 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-17 11:16:03,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-03-17 11:16:03,210 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-17 11:16:03,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:16:03,211 INFO L85 PathProgramCache]: Analyzing trace with hash 12619166, now seen corresponding path program 1 times [2025-03-17 11:16:03,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:16:03,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104199791] [2025-03-17 11:16:03,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:16:03,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:16:03,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-17 11:16:03,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-17 11:16:03,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:16:03,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:16:03,291 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-17 11:16:03,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:16:03,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104199791] [2025-03-17 11:16:03,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104199791] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:16:03,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:16:03,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 11:16:03,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122822815] [2025-03-17 11:16:03,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:16:03,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 11:16:03,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:16:03,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 11:16:03,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-17 11:16:03,346 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 113 [2025-03-17 11:16:03,347 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-17 11:16:03,347 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:16:03,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 113 [2025-03-17 11:16:03,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:16:06,051 INFO L124 PetriNetUnfolderBase]: 7228/27696 cut-off events. [2025-03-17 11:16:06,051 INFO L125 PetriNetUnfolderBase]: For 18372/19331 co-relation queries the response was YES. [2025-03-17 11:16:06,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48139 conditions, 27696 events. 7228/27696 cut-off events. For 18372/19331 co-relation queries the response was YES. Maximal size of possible extension queue 682. Compared 332487 event pairs, 2100 based on Foata normal form. 16/24779 useless extension candidates. Maximal degree in co-relation 48118. Up to 8810 conditions per place. [2025-03-17 11:16:06,191 INFO L140 encePairwiseOnDemand]: 108/113 looper letters, 67 selfloop transitions, 14 changer transitions 0/152 dead transitions. [2025-03-17 11:16:06,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 152 transitions, 764 flow [2025-03-17 11:16:06,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 11:16:06,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-17 11:16:06,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1216 transitions. [2025-03-17 11:16:06,192 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7174041297935103 [2025-03-17 11:16:06,192 INFO L175 Difference]: Start difference. First operand has 134 places, 113 transitions, 428 flow. Second operand 15 states and 1216 transitions. [2025-03-17 11:16:06,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 152 transitions, 764 flow [2025-03-17 11:16:06,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 152 transitions, 734 flow, removed 7 selfloop flow, removed 8 redundant places. [2025-03-17 11:16:06,197 INFO L231 Difference]: Finished difference. Result has 143 places, 116 transitions, 466 flow [2025-03-17 11:16:06,197 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-17 11:16:06,198 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 25 predicate places. [2025-03-17 11:16:06,198 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 116 transitions, 466 flow [2025-03-17 11:16:06,198 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-17 11:16:06,198 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:16:06,198 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-17 11:16:06,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-03-17 11:16:06,198 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-17 11:16:06,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:16:06,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1411461944, now seen corresponding path program 1 times [2025-03-17 11:16:06,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:16:06,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709791324] [2025-03-17 11:16:06,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:16:06,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:16:06,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-17 11:16:06,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-17 11:16:06,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:16:06,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:16:06,308 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-17 11:16:06,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:16:06,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709791324] [2025-03-17 11:16:06,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709791324] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:16:06,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:16:06,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 11:16:06,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016461498] [2025-03-17 11:16:06,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:16:06,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 11:16:06,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:16:06,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 11:16:06,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-03-17 11:16:06,365 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 113 [2025-03-17 11:16:06,366 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-17 11:16:06,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:16:06,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 113 [2025-03-17 11:16:06,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:16:09,324 INFO L124 PetriNetUnfolderBase]: 6602/27953 cut-off events. [2025-03-17 11:16:09,325 INFO L125 PetriNetUnfolderBase]: For 19098/19820 co-relation queries the response was YES. [2025-03-17 11:16:09,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47223 conditions, 27953 events. 6602/27953 cut-off events. For 19098/19820 co-relation queries the response was YES. Maximal size of possible extension queue 692. Compared 341042 event pairs, 1919 based on Foata normal form. 32/25093 useless extension candidates. Maximal degree in co-relation 47199. Up to 7417 conditions per place. [2025-03-17 11:16:09,491 INFO L140 encePairwiseOnDemand]: 108/113 looper letters, 81 selfloop transitions, 17 changer transitions 0/169 dead transitions. [2025-03-17 11:16:09,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 169 transitions, 886 flow [2025-03-17 11:16:09,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 11:16:09,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-17 11:16:09,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1461 transitions. [2025-03-17 11:16:09,492 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7182890855457227 [2025-03-17 11:16:09,492 INFO L175 Difference]: Start difference. First operand has 143 places, 116 transitions, 466 flow. Second operand 18 states and 1461 transitions. [2025-03-17 11:16:09,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 169 transitions, 886 flow [2025-03-17 11:16:09,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 169 transitions, 844 flow, removed 10 selfloop flow, removed 11 redundant places. [2025-03-17 11:16:09,498 INFO L231 Difference]: Finished difference. Result has 152 places, 118 transitions, 490 flow [2025-03-17 11:16:09,498 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-17 11:16:09,498 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 34 predicate places. [2025-03-17 11:16:09,498 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 118 transitions, 490 flow [2025-03-17 11:16:09,500 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-17 11:16:09,500 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:16:09,501 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-17 11:16:09,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-03-17 11:16:09,501 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-17 11:16:09,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:16:09,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1396946481, now seen corresponding path program 1 times [2025-03-17 11:16:09,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:16:09,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136880358] [2025-03-17 11:16:09,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:16:09,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:16:09,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-17 11:16:09,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-17 11:16:09,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:16:09,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:16:09,642 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-17 11:16:09,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:16:09,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136880358] [2025-03-17 11:16:09,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136880358] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:16:09,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:16:09,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-17 11:16:09,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484234762] [2025-03-17 11:16:09,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:16:09,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 11:16:09,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:16:09,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 11:16:09,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-17 11:16:09,721 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 113 [2025-03-17 11:16:09,722 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-17 11:16:09,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:16:09,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 113 [2025-03-17 11:16:09,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:16:10,077 INFO L124 PetriNetUnfolderBase]: 1221/3418 cut-off events. [2025-03-17 11:16:10,077 INFO L125 PetriNetUnfolderBase]: For 7522/7522 co-relation queries the response was YES. [2025-03-17 11:16:10,091 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 24620 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-17 11:16:10,100 INFO L140 encePairwiseOnDemand]: 108/113 looper letters, 77 selfloop transitions, 19 changer transitions 0/143 dead transitions. [2025-03-17 11:16:10,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 143 transitions, 808 flow [2025-03-17 11:16:10,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-17 11:16:10,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-17 11:16:10,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1693 transitions. [2025-03-17 11:16:10,101 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7134428992836073 [2025-03-17 11:16:10,101 INFO L175 Difference]: Start difference. First operand has 152 places, 118 transitions, 490 flow. Second operand 21 states and 1693 transitions. [2025-03-17 11:16:10,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 143 transitions, 808 flow [2025-03-17 11:16:10,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 143 transitions, 722 flow, removed 23 selfloop flow, removed 20 redundant places. [2025-03-17 11:16:10,108 INFO L231 Difference]: Finished difference. Result has 126 places, 80 transitions, 316 flow [2025-03-17 11:16:10,108 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-17 11:16:10,108 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 8 predicate places. [2025-03-17 11:16:10,108 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 80 transitions, 316 flow [2025-03-17 11:16:10,108 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-17 11:16:10,108 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:16:10,109 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-17 11:16:10,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-03-17 11:16:10,109 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-17 11:16:10,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:16:10,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1368644618, now seen corresponding path program 1 times [2025-03-17 11:16:10,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:16:10,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733572860] [2025-03-17 11:16:10,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:16:10,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:16:10,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-17 11:16:10,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-17 11:16:10,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:16:10,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:16:10,127 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 11:16:10,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-17 11:16:10,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-17 11:16:10,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:16:10,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:16:10,147 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 11:16:10,147 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 11:16:10,147 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 12 remaining) [2025-03-17 11:16:10,148 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining) [2025-03-17 11:16:10,148 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining) [2025-03-17 11:16:10,148 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining) [2025-03-17 11:16:10,148 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 12 remaining) [2025-03-17 11:16:10,148 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (6 of 12 remaining) [2025-03-17 11:16:10,148 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 12 remaining) [2025-03-17 11:16:10,148 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining) [2025-03-17 11:16:10,148 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining) [2025-03-17 11:16:10,148 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining) [2025-03-17 11:16:10,148 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining) [2025-03-17 11:16:10,148 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining) [2025-03-17 11:16:10,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-03-17 11:16:10,148 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:16:10,148 WARN L246 ceAbstractionStarter]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 11:16:10,148 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 7 thread instances. [2025-03-17 11:16:10,164 INFO L143 ThreadInstanceAdder]: Constructed 7 joinOtherThreadTransitions. [2025-03-17 11:16:10,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 121 transitions, 333 flow [2025-03-17 11:16:10,476 INFO L124 PetriNetUnfolderBase]: 344/3292 cut-off events. [2025-03-17 11:16:10,476 INFO L125 PetriNetUnfolderBase]: For 525/525 co-relation queries the response was YES. [2025-03-17 11:16:10,482 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 25166 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-17 11:16:10,483 INFO L82 GeneralOperation]: Start removeDead. Operand has 127 places, 121 transitions, 333 flow [2025-03-17 11:16:10,488 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 127 places, 121 transitions, 333 flow [2025-03-17 11:16:10,488 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:16:10,489 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;@133872e1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:16:10,489 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-03-17 11:16:10,490 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:16:10,490 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-03-17 11:16:10,490 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:16:10,490 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:16:10,490 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:16:10,490 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-17 11:16:10,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:16:10,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1922090804, now seen corresponding path program 1 times [2025-03-17 11:16:10,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:16:10,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984270987] [2025-03-17 11:16:10,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:16:10,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:16:10,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 11:16:10,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 11:16:10,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:16:10,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:16:10,497 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-17 11:16:10,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:16:10,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984270987] [2025-03-17 11:16:10,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984270987] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:16:10,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:16:10,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 11:16:10,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614261949] [2025-03-17 11:16:10,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:16:10,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 11:16:10,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:16:10,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 11:16:10,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 11:16:10,497 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 121 [2025-03-17 11:16:10,498 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-17 11:16:10,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:16:10,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 121 [2025-03-17 11:16:10,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:16:13,716 INFO L124 PetriNetUnfolderBase]: 8348/35176 cut-off events. [2025-03-17 11:16:13,716 INFO L125 PetriNetUnfolderBase]: For 18926/38340 co-relation queries the response was YES. [2025-03-17 11:16:13,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51839 conditions, 35176 events. 8348/35176 cut-off events. For 18926/38340 co-relation queries the response was YES. Maximal size of possible extension queue 865. Compared 457337 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-17 11:16:13,884 INFO L140 encePairwiseOnDemand]: 111/121 looper letters, 22 selfloop transitions, 0 changer transitions 0/109 dead transitions. [2025-03-17 11:16:13,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 109 transitions, 353 flow [2025-03-17 11:16:13,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 11:16:13,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-17 11:16:13,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 208 transitions. [2025-03-17 11:16:13,884 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.859504132231405 [2025-03-17 11:16:13,884 INFO L175 Difference]: Start difference. First operand has 127 places, 121 transitions, 333 flow. Second operand 2 states and 208 transitions. [2025-03-17 11:16:13,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 109 transitions, 353 flow [2025-03-17 11:16:13,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 109 transitions, 353 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:16:13,890 INFO L231 Difference]: Finished difference. Result has 118 places, 109 transitions, 309 flow [2025-03-17 11:16:13,890 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-17 11:16:13,890 INFO L279 CegarLoopForPetriNet]: 127 programPoint places, -9 predicate places. [2025-03-17 11:16:13,890 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 109 transitions, 309 flow [2025-03-17 11:16:13,890 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-17 11:16:13,890 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:16:13,891 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-17 11:16:13,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-03-17 11:16:13,891 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-17 11:16:13,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:16:13,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1769664465, now seen corresponding path program 1 times [2025-03-17 11:16:13,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:16:13,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209966133] [2025-03-17 11:16:13,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:16:13,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:16:13,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 11:16:13,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 11:16:13,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:16:13,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:16:13,902 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-17 11:16:13,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:16:13,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209966133] [2025-03-17 11:16:13,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209966133] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:16:13,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:16:13,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:16:13,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244962656] [2025-03-17 11:16:13,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:16:13,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:16:13,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:16:13,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:16:13,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:16:13,917 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 121 [2025-03-17 11:16:13,917 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-17 11:16:13,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:16:13,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 121 [2025-03-17 11:16:13,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:16:19,777 INFO L124 PetriNetUnfolderBase]: 15877/67988 cut-off events. [2025-03-17 11:16:19,777 INFO L125 PetriNetUnfolderBase]: For 20791/20791 co-relation queries the response was YES. [2025-03-17 11:16:20,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95013 conditions, 67988 events. 15877/67988 cut-off events. For 20791/20791 co-relation queries the response was YES. Maximal size of possible extension queue 1199. Compared 936995 event pairs, 14784 based on Foata normal form. 1/62733 useless extension candidates. Maximal degree in co-relation 95003. Up to 21014 conditions per place. [2025-03-17 11:16:20,164 INFO L140 encePairwiseOnDemand]: 118/121 looper letters, 27 selfloop transitions, 2 changer transitions 3/111 dead transitions. [2025-03-17 11:16:20,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 111 transitions, 373 flow [2025-03-17 11:16:20,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:16:20,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:16:20,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 277 transitions. [2025-03-17 11:16:20,165 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7630853994490359 [2025-03-17 11:16:20,165 INFO L175 Difference]: Start difference. First operand has 118 places, 109 transitions, 309 flow. Second operand 3 states and 277 transitions. [2025-03-17 11:16:20,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 111 transitions, 373 flow [2025-03-17 11:16:20,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 111 transitions, 373 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:16:20,167 INFO L231 Difference]: Finished difference. Result has 121 places, 107 transitions, 315 flow [2025-03-17 11:16:20,167 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-17 11:16:20,167 INFO L279 CegarLoopForPetriNet]: 127 programPoint places, -6 predicate places. [2025-03-17 11:16:20,167 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 107 transitions, 315 flow [2025-03-17 11:16:20,168 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-17 11:16:20,168 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:16:20,168 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-17 11:16:20,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-03-17 11:16:20,168 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-17 11:16:20,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:16:20,168 INFO L85 PathProgramCache]: Analyzing trace with hash 16076137, now seen corresponding path program 1 times [2025-03-17 11:16:20,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:16:20,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488859146] [2025-03-17 11:16:20,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:16:20,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:16:20,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 11:16:20,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 11:16:20,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:16:20,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:16:20,236 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-17 11:16:20,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:16:20,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488859146] [2025-03-17 11:16:20,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488859146] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:16:20,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:16:20,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:16:20,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847586765] [2025-03-17 11:16:20,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:16:20,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:16:20,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:16:20,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:16:20,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:16:20,289 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 121 [2025-03-17 11:16:20,290 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-17 11:16:20,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:16:20,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 121 [2025-03-17 11:16:20,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand