./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-deagle/floating_read-15.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-15.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 abe6fcc2bea9781e0ab07417eb8616a5b638529e720de8eddec3568cb8edc6ea --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 11:15:32,349 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:15:32,408 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:32,413 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:15:32,413 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:15:32,433 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:15:32,434 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:15:32,434 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:15:32,435 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:15:32,435 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:15:32,436 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:15:32,436 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:15:32,436 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:15:32,436 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:15:32,436 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 11:15:32,436 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 11:15:32,436 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:15:32,437 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 11:15:32,437 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:15:32,437 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 11:15:32,437 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:15:32,437 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 11:15:32,437 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-17 11:15:32,437 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:15:32,437 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 11:15:32,437 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 11:15:32,437 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:15:32,437 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:15:32,438 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:15:32,438 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:15:32,438 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:15:32,438 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:15:32,438 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:15:32,438 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:15:32,438 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 11:15:32,439 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 11:15:32,439 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:15:32,439 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:15:32,439 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:15:32,439 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:15:32,439 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:15:32,439 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:15:32,439 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 -> abe6fcc2bea9781e0ab07417eb8616a5b638529e720de8eddec3568cb8edc6ea [2025-03-17 11:15:32,659 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:15:32,667 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:15:32,669 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:15:32,670 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:15:32,671 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:15:32,672 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-deagle/floating_read-15.i [2025-03-17 11:15:33,829 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/281059c76/d89c722431144b4e9aa77b0859fab47c/FLAG3f4526d63 [2025-03-17 11:15:34,099 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:15:34,101 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/floating_read-15.i [2025-03-17 11:15:34,117 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/281059c76/d89c722431144b4e9aa77b0859fab47c/FLAG3f4526d63 [2025-03-17 11:15:34,133 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/281059c76/d89c722431144b4e9aa77b0859fab47c [2025-03-17 11:15:34,135 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:15:34,136 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:15:34,138 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:15:34,138 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:15:34,141 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:15:34,143 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:15:34" (1/1) ... [2025-03-17 11:15:34,145 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@659b9ad3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:15:34, skipping insertion in model container [2025-03-17 11:15:34,145 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:15:34" (1/1) ... [2025-03-17 11:15:34,171 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:15:34,408 WARN L1731 CHandler]: Possible shadowing of function thread [2025-03-17 11:15:34,422 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:15:34,428 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:15:34,461 WARN L1731 CHandler]: Possible shadowing of function thread [2025-03-17 11:15:34,464 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:15:34,485 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:15:34,486 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:15:34 WrapperNode [2025-03-17 11:15:34,486 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:15:34,487 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:15:34,487 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:15:34,487 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:15:34,491 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:34" (1/1) ... [2025-03-17 11:15:34,500 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:34" (1/1) ... [2025-03-17 11:15:34,513 INFO L138 Inliner]: procedures = 162, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 62 [2025-03-17 11:15:34,514 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:15:34,514 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:15:34,514 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:15:34,514 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:15:34,518 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:34" (1/1) ... [2025-03-17 11:15:34,518 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:34" (1/1) ... [2025-03-17 11:15:34,520 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:34" (1/1) ... [2025-03-17 11:15:34,520 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:34" (1/1) ... [2025-03-17 11:15:34,525 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:34" (1/1) ... [2025-03-17 11:15:34,525 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:34" (1/1) ... [2025-03-17 11:15:34,526 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:34" (1/1) ... [2025-03-17 11:15:34,527 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:34" (1/1) ... [2025-03-17 11:15:34,528 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:15:34,529 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:15:34,529 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:15:34,529 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:15:34,530 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:15:34" (1/1) ... [2025-03-17 11:15:34,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:15:34,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:15:34,554 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:34,557 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:34,574 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 11:15:34,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 11:15:34,574 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-17 11:15:34,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 11:15:34,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 11:15:34,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 11:15:34,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 11:15:34,575 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-03-17 11:15:34,575 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-03-17 11:15:34,575 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-17 11:15:34,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:15:34,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:15:34,576 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:34,670 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:15:34,672 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:15:34,838 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L719: havoc main_~#t~0#1.base, main_~#t~0#1.offset; [2025-03-17 11:15:34,838 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:34,853 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 11:15:34,853 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:15:34,879 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:15:34,879 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 11:15:34,882 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:15:34 BoogieIcfgContainer [2025-03-17 11:15:34,882 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:15:34,884 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:15:34,884 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:15:34,888 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:15:34,889 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:15:34" (1/3) ... [2025-03-17 11:15:34,890 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a887766 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:15:34, skipping insertion in model container [2025-03-17 11:15:34,890 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:15:34" (2/3) ... [2025-03-17 11:15:34,890 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a887766 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:15:34, skipping insertion in model container [2025-03-17 11:15:34,890 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:15:34" (3/3) ... [2025-03-17 11:15:34,891 INFO L128 eAbstractionObserver]: Analyzing ICFG floating_read-15.i [2025-03-17 11:15:34,902 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:15:34,904 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG floating_read-15.i that has 2 procedures, 70 locations, 1 initial locations, 2 loop locations, and 5 error locations. [2025-03-17 11:15:34,906 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 11:15:34,951 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-17 11:15:34,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 73 transitions, 153 flow [2025-03-17 11:15:35,022 INFO L124 PetriNetUnfolderBase]: 5/115 cut-off events. [2025-03-17 11:15:35,027 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 11:15:35,031 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,032 INFO L82 GeneralOperation]: Start removeDead. Operand has 73 places, 73 transitions, 153 flow [2025-03-17 11:15:35,034 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 73 transitions, 153 flow [2025-03-17 11:15:35,040 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:15:35,048 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;@2d089349, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:15:35,048 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-17 11:15:35,053 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:15:35,053 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-03-17 11:15:35,053 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:15:35,053 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:35,054 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,054 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,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:35,058 INFO L85 PathProgramCache]: Analyzing trace with hash 267114124, now seen corresponding path program 1 times [2025-03-17 11:15:35,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:35,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969092408] [2025-03-17 11:15:35,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:35,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:35,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 11:15:35,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 11:15:35,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:35,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:35,177 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:35,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:35,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969092408] [2025-03-17 11:15:35,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969092408] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:35,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:35,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 11:15:35,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342406315] [2025-03-17 11:15:35,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:35,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 11:15:35,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:35,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 11:15:35,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 11:15:35,211 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 73 [2025-03-17 11:15:35,214 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:35,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:35,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 73 [2025-03-17 11:15:35,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:35,260 INFO L124 PetriNetUnfolderBase]: 1/105 cut-off events. [2025-03-17 11:15:35,260 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2025-03-17 11:15:35,260 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:35,261 INFO L140 encePairwiseOnDemand]: 69/73 looper letters, 4 selfloop transitions, 0 changer transitions 12/67 dead transitions. [2025-03-17 11:15:35,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 67 transitions, 149 flow [2025-03-17 11:15:35,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 11:15:35,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-17 11:15:35,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 136 transitions. [2025-03-17 11:15:35,271 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9315068493150684 [2025-03-17 11:15:35,274 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:35,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 67 transitions, 149 flow [2025-03-17 11:15:35,277 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:35,279 INFO L231 Difference]: Finished difference. Result has 70 places, 55 transitions, 117 flow [2025-03-17 11:15:35,283 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:35,286 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, -3 predicate places. [2025-03-17 11:15:35,288 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 55 transitions, 117 flow [2025-03-17 11:15:35,288 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:35,288 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:35,288 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:35,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 11:15:35,289 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:35,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:35,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1334624145, now seen corresponding path program 1 times [2025-03-17 11:15:35,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:35,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673609846] [2025-03-17 11:15:35,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:35,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:35,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 11:15:35,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 11:15:35,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:35,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:35,378 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:35,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:35,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673609846] [2025-03-17 11:15:35,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673609846] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:35,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:35,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:15:35,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190805429] [2025-03-17 11:15:35,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:35,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:15:35,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:35,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:15:35,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:15:35,405 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 73 [2025-03-17 11:15:35,406 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:35,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:35,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 73 [2025-03-17 11:15:35,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:35,430 INFO L124 PetriNetUnfolderBase]: 3/106 cut-off events. [2025-03-17 11:15:35,430 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-17 11:15:35,431 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:35,431 INFO L140 encePairwiseOnDemand]: 70/73 looper letters, 8 selfloop transitions, 2 changer transitions 0/56 dead transitions. [2025-03-17 11:15:35,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 56 transitions, 139 flow [2025-03-17 11:15:35,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:15:35,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:15:35,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 185 transitions. [2025-03-17 11:15:35,432 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8447488584474886 [2025-03-17 11:15:35,432 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:35,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 56 transitions, 139 flow [2025-03-17 11:15:35,433 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:35,435 INFO L231 Difference]: Finished difference. Result has 61 places, 55 transitions, 125 flow [2025-03-17 11:15:35,435 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:35,435 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, -12 predicate places. [2025-03-17 11:15:35,435 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 55 transitions, 125 flow [2025-03-17 11:15:35,436 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:35,436 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:35,436 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:35,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 11:15:35,436 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:35,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:35,437 INFO L85 PathProgramCache]: Analyzing trace with hash 248469515, now seen corresponding path program 1 times [2025-03-17 11:15:35,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:35,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776191882] [2025-03-17 11:15:35,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:35,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:35,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 11:15:35,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 11:15:35,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:35,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:35,840 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:35,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:35,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776191882] [2025-03-17 11:15:35,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776191882] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:35,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:35,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:15:35,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623444234] [2025-03-17 11:15:35,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:35,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:15:35,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:35,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:15:35,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:15:35,943 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 73 [2025-03-17 11:15:35,943 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:35,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:35,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 73 [2025-03-17 11:15:35,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:36,000 INFO L124 PetriNetUnfolderBase]: 12/112 cut-off events. [2025-03-17 11:15:36,001 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-17 11:15:36,001 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,001 INFO L140 encePairwiseOnDemand]: 67/73 looper letters, 18 selfloop transitions, 5 changer transitions 0/58 dead transitions. [2025-03-17 11:15:36,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 58 transitions, 177 flow [2025-03-17 11:15:36,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:15:36,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:15:36,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 300 transitions. [2025-03-17 11:15:36,005 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.684931506849315 [2025-03-17 11:15:36,005 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,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 58 transitions, 177 flow [2025-03-17 11:15:36,005 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,006 INFO L231 Difference]: Finished difference. Result has 63 places, 54 transitions, 129 flow [2025-03-17 11:15:36,006 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,009 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, -10 predicate places. [2025-03-17 11:15:36,009 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 54 transitions, 129 flow [2025-03-17 11:15:36,009 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,009 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:36,009 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:15:36,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 11:15:36,009 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,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:36,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1453979015, now seen corresponding path program 1 times [2025-03-17 11:15:36,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:36,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471045538] [2025-03-17 11:15:36,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:36,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:36,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 11:15:36,026 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,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:36,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:36,109 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,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:36,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471045538] [2025-03-17 11:15:36,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471045538] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:36,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:36,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:15:36,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400878363] [2025-03-17 11:15:36,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:36,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:15:36,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:36,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:15:36,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:15:36,153 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 73 [2025-03-17 11:15:36,154 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,154 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:36,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 73 [2025-03-17 11:15:36,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:36,182 INFO L124 PetriNetUnfolderBase]: 3/62 cut-off events. [2025-03-17 11:15:36,183 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 11:15:36,183 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:36,183 INFO L140 encePairwiseOnDemand]: 68/73 looper letters, 7 selfloop transitions, 4 changer transitions 0/38 dead transitions. [2025-03-17 11:15:36,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 38 transitions, 114 flow [2025-03-17 11:15:36,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:15:36,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:15:36,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 348 transitions. [2025-03-17 11:15:36,188 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7945205479452054 [2025-03-17 11:15:36,188 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:36,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 38 transitions, 114 flow [2025-03-17 11:15:36,189 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:36,189 INFO L231 Difference]: Finished difference. Result has 44 places, 35 transitions, 82 flow [2025-03-17 11:15:36,189 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:36,190 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, -29 predicate places. [2025-03-17 11:15:36,190 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 35 transitions, 82 flow [2025-03-17 11:15:36,190 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:36,190 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:36,190 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:36,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 11:15:36,190 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:36,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:36,192 INFO L85 PathProgramCache]: Analyzing trace with hash -935605763, now seen corresponding path program 1 times [2025-03-17 11:15:36,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:36,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201652749] [2025-03-17 11:15:36,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:36,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:36,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-17 11:15:36,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 11:15:36,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:36,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:15:36,220 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 11:15:36,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-17 11:15:36,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 11:15:36,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:36,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:15:36,253 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 11:15:36,254 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 11:15:36,254 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2025-03-17 11:15:36,256 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2025-03-17 11:15:36,256 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2025-03-17 11:15:36,256 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2025-03-17 11:15:36,257 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2025-03-17 11:15:36,257 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2025-03-17 11:15:36,257 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2025-03-17 11:15:36,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 11:15:36,257 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-17 11:15:36,259 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 11:15:36,259 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-17 11:15:36,273 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-17 11:15:36,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 81 transitions, 178 flow [2025-03-17 11:15:36,295 INFO L124 PetriNetUnfolderBase]: 9/193 cut-off events. [2025-03-17 11:15:36,298 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-17 11:15:36,299 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:36,299 INFO L82 GeneralOperation]: Start removeDead. Operand has 82 places, 81 transitions, 178 flow [2025-03-17 11:15:36,299 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 82 places, 81 transitions, 178 flow [2025-03-17 11:15:36,300 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:15:36,300 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;@2d089349, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:15:36,300 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-17 11:15:36,302 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:15:36,302 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-03-17 11:15:36,302 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:15:36,302 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:36,302 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:15:36,302 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:36,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:36,303 INFO L85 PathProgramCache]: Analyzing trace with hash -386960020, now seen corresponding path program 1 times [2025-03-17 11:15:36,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:36,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862064910] [2025-03-17 11:15:36,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:36,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:36,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 11:15:36,307 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,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:36,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:36,312 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,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:36,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862064910] [2025-03-17 11:15:36,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862064910] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:36,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:36,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 11:15:36,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992369199] [2025-03-17 11:15:36,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:36,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 11:15:36,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:36,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 11:15:36,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 11:15:36,313 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 81 [2025-03-17 11:15:36,313 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:36,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:36,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 81 [2025-03-17 11:15:36,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:36,341 INFO L124 PetriNetUnfolderBase]: 7/212 cut-off events. [2025-03-17 11:15:36,341 INFO L125 PetriNetUnfolderBase]: For 29/38 co-relation queries the response was YES. [2025-03-17 11:15:36,342 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:36,342 INFO L140 encePairwiseOnDemand]: 76/81 looper letters, 7 selfloop transitions, 0 changer transitions 0/74 dead transitions. [2025-03-17 11:15:36,342 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 74 transitions, 178 flow [2025-03-17 11:15:36,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 11:15:36,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-17 11:15:36,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 148 transitions. [2025-03-17 11:15:36,343 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9135802469135802 [2025-03-17 11:15:36,343 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:36,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 74 transitions, 178 flow [2025-03-17 11:15:36,343 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:36,346 INFO L231 Difference]: Finished difference. Result has 78 places, 74 transitions, 164 flow [2025-03-17 11:15:36,346 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:36,346 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, -4 predicate places. [2025-03-17 11:15:36,346 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 74 transitions, 164 flow [2025-03-17 11:15:36,346 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:36,346 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:36,346 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:15:36,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 11:15:36,347 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:36,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:36,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1057691454, now seen corresponding path program 1 times [2025-03-17 11:15:36,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:36,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409978404] [2025-03-17 11:15:36,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:36,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:36,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 11:15:36,356 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,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:36,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:36,367 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,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:36,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409978404] [2025-03-17 11:15:36,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409978404] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:36,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:36,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:15:36,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27186361] [2025-03-17 11:15:36,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:36,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:15:36,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:36,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:15:36,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:15:36,385 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 81 [2025-03-17 11:15:36,385 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:36,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:36,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 81 [2025-03-17 11:15:36,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:36,433 INFO L124 PetriNetUnfolderBase]: 28/388 cut-off events. [2025-03-17 11:15:36,433 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2025-03-17 11:15:36,435 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:36,436 INFO L140 encePairwiseOnDemand]: 78/81 looper letters, 12 selfloop transitions, 2 changer transitions 3/76 dead transitions. [2025-03-17 11:15:36,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 76 transitions, 198 flow [2025-03-17 11:15:36,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:15:36,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:15:36,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 202 transitions. [2025-03-17 11:15:36,438 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.831275720164609 [2025-03-17 11:15:36,438 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:36,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 76 transitions, 198 flow [2025-03-17 11:15:36,439 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:36,440 INFO L231 Difference]: Finished difference. Result has 81 places, 72 transitions, 170 flow [2025-03-17 11:15:36,440 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:36,441 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, -1 predicate places. [2025-03-17 11:15:36,441 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 72 transitions, 170 flow [2025-03-17 11:15:36,441 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:36,441 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:36,441 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:15:36,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 11:15:36,442 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:36,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:36,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1620713180, now seen corresponding path program 1 times [2025-03-17 11:15:36,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:36,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27000139] [2025-03-17 11:15:36,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:36,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:36,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 11:15:36,459 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,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:36,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:36,681 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,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:36,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27000139] [2025-03-17 11:15:36,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27000139] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:36,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:36,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:15:36,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724325034] [2025-03-17 11:15:36,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:36,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:15:36,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:36,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:15:36,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:15:36,762 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 81 [2025-03-17 11:15:36,763 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:36,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:36,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 81 [2025-03-17 11:15:36,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:36,853 INFO L124 PetriNetUnfolderBase]: 77/403 cut-off events. [2025-03-17 11:15:36,853 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2025-03-17 11:15:36,856 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:36,858 INFO L140 encePairwiseOnDemand]: 75/81 looper letters, 25 selfloop transitions, 6 changer transitions 2/79 dead transitions. [2025-03-17 11:15:36,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 79 transitions, 248 flow [2025-03-17 11:15:36,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:15:36,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:15:36,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 332 transitions. [2025-03-17 11:15:36,860 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6831275720164609 [2025-03-17 11:15:36,860 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:36,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 79 transitions, 248 flow [2025-03-17 11:15:36,861 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:36,863 INFO L231 Difference]: Finished difference. Result has 81 places, 69 transitions, 174 flow [2025-03-17 11:15:36,864 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:36,865 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, -1 predicate places. [2025-03-17 11:15:36,866 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 69 transitions, 174 flow [2025-03-17 11:15:36,866 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:36,866 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:36,866 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,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 11:15:36,867 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:36,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:36,867 INFO L85 PathProgramCache]: Analyzing trace with hash 604796420, now seen corresponding path program 1 times [2025-03-17 11:15:36,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:36,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37516144] [2025-03-17 11:15:36,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:36,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:36,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 11:15:36,885 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,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:36,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:36,930 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,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:36,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37516144] [2025-03-17 11:15:36,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37516144] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:36,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:36,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:15:36,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841870572] [2025-03-17 11:15:36,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:36,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:15:36,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:36,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:15:36,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:15:36,960 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 81 [2025-03-17 11:15:36,961 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:36,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:36,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 81 [2025-03-17 11:15:36,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:37,023 INFO L124 PetriNetUnfolderBase]: 28/321 cut-off events. [2025-03-17 11:15:37,024 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-03-17 11:15:37,025 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,026 INFO L140 encePairwiseOnDemand]: 76/81 looper letters, 17 selfloop transitions, 5 changer transitions 0/76 dead transitions. [2025-03-17 11:15:37,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 76 transitions, 232 flow [2025-03-17 11:15:37,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:15:37,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:15:37,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 383 transitions. [2025-03-17 11:15:37,027 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7880658436213992 [2025-03-17 11:15:37,027 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,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 76 transitions, 232 flow [2025-03-17 11:15:37,028 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,028 INFO L231 Difference]: Finished difference. Result has 82 places, 71 transitions, 188 flow [2025-03-17 11:15:37,029 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,029 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, 0 predicate places. [2025-03-17 11:15:37,029 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 71 transitions, 188 flow [2025-03-17 11:15:37,029 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,029 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:37,032 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,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 11:15:37,032 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,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:37,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1054594213, now seen corresponding path program 1 times [2025-03-17 11:15:37,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:37,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852471340] [2025-03-17 11:15:37,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:37,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:37,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-17 11:15:37,042 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,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:37,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:37,059 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,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:37,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852471340] [2025-03-17 11:15:37,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852471340] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:37,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:37,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:15:37,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352661007] [2025-03-17 11:15:37,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:37,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:15:37,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:37,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:15:37,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:15:37,062 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 81 [2025-03-17 11:15:37,062 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,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:37,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 81 [2025-03-17 11:15:37,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:37,121 INFO L124 PetriNetUnfolderBase]: 19/335 cut-off events. [2025-03-17 11:15:37,122 INFO L125 PetriNetUnfolderBase]: For 53/62 co-relation queries the response was YES. [2025-03-17 11:15:37,122 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,123 INFO L140 encePairwiseOnDemand]: 76/81 looper letters, 11 selfloop transitions, 4 changer transitions 0/76 dead transitions. [2025-03-17 11:15:37,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 76 transitions, 234 flow [2025-03-17 11:15:37,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:15:37,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:15:37,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 211 transitions. [2025-03-17 11:15:37,124 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8683127572016461 [2025-03-17 11:15:37,124 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,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 76 transitions, 234 flow [2025-03-17 11:15:37,125 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,126 INFO L231 Difference]: Finished difference. Result has 84 places, 74 transitions, 212 flow [2025-03-17 11:15:37,126 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,127 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, 2 predicate places. [2025-03-17 11:15:37,127 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 74 transitions, 212 flow [2025-03-17 11:15:37,127 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,127 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:37,127 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,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 11:15:37,127 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,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:37,130 INFO L85 PathProgramCache]: Analyzing trace with hash -267534053, now seen corresponding path program 1 times [2025-03-17 11:15:37,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:37,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873290175] [2025-03-17 11:15:37,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:37,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:37,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 11:15:37,146 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,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:37,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:37,218 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:37,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:37,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873290175] [2025-03-17 11:15:37,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873290175] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:37,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:37,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 11:15:37,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737804021] [2025-03-17 11:15:37,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:37,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 11:15:37,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:37,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 11:15:37,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:15:37,272 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 81 [2025-03-17 11:15:37,272 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:37,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:37,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 81 [2025-03-17 11:15:37,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:37,323 INFO L124 PetriNetUnfolderBase]: 17/142 cut-off events. [2025-03-17 11:15:37,323 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2025-03-17 11:15:37,323 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:37,324 INFO L140 encePairwiseOnDemand]: 76/81 looper letters, 15 selfloop transitions, 7 changer transitions 0/53 dead transitions. [2025-03-17 11:15:37,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 53 transitions, 202 flow [2025-03-17 11:15:37,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 11:15:37,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 11:15:37,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 563 transitions. [2025-03-17 11:15:37,325 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7722908093278463 [2025-03-17 11:15:37,326 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:37,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 53 transitions, 202 flow [2025-03-17 11:15:37,326 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:37,327 INFO L231 Difference]: Finished difference. Result has 63 places, 44 transitions, 132 flow [2025-03-17 11:15:37,327 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:37,327 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, -19 predicate places. [2025-03-17 11:15:37,327 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 44 transitions, 132 flow [2025-03-17 11:15:37,328 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:37,328 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:37,328 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:37,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 11:15:37,328 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:37,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:37,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1226884024, now seen corresponding path program 1 times [2025-03-17 11:15:37,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:37,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333806463] [2025-03-17 11:15:37,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:37,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:37,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-17 11:15:37,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-17 11:15:37,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:37,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:15:37,349 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 11:15:37,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-17 11:15:37,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-17 11:15:37,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:37,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:15:37,367 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 11:15:37,367 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 11:15:37,367 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2025-03-17 11:15:37,368 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (6 of 8 remaining) [2025-03-17 11:15:37,368 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 8 remaining) [2025-03-17 11:15:37,368 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 8 remaining) [2025-03-17 11:15:37,368 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (3 of 8 remaining) [2025-03-17 11:15:37,368 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 8 remaining) [2025-03-17 11:15:37,368 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 8 remaining) [2025-03-17 11:15:37,368 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 8 remaining) [2025-03-17 11:15:37,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 11:15:37,368 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:15:37,369 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 11:15:37,370 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-17 11:15:37,380 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-17 11:15:37,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 89 transitions, 205 flow [2025-03-17 11:15:37,405 INFO L124 PetriNetUnfolderBase]: 16/316 cut-off events. [2025-03-17 11:15:37,405 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-03-17 11:15:37,405 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:37,405 INFO L82 GeneralOperation]: Start removeDead. Operand has 91 places, 89 transitions, 205 flow [2025-03-17 11:15:37,406 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 91 places, 89 transitions, 205 flow [2025-03-17 11:15:37,407 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:15:37,407 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;@2d089349, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:15:37,407 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-03-17 11:15:37,408 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:15:37,408 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-03-17 11:15:37,408 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:15:37,408 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:37,408 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,409 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:37,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:37,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1651628876, now seen corresponding path program 1 times [2025-03-17 11:15:37,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:37,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501857509] [2025-03-17 11:15:37,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:37,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:37,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 11:15:37,418 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,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:37,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:37,421 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,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:37,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501857509] [2025-03-17 11:15:37,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501857509] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:37,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:37,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 11:15:37,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041368720] [2025-03-17 11:15:37,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:37,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 11:15:37,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:37,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 11:15:37,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 11:15:37,423 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 89 [2025-03-17 11:15:37,423 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:37,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:37,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 89 [2025-03-17 11:15:37,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:37,487 INFO L124 PetriNetUnfolderBase]: 36/492 cut-off events. [2025-03-17 11:15:37,487 INFO L125 PetriNetUnfolderBase]: For 122/177 co-relation queries the response was YES. [2025-03-17 11:15:37,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 615 conditions, 492 events. 36/492 cut-off events. For 122/177 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:37,489 INFO L140 encePairwiseOnDemand]: 83/89 looper letters, 10 selfloop transitions, 0 changer transitions 0/81 dead transitions. [2025-03-17 11:15:37,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 81 transitions, 209 flow [2025-03-17 11:15:37,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 11:15:37,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-17 11:15:37,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 160 transitions. [2025-03-17 11:15:37,490 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.898876404494382 [2025-03-17 11:15:37,490 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:37,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 81 transitions, 209 flow [2025-03-17 11:15:37,491 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:37,492 INFO L231 Difference]: Finished difference. Result has 86 places, 81 transitions, 189 flow [2025-03-17 11:15:37,492 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:37,492 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, -5 predicate places. [2025-03-17 11:15:37,492 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 81 transitions, 189 flow [2025-03-17 11:15:37,493 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:37,493 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:37,493 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,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 11:15:37,493 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:37,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:37,493 INFO L85 PathProgramCache]: Analyzing trace with hash -982046469, now seen corresponding path program 1 times [2025-03-17 11:15:37,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:37,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138494489] [2025-03-17 11:15:37,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:37,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:37,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 11:15:37,498 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,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:37,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:37,509 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,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:37,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138494489] [2025-03-17 11:15:37,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138494489] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:37,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:37,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:15:37,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858980362] [2025-03-17 11:15:37,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:37,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:15:37,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:37,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:15:37,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:15:37,533 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 89 [2025-03-17 11:15:37,534 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:37,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:37,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 89 [2025-03-17 11:15:37,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:37,634 INFO L124 PetriNetUnfolderBase]: 117/1051 cut-off events. [2025-03-17 11:15:37,634 INFO L125 PetriNetUnfolderBase]: For 136/136 co-relation queries the response was YES. [2025-03-17 11:15:37,637 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:37,640 INFO L140 encePairwiseOnDemand]: 86/89 looper letters, 15 selfloop transitions, 2 changer transitions 3/83 dead transitions. [2025-03-17 11:15:37,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 83 transitions, 229 flow [2025-03-17 11:15:37,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:15:37,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:15:37,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 217 transitions. [2025-03-17 11:15:37,641 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8127340823970037 [2025-03-17 11:15:37,641 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:37,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 83 transitions, 229 flow [2025-03-17 11:15:37,642 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:37,643 INFO L231 Difference]: Finished difference. Result has 89 places, 79 transitions, 195 flow [2025-03-17 11:15:37,643 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:37,644 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, -2 predicate places. [2025-03-17 11:15:37,644 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 79 transitions, 195 flow [2025-03-17 11:15:37,644 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:37,645 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:37,645 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,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 11:15:37,645 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:37,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:37,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1855904181, now seen corresponding path program 1 times [2025-03-17 11:15:37,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:37,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207176536] [2025-03-17 11:15:37,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:37,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:37,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 11:15:37,658 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,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:37,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:37,833 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,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:37,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207176536] [2025-03-17 11:15:37,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207176536] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:37,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:37,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:15:37,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134757326] [2025-03-17 11:15:37,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:37,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:15:37,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:37,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:15:37,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:15:37,925 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 89 [2025-03-17 11:15:37,926 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:37,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:37,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 89 [2025-03-17 11:15:37,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:38,056 INFO L124 PetriNetUnfolderBase]: 312/1108 cut-off events. [2025-03-17 11:15:38,057 INFO L125 PetriNetUnfolderBase]: For 134/134 co-relation queries the response was YES. [2025-03-17 11:15:38,059 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,062 INFO L140 encePairwiseOnDemand]: 83/89 looper letters, 32 selfloop transitions, 6 changer transitions 2/90 dead transitions. [2025-03-17 11:15:38,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 90 transitions, 295 flow [2025-03-17 11:15:38,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:15:38,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:15:38,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 363 transitions. [2025-03-17 11:15:38,064 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6797752808988764 [2025-03-17 11:15:38,064 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,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 90 transitions, 295 flow [2025-03-17 11:15:38,065 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,065 INFO L231 Difference]: Finished difference. Result has 89 places, 76 transitions, 199 flow [2025-03-17 11:15:38,066 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,066 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, -2 predicate places. [2025-03-17 11:15:38,066 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 76 transitions, 199 flow [2025-03-17 11:15:38,066 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,066 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:38,066 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,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 11:15:38,067 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,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:38,067 INFO L85 PathProgramCache]: Analyzing trace with hash -498937449, now seen corresponding path program 1 times [2025-03-17 11:15:38,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:38,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890172531] [2025-03-17 11:15:38,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:38,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:38,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 11:15:38,078 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,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:38,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:38,118 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,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:38,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890172531] [2025-03-17 11:15:38,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890172531] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:38,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:38,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:15:38,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437665250] [2025-03-17 11:15:38,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:38,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:15:38,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:38,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:15:38,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:15:38,166 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 89 [2025-03-17 11:15:38,167 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,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:38,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 89 [2025-03-17 11:15:38,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:38,267 INFO L124 PetriNetUnfolderBase]: 120/883 cut-off events. [2025-03-17 11:15:38,267 INFO L125 PetriNetUnfolderBase]: For 154/154 co-relation queries the response was YES. [2025-03-17 11:15:38,269 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,272 INFO L140 encePairwiseOnDemand]: 84/89 looper letters, 22 selfloop transitions, 5 changer transitions 0/85 dead transitions. [2025-03-17 11:15:38,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 85 transitions, 275 flow [2025-03-17 11:15:38,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:15:38,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:15:38,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 412 transitions. [2025-03-17 11:15:38,273 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7715355805243446 [2025-03-17 11:15:38,273 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,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 85 transitions, 275 flow [2025-03-17 11:15:38,294 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:38,295 INFO L231 Difference]: Finished difference. Result has 90 places, 79 transitions, 219 flow [2025-03-17 11:15:38,295 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:38,295 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, -1 predicate places. [2025-03-17 11:15:38,295 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 79 transitions, 219 flow [2025-03-17 11:15:38,296 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:38,296 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:38,296 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:38,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 11:15:38,296 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:38,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:38,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1730045458, now seen corresponding path program 1 times [2025-03-17 11:15:38,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:38,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207864207] [2025-03-17 11:15:38,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:38,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:38,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-17 11:15:38,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-17 11:15:38,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:38,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:38,320 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,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:38,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207864207] [2025-03-17 11:15:38,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207864207] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:38,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:38,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:15:38,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70195152] [2025-03-17 11:15:38,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:38,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:15:38,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:38,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:15:38,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:15:38,323 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 89 [2025-03-17 11:15:38,323 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:38,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:38,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 89 [2025-03-17 11:15:38,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:38,399 INFO L124 PetriNetUnfolderBase]: 119/1006 cut-off events. [2025-03-17 11:15:38,400 INFO L125 PetriNetUnfolderBase]: For 230/286 co-relation queries the response was YES. [2025-03-17 11:15:38,402 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:38,404 INFO L140 encePairwiseOnDemand]: 83/89 looper letters, 15 selfloop transitions, 5 changer transitions 0/86 dead transitions. [2025-03-17 11:15:38,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 86 transitions, 282 flow [2025-03-17 11:15:38,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:15:38,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:15:38,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 228 transitions. [2025-03-17 11:15:38,405 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8539325842696629 [2025-03-17 11:15:38,405 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:38,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 86 transitions, 282 flow [2025-03-17 11:15:38,406 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:38,407 INFO L231 Difference]: Finished difference. Result has 92 places, 83 transitions, 251 flow [2025-03-17 11:15:38,407 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:38,407 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 1 predicate places. [2025-03-17 11:15:38,408 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 83 transitions, 251 flow [2025-03-17 11:15:38,408 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:38,408 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:38,408 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:38,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 11:15:38,408 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:38,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:38,409 INFO L85 PathProgramCache]: Analyzing trace with hash 179181755, now seen corresponding path program 1 times [2025-03-17 11:15:38,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:38,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295978408] [2025-03-17 11:15:38,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:38,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:38,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 11:15:38,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 11:15:38,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:38,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:38,476 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:38,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:38,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295978408] [2025-03-17 11:15:38,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295978408] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:38,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:38,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 11:15:38,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416137704] [2025-03-17 11:15:38,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:38,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 11:15:38,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:38,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 11:15:38,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:15:38,526 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 89 [2025-03-17 11:15:38,527 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:38,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:38,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 89 [2025-03-17 11:15:38,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:38,644 INFO L124 PetriNetUnfolderBase]: 175/1161 cut-off events. [2025-03-17 11:15:38,644 INFO L125 PetriNetUnfolderBase]: For 471/494 co-relation queries the response was YES. [2025-03-17 11:15:38,646 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:38,649 INFO L140 encePairwiseOnDemand]: 84/89 looper letters, 30 selfloop transitions, 8 changer transitions 0/97 dead transitions. [2025-03-17 11:15:38,649 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 97 transitions, 383 flow [2025-03-17 11:15:38,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 11:15:38,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 11:15:38,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 612 transitions. [2025-03-17 11:15:38,651 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7640449438202247 [2025-03-17 11:15:38,651 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:38,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 97 transitions, 383 flow [2025-03-17 11:15:38,652 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:38,653 INFO L231 Difference]: Finished difference. Result has 101 places, 85 transitions, 277 flow [2025-03-17 11:15:38,653 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:38,654 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 10 predicate places. [2025-03-17 11:15:38,654 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 85 transitions, 277 flow [2025-03-17 11:15:38,654 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:38,654 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:38,654 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:38,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 11:15:38,655 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:38,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:38,655 INFO L85 PathProgramCache]: Analyzing trace with hash -722903967, now seen corresponding path program 1 times [2025-03-17 11:15:38,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:38,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024945763] [2025-03-17 11:15:38,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:38,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:38,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-17 11:15:38,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-17 11:15:38,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:38,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:38,777 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:38,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:38,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024945763] [2025-03-17 11:15:38,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024945763] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:38,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:38,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 11:15:38,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493779706] [2025-03-17 11:15:38,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:38,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 11:15:38,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:38,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 11:15:38,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-17 11:15:38,829 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 89 [2025-03-17 11:15:38,829 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:38,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:38,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 89 [2025-03-17 11:15:38,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:38,920 INFO L124 PetriNetUnfolderBase]: 61/318 cut-off events. [2025-03-17 11:15:38,920 INFO L125 PetriNetUnfolderBase]: For 215/215 co-relation queries the response was YES. [2025-03-17 11:15:38,921 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:38,922 INFO L140 encePairwiseOnDemand]: 84/89 looper letters, 26 selfloop transitions, 10 changer transitions 0/71 dead transitions. [2025-03-17 11:15:38,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 71 transitions, 328 flow [2025-03-17 11:15:38,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 11:15:38,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-17 11:15:38,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 805 transitions. [2025-03-17 11:15:38,923 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7537453183520599 [2025-03-17 11:15:38,923 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:38,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 71 transitions, 328 flow [2025-03-17 11:15:38,925 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:38,926 INFO L231 Difference]: Finished difference. Result has 78 places, 53 transitions, 178 flow [2025-03-17 11:15:38,926 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:38,927 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, -13 predicate places. [2025-03-17 11:15:38,927 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 53 transitions, 178 flow [2025-03-17 11:15:38,927 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:38,927 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:38,928 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:38,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 11:15:38,928 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:38,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:38,928 INFO L85 PathProgramCache]: Analyzing trace with hash -727283232, now seen corresponding path program 1 times [2025-03-17 11:15:38,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:38,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288720222] [2025-03-17 11:15:38,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:38,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:38,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-17 11:15:38,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-17 11:15:38,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:38,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:15:38,949 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 11:15:38,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-17 11:15:38,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-17 11:15:38,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:38,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:15:38,973 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 11:15:38,973 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 11:15:38,973 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2025-03-17 11:15:38,973 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2025-03-17 11:15:38,973 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2025-03-17 11:15:38,973 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2025-03-17 11:15:38,973 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2025-03-17 11:15:38,973 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2025-03-17 11:15:38,973 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2025-03-17 11:15:38,973 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2025-03-17 11:15:38,973 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2025-03-17 11:15:38,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 11:15:38,973 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:15:38,974 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 11:15:38,974 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-17 11:15:38,994 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-17 11:15:38,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 97 transitions, 234 flow [2025-03-17 11:15:39,019 INFO L124 PetriNetUnfolderBase]: 31/531 cut-off events. [2025-03-17 11:15:39,019 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-03-17 11:15:39,020 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,020 INFO L82 GeneralOperation]: Start removeDead. Operand has 100 places, 97 transitions, 234 flow [2025-03-17 11:15:39,022 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 100 places, 97 transitions, 234 flow [2025-03-17 11:15:39,022 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:15:39,023 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;@2d089349, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:15:39,023 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-17 11:15:39,023 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:15:39,024 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-03-17 11:15:39,024 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:15:39,024 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:39,024 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,024 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,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:39,024 INFO L85 PathProgramCache]: Analyzing trace with hash 2087913516, now seen corresponding path program 1 times [2025-03-17 11:15:39,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:39,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297935021] [2025-03-17 11:15:39,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:39,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:39,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 11:15:39,030 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,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:39,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:39,036 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,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:39,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297935021] [2025-03-17 11:15:39,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297935021] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:39,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:39,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 11:15:39,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452994855] [2025-03-17 11:15:39,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:39,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 11:15:39,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:39,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 11:15:39,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 11:15:39,037 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 97 [2025-03-17 11:15:39,037 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,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:39,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 97 [2025-03-17 11:15:39,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:39,127 INFO L124 PetriNetUnfolderBase]: 157/1308 cut-off events. [2025-03-17 11:15:39,128 INFO L125 PetriNetUnfolderBase]: For 486/771 co-relation queries the response was YES. [2025-03-17 11:15:39,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1735 conditions, 1308 events. 157/1308 cut-off events. For 486/771 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,134 INFO L140 encePairwiseOnDemand]: 90/97 looper letters, 13 selfloop transitions, 0 changer transitions 0/88 dead transitions. [2025-03-17 11:15:39,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 88 transitions, 242 flow [2025-03-17 11:15:39,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 11:15:39,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-17 11:15:39,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 172 transitions. [2025-03-17 11:15:39,136 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8865979381443299 [2025-03-17 11:15:39,136 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,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 88 transitions, 242 flow [2025-03-17 11:15:39,137 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,137 INFO L231 Difference]: Finished difference. Result has 94 places, 88 transitions, 216 flow [2025-03-17 11:15:39,137 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,138 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -6 predicate places. [2025-03-17 11:15:39,138 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 88 transitions, 216 flow [2025-03-17 11:15:39,138 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,138 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:39,138 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,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 11:15:39,138 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,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:39,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1561559100, now seen corresponding path program 1 times [2025-03-17 11:15:39,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:39,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457681826] [2025-03-17 11:15:39,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:39,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:39,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 11:15:39,144 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,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:39,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:39,156 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,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:39,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457681826] [2025-03-17 11:15:39,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457681826] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:39,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:39,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:15:39,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545701428] [2025-03-17 11:15:39,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:39,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:15:39,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:39,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:15:39,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:15:39,172 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 97 [2025-03-17 11:15:39,173 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,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:39,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 97 [2025-03-17 11:15:39,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:39,356 INFO L124 PetriNetUnfolderBase]: 422/2882 cut-off events. [2025-03-17 11:15:39,357 INFO L125 PetriNetUnfolderBase]: For 531/531 co-relation queries the response was YES. [2025-03-17 11:15:39,362 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:39,369 INFO L140 encePairwiseOnDemand]: 94/97 looper letters, 18 selfloop transitions, 2 changer transitions 3/90 dead transitions. [2025-03-17 11:15:39,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 90 transitions, 262 flow [2025-03-17 11:15:39,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:15:39,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:15:39,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 232 transitions. [2025-03-17 11:15:39,370 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7972508591065293 [2025-03-17 11:15:39,370 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:39,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 90 transitions, 262 flow [2025-03-17 11:15:39,371 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:39,372 INFO L231 Difference]: Finished difference. Result has 97 places, 86 transitions, 222 flow [2025-03-17 11:15:39,372 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:39,372 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -3 predicate places. [2025-03-17 11:15:39,372 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 86 transitions, 222 flow [2025-03-17 11:15:39,373 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:39,373 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:39,373 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:39,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 11:15:39,373 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:39,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:39,373 INFO L85 PathProgramCache]: Analyzing trace with hash 954042518, now seen corresponding path program 1 times [2025-03-17 11:15:39,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:39,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081204727] [2025-03-17 11:15:39,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:39,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:39,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 11:15:39,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 11:15:39,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:39,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:39,510 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,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:39,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081204727] [2025-03-17 11:15:39,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081204727] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:39,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:39,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:15:39,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167614315] [2025-03-17 11:15:39,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:39,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:15:39,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:39,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:15:39,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:15:39,579 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 97 [2025-03-17 11:15:39,579 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:39,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:39,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 97 [2025-03-17 11:15:39,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:39,812 INFO L124 PetriNetUnfolderBase]: 1099/3285 cut-off events. [2025-03-17 11:15:39,812 INFO L125 PetriNetUnfolderBase]: For 513/513 co-relation queries the response was YES. [2025-03-17 11:15:39,819 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:39,832 INFO L140 encePairwiseOnDemand]: 91/97 looper letters, 39 selfloop transitions, 6 changer transitions 2/101 dead transitions. [2025-03-17 11:15:39,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 101 transitions, 344 flow [2025-03-17 11:15:39,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:15:39,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:15:39,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 394 transitions. [2025-03-17 11:15:39,833 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6769759450171822 [2025-03-17 11:15:39,833 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:39,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 101 transitions, 344 flow [2025-03-17 11:15:39,834 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:39,835 INFO L231 Difference]: Finished difference. Result has 97 places, 83 transitions, 226 flow [2025-03-17 11:15:39,835 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:39,836 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -3 predicate places. [2025-03-17 11:15:39,836 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 83 transitions, 226 flow [2025-03-17 11:15:39,836 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:39,836 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:39,836 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:39,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 11:15:39,837 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:39,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:39,837 INFO L85 PathProgramCache]: Analyzing trace with hash -470213326, now seen corresponding path program 1 times [2025-03-17 11:15:39,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:39,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446556976] [2025-03-17 11:15:39,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:39,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:39,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 11:15:39,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 11:15:39,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:39,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:39,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:39,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:39,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446556976] [2025-03-17 11:15:39,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446556976] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:39,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:39,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:15:39,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708344666] [2025-03-17 11:15:39,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:39,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:15:39,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:39,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:15:39,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:15:39,912 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 97 [2025-03-17 11:15:39,913 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:39,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:39,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 97 [2025-03-17 11:15:39,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:40,091 INFO L124 PetriNetUnfolderBase]: 408/2431 cut-off events. [2025-03-17 11:15:40,092 INFO L125 PetriNetUnfolderBase]: For 561/561 co-relation queries the response was YES. [2025-03-17 11:15:40,099 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,105 INFO L140 encePairwiseOnDemand]: 92/97 looper letters, 25 selfloop transitions, 5 changer transitions 0/92 dead transitions. [2025-03-17 11:15:40,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 92 transitions, 308 flow [2025-03-17 11:15:40,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:15:40,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:15:40,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 439 transitions. [2025-03-17 11:15:40,107 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7542955326460481 [2025-03-17 11:15:40,107 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,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 92 transitions, 308 flow [2025-03-17 11:15:40,108 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,109 INFO L231 Difference]: Finished difference. Result has 98 places, 86 transitions, 246 flow [2025-03-17 11:15:40,109 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,110 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -2 predicate places. [2025-03-17 11:15:40,110 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 86 transitions, 246 flow [2025-03-17 11:15:40,110 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,110 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:40,110 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,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-17 11:15:40,111 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,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:40,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1805058183, now seen corresponding path program 1 times [2025-03-17 11:15:40,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:40,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536229279] [2025-03-17 11:15:40,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:40,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:40,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-17 11:15:40,123 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,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:40,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:40,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:15:40,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:40,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536229279] [2025-03-17 11:15:40,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536229279] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:40,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:40,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:15:40,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855973633] [2025-03-17 11:15:40,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:40,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:15:40,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:40,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:15:40,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:15:40,138 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 97 [2025-03-17 11:15:40,139 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,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:40,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 97 [2025-03-17 11:15:40,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:40,371 INFO L124 PetriNetUnfolderBase]: 488/2976 cut-off events. [2025-03-17 11:15:40,371 INFO L125 PetriNetUnfolderBase]: For 910/1151 co-relation queries the response was YES. [2025-03-17 11:15:40,377 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:40,385 INFO L140 encePairwiseOnDemand]: 90/97 looper letters, 19 selfloop transitions, 6 changer transitions 0/95 dead transitions. [2025-03-17 11:15:40,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 95 transitions, 326 flow [2025-03-17 11:15:40,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:15:40,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:15:40,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 245 transitions. [2025-03-17 11:15:40,387 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8419243986254296 [2025-03-17 11:15:40,387 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:40,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 95 transitions, 326 flow [2025-03-17 11:15:40,388 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:40,389 INFO L231 Difference]: Finished difference. Result has 100 places, 91 transitions, 286 flow [2025-03-17 11:15:40,389 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:40,389 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 0 predicate places. [2025-03-17 11:15:40,389 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 91 transitions, 286 flow [2025-03-17 11:15:40,389 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:40,389 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:40,390 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:40,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-17 11:15:40,390 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:40,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:40,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1500189933, now seen corresponding path program 1 times [2025-03-17 11:15:40,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:40,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711486291] [2025-03-17 11:15:40,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:40,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:40,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 11:15:40,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 11:15:40,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:40,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:40,461 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,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:40,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711486291] [2025-03-17 11:15:40,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711486291] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:40,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:40,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 11:15:40,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025589997] [2025-03-17 11:15:40,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:40,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 11:15:40,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:40,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 11:15:40,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:15:40,509 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 97 [2025-03-17 11:15:40,509 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:40,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:40,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 97 [2025-03-17 11:15:40,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:40,806 INFO L124 PetriNetUnfolderBase]: 704/3458 cut-off events. [2025-03-17 11:15:40,806 INFO L125 PetriNetUnfolderBase]: For 1842/1941 co-relation queries the response was YES. [2025-03-17 11:15:40,815 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:40,824 INFO L140 encePairwiseOnDemand]: 92/97 looper letters, 36 selfloop transitions, 8 changer transitions 0/107 dead transitions. [2025-03-17 11:15:40,824 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 107 transitions, 440 flow [2025-03-17 11:15:40,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 11:15:40,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 11:15:40,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 653 transitions. [2025-03-17 11:15:40,826 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7479954180985109 [2025-03-17 11:15:40,826 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:40,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 107 transitions, 440 flow [2025-03-17 11:15:40,829 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:40,830 INFO L231 Difference]: Finished difference. Result has 109 places, 94 transitions, 318 flow [2025-03-17 11:15:40,830 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:40,830 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 9 predicate places. [2025-03-17 11:15:40,830 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 94 transitions, 318 flow [2025-03-17 11:15:40,830 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:40,831 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:40,831 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:40,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-17 11:15:40,831 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:40,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:40,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1807460103, now seen corresponding path program 1 times [2025-03-17 11:15:40,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:40,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297216693] [2025-03-17 11:15:40,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:40,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:40,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-17 11:15:40,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-17 11:15:40,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:40,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:40,929 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,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:40,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297216693] [2025-03-17 11:15:40,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297216693] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:40,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:40,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 11:15:40,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301317793] [2025-03-17 11:15:40,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:40,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 11:15:40,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:40,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 11:15:40,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-17 11:15:40,972 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 97 [2025-03-17 11:15:40,973 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:40,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:40,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 97 [2025-03-17 11:15:40,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:41,239 INFO L124 PetriNetUnfolderBase]: 616/3345 cut-off events. [2025-03-17 11:15:41,240 INFO L125 PetriNetUnfolderBase]: For 1654/1730 co-relation queries the response was YES. [2025-03-17 11:15:41,247 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,254 INFO L140 encePairwiseOnDemand]: 92/97 looper letters, 44 selfloop transitions, 11 changer transitions 0/118 dead transitions. [2025-03-17 11:15:41,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 118 transitions, 528 flow [2025-03-17 11:15:41,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 11:15:41,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-17 11:15:41,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 868 transitions. [2025-03-17 11:15:41,256 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7457044673539519 [2025-03-17 11:15:41,256 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,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 118 transitions, 528 flow [2025-03-17 11:15:41,257 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,258 INFO L231 Difference]: Finished difference. Result has 118 places, 96 transitions, 346 flow [2025-03-17 11:15:41,259 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,259 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 18 predicate places. [2025-03-17 11:15:41,259 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 96 transitions, 346 flow [2025-03-17 11:15:41,259 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,260 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:41,260 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,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-17 11:15:41,260 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,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:41,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1925466822, now seen corresponding path program 1 times [2025-03-17 11:15:41,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:41,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312306588] [2025-03-17 11:15:41,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:41,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:41,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-17 11:15:41,273 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,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:41,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:41,366 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,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:41,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312306588] [2025-03-17 11:15:41,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312306588] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:41,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:41,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 11:15:41,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738663914] [2025-03-17 11:15:41,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:41,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 11:15:41,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:41,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 11:15:41,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-17 11:15:41,418 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 97 [2025-03-17 11:15:41,419 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:41,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:41,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 97 [2025-03-17 11:15:41,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:41,567 INFO L124 PetriNetUnfolderBase]: 181/716 cut-off events. [2025-03-17 11:15:41,568 INFO L125 PetriNetUnfolderBase]: For 820/820 co-relation queries the response was YES. [2025-03-17 11:15:41,569 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:41,570 INFO L140 encePairwiseOnDemand]: 92/97 looper letters, 40 selfloop transitions, 13 changer transitions 0/92 dead transitions. [2025-03-17 11:15:41,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 92 transitions, 468 flow [2025-03-17 11:15:41,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 11:15:41,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-17 11:15:41,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1074 transitions. [2025-03-17 11:15:41,572 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7381443298969073 [2025-03-17 11:15:41,572 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:41,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 92 transitions, 468 flow [2025-03-17 11:15:41,574 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:41,574 INFO L231 Difference]: Finished difference. Result has 94 places, 62 transitions, 224 flow [2025-03-17 11:15:41,574 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:41,575 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -6 predicate places. [2025-03-17 11:15:41,575 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 62 transitions, 224 flow [2025-03-17 11:15:41,575 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:41,575 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:41,575 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:41,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-17 11:15:41,576 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:41,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:41,576 INFO L85 PathProgramCache]: Analyzing trace with hash -872361339, now seen corresponding path program 1 times [2025-03-17 11:15:41,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:41,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912617698] [2025-03-17 11:15:41,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:41,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:41,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-17 11:15:41,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-17 11:15:41,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:41,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:15:41,592 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 11:15:41,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-17 11:15:41,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-17 11:15:41,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:41,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:15:41,608 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 11:15:41,609 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 11:15:41,609 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-03-17 11:15:41,609 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2025-03-17 11:15:41,609 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2025-03-17 11:15:41,610 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2025-03-17 11:15:41,610 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2025-03-17 11:15:41,610 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2025-03-17 11:15:41,610 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2025-03-17 11:15:41,610 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2025-03-17 11:15:41,610 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2025-03-17 11:15:41,610 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2025-03-17 11:15:41,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-17 11:15:41,610 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:15:41,611 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 11:15:41,611 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-03-17 11:15:41,628 INFO L143 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2025-03-17 11:15:41,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 105 transitions, 265 flow [2025-03-17 11:15:41,672 INFO L124 PetriNetUnfolderBase]: 66/934 cut-off events. [2025-03-17 11:15:41,672 INFO L125 PetriNetUnfolderBase]: For 110/110 co-relation queries the response was YES. [2025-03-17 11:15:41,674 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:41,674 INFO L82 GeneralOperation]: Start removeDead. Operand has 109 places, 105 transitions, 265 flow [2025-03-17 11:15:41,677 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 109 places, 105 transitions, 265 flow [2025-03-17 11:15:41,677 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:15:41,678 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;@2d089349, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:15:41,678 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-03-17 11:15:41,679 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:15:41,679 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-03-17 11:15:41,679 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:15:41,679 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:41,679 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:15:41,679 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:41,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:41,679 INFO L85 PathProgramCache]: Analyzing trace with hash 921893900, now seen corresponding path program 1 times [2025-03-17 11:15:41,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:41,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031913992] [2025-03-17 11:15:41,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:41,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:41,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 11:15:41,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 11:15:41,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:41,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:41,687 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,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:41,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031913992] [2025-03-17 11:15:41,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031913992] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:41,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:41,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 11:15:41,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482675321] [2025-03-17 11:15:41,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:41,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 11:15:41,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:41,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 11:15:41,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 11:15:41,688 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 105 [2025-03-17 11:15:41,689 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:41,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:41,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 105 [2025-03-17 11:15:41,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:41,924 INFO L124 PetriNetUnfolderBase]: 622/3788 cut-off events. [2025-03-17 11:15:41,924 INFO L125 PetriNetUnfolderBase]: For 1688/2994 co-relation queries the response was YES. [2025-03-17 11:15:41,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5251 conditions, 3788 events. 622/3788 cut-off events. For 1688/2994 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:41,946 INFO L140 encePairwiseOnDemand]: 97/105 looper letters, 16 selfloop transitions, 0 changer transitions 0/95 dead transitions. [2025-03-17 11:15:41,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 95 transitions, 277 flow [2025-03-17 11:15:41,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 11:15:41,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-17 11:15:41,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 184 transitions. [2025-03-17 11:15:41,948 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8761904761904762 [2025-03-17 11:15:41,948 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:41,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 95 transitions, 277 flow [2025-03-17 11:15:41,949 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:41,950 INFO L231 Difference]: Finished difference. Result has 102 places, 95 transitions, 245 flow [2025-03-17 11:15:41,950 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:41,950 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, -7 predicate places. [2025-03-17 11:15:41,950 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 95 transitions, 245 flow [2025-03-17 11:15:41,950 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:41,950 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:41,951 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:41,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-17 11:15:41,951 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:41,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:41,951 INFO L85 PathProgramCache]: Analyzing trace with hash -2016809339, now seen corresponding path program 1 times [2025-03-17 11:15:41,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:41,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803406584] [2025-03-17 11:15:41,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:41,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:41,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 11:15:41,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 11:15:41,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:41,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:41,962 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,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:41,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803406584] [2025-03-17 11:15:41,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803406584] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:41,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:41,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:15:41,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711664376] [2025-03-17 11:15:41,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:41,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:15:41,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:41,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:15:41,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:15:41,978 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 105 [2025-03-17 11:15:41,978 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:41,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:41,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 105 [2025-03-17 11:15:41,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:42,540 INFO L124 PetriNetUnfolderBase]: 1439/8085 cut-off events. [2025-03-17 11:15:42,540 INFO L125 PetriNetUnfolderBase]: For 1886/1886 co-relation queries the response was YES. [2025-03-17 11:15:42,556 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:42,571 INFO L140 encePairwiseOnDemand]: 102/105 looper letters, 21 selfloop transitions, 2 changer transitions 3/97 dead transitions. [2025-03-17 11:15:42,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 97 transitions, 297 flow [2025-03-17 11:15:42,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:15:42,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:15:42,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 247 transitions. [2025-03-17 11:15:42,572 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7841269841269841 [2025-03-17 11:15:42,572 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:42,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 97 transitions, 297 flow [2025-03-17 11:15:42,574 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:42,575 INFO L231 Difference]: Finished difference. Result has 105 places, 93 transitions, 251 flow [2025-03-17 11:15:42,575 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:42,575 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, -4 predicate places. [2025-03-17 11:15:42,575 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 93 transitions, 251 flow [2025-03-17 11:15:42,575 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:42,575 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:42,575 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:42,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-17 11:15:42,576 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:42,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:42,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1084871809, now seen corresponding path program 1 times [2025-03-17 11:15:42,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:42,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137603003] [2025-03-17 11:15:42,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:42,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:42,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 11:15:42,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 11:15:42,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:42,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:42,711 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,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:42,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137603003] [2025-03-17 11:15:42,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137603003] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:42,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:42,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:15:42,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553189965] [2025-03-17 11:15:42,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:42,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:15:42,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:42,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:15:42,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:15:42,785 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 105 [2025-03-17 11:15:42,786 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:42,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:42,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 105 [2025-03-17 11:15:42,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:43,490 INFO L124 PetriNetUnfolderBase]: 3704/9558 cut-off events. [2025-03-17 11:15:43,491 INFO L125 PetriNetUnfolderBase]: For 1820/1820 co-relation queries the response was YES. [2025-03-17 11:15:43,511 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:43,533 INFO L140 encePairwiseOnDemand]: 99/105 looper letters, 46 selfloop transitions, 6 changer transitions 2/112 dead transitions. [2025-03-17 11:15:43,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 112 transitions, 395 flow [2025-03-17 11:15:43,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:15:43,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:15:43,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 425 transitions. [2025-03-17 11:15:43,535 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6746031746031746 [2025-03-17 11:15:43,535 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:43,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 112 transitions, 395 flow [2025-03-17 11:15:43,536 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:43,537 INFO L231 Difference]: Finished difference. Result has 105 places, 90 transitions, 255 flow [2025-03-17 11:15:43,537 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:43,538 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, -4 predicate places. [2025-03-17 11:15:43,538 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 90 transitions, 255 flow [2025-03-17 11:15:43,538 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:43,538 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:43,538 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:43,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-17 11:15:43,538 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:43,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:43,539 INFO L85 PathProgramCache]: Analyzing trace with hash 690968789, now seen corresponding path program 1 times [2025-03-17 11:15:43,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:43,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195380060] [2025-03-17 11:15:43,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:43,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:43,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 11:15:43,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 11:15:43,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:43,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:43,569 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,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:43,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195380060] [2025-03-17 11:15:43,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195380060] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:43,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:43,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:15:43,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423764901] [2025-03-17 11:15:43,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:43,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:15:43,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:43,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:15:43,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:15:43,602 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 105 [2025-03-17 11:15:43,603 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:43,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:43,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 105 [2025-03-17 11:15:43,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:44,073 INFO L124 PetriNetUnfolderBase]: 1288/6671 cut-off events. [2025-03-17 11:15:44,073 INFO L125 PetriNetUnfolderBase]: For 1950/1950 co-relation queries the response was YES. [2025-03-17 11:15:44,089 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,103 INFO L140 encePairwiseOnDemand]: 100/105 looper letters, 28 selfloop transitions, 5 changer transitions 0/99 dead transitions. [2025-03-17 11:15:44,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 99 transitions, 343 flow [2025-03-17 11:15:44,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:15:44,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:15:44,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 466 transitions. [2025-03-17 11:15:44,104 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7396825396825397 [2025-03-17 11:15:44,104 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,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 99 transitions, 343 flow [2025-03-17 11:15:44,106 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,107 INFO L231 Difference]: Finished difference. Result has 106 places, 93 transitions, 275 flow [2025-03-17 11:15:44,108 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,108 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, -3 predicate places. [2025-03-17 11:15:44,108 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 93 transitions, 275 flow [2025-03-17 11:15:44,109 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,109 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:44,109 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,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-17 11:15:44,109 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,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:44,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1279632388, now seen corresponding path program 1 times [2025-03-17 11:15:44,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:44,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121036760] [2025-03-17 11:15:44,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:44,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:44,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-17 11:15:44,118 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,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:44,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:44,129 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,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:44,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121036760] [2025-03-17 11:15:44,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121036760] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:44,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:44,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:15:44,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163986276] [2025-03-17 11:15:44,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:44,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:15:44,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:44,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:15:44,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:15:44,132 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 105 [2025-03-17 11:15:44,132 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,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:44,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 105 [2025-03-17 11:15:44,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:44,664 INFO L124 PetriNetUnfolderBase]: 1754/8829 cut-off events. [2025-03-17 11:15:44,664 INFO L125 PetriNetUnfolderBase]: For 3134/3973 co-relation queries the response was YES. [2025-03-17 11:15:44,684 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:44,699 INFO L140 encePairwiseOnDemand]: 97/105 looper letters, 23 selfloop transitions, 7 changer transitions 0/104 dead transitions. [2025-03-17 11:15:44,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 104 transitions, 372 flow [2025-03-17 11:15:44,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:15:44,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:15:44,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 262 transitions. [2025-03-17 11:15:44,700 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8317460317460318 [2025-03-17 11:15:44,700 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:44,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 104 transitions, 372 flow [2025-03-17 11:15:44,703 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:44,704 INFO L231 Difference]: Finished difference. Result has 108 places, 99 transitions, 323 flow [2025-03-17 11:15:44,704 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:44,704 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, -1 predicate places. [2025-03-17 11:15:44,704 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 99 transitions, 323 flow [2025-03-17 11:15:44,705 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:44,705 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:44,705 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:44,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-17 11:15:44,705 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:44,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:44,705 INFO L85 PathProgramCache]: Analyzing trace with hash -598922721, now seen corresponding path program 1 times [2025-03-17 11:15:44,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:44,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057364441] [2025-03-17 11:15:44,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:44,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:44,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 11:15:44,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 11:15:44,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:44,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:44,758 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,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:44,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057364441] [2025-03-17 11:15:44,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057364441] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:44,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:44,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 11:15:44,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586145312] [2025-03-17 11:15:44,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:44,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 11:15:44,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:44,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 11:15:44,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:15:44,792 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 105 [2025-03-17 11:15:44,793 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:44,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:44,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 105 [2025-03-17 11:15:44,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:45,641 INFO L124 PetriNetUnfolderBase]: 2370/9833 cut-off events. [2025-03-17 11:15:45,641 INFO L125 PetriNetUnfolderBase]: For 6093/6429 co-relation queries the response was YES. [2025-03-17 11:15:45,669 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:45,698 INFO L140 encePairwiseOnDemand]: 100/105 looper letters, 40 selfloop transitions, 8 changer transitions 0/115 dead transitions. [2025-03-17 11:15:45,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 115 transitions, 485 flow [2025-03-17 11:15:45,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 11:15:45,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 11:15:45,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 692 transitions. [2025-03-17 11:15:45,699 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7322751322751323 [2025-03-17 11:15:45,699 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:45,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 115 transitions, 485 flow [2025-03-17 11:15:45,705 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:45,707 INFO L231 Difference]: Finished difference. Result has 117 places, 102 transitions, 353 flow [2025-03-17 11:15:45,707 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:45,708 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, 8 predicate places. [2025-03-17 11:15:45,708 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 102 transitions, 353 flow [2025-03-17 11:15:45,708 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:45,708 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:45,709 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:45,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-17 11:15:45,709 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:45,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:45,709 INFO L85 PathProgramCache]: Analyzing trace with hash -253528687, now seen corresponding path program 1 times [2025-03-17 11:15:45,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:45,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508775657] [2025-03-17 11:15:45,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:45,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:45,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-17 11:15:45,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-17 11:15:45,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:45,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:45,798 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,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:45,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508775657] [2025-03-17 11:15:45,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508775657] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:45,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:45,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 11:15:45,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161705667] [2025-03-17 11:15:45,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:45,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 11:15:45,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:45,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 11:15:45,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-17 11:15:45,843 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 105 [2025-03-17 11:15:45,844 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:45,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:45,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 105 [2025-03-17 11:15:45,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:46,656 INFO L124 PetriNetUnfolderBase]: 2282/9674 cut-off events. [2025-03-17 11:15:46,656 INFO L125 PetriNetUnfolderBase]: For 5443/5756 co-relation queries the response was YES. [2025-03-17 11:15:46,678 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,699 INFO L140 encePairwiseOnDemand]: 100/105 looper letters, 50 selfloop transitions, 11 changer transitions 0/128 dead transitions. [2025-03-17 11:15:46,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 128 transitions, 589 flow [2025-03-17 11:15:46,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 11:15:46,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-17 11:15:46,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 921 transitions. [2025-03-17 11:15:46,701 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7309523809523809 [2025-03-17 11:15:46,701 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,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 128 transitions, 589 flow [2025-03-17 11:15:46,703 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,704 INFO L231 Difference]: Finished difference. Result has 126 places, 105 transitions, 391 flow [2025-03-17 11:15:46,704 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,705 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, 17 predicate places. [2025-03-17 11:15:46,705 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 105 transitions, 391 flow [2025-03-17 11:15:46,705 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,705 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:46,705 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,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-17 11:15:46,706 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,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:46,706 INFO L85 PathProgramCache]: Analyzing trace with hash 666141764, now seen corresponding path program 1 times [2025-03-17 11:15:46,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:46,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161165635] [2025-03-17 11:15:46,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:46,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:46,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-17 11:15:46,718 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,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:46,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:46,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:15:46,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:46,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161165635] [2025-03-17 11:15:46,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161165635] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:46,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:46,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 11:15:46,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140503014] [2025-03-17 11:15:46,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:46,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 11:15:46,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:46,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 11:15:46,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-17 11:15:46,868 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 105 [2025-03-17 11:15:46,869 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:46,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:46,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 105 [2025-03-17 11:15:46,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:47,719 INFO L124 PetriNetUnfolderBase]: 2037/9561 cut-off events. [2025-03-17 11:15:47,719 INFO L125 PetriNetUnfolderBase]: For 5627/5864 co-relation queries the response was YES. [2025-03-17 11:15:47,737 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,754 INFO L140 encePairwiseOnDemand]: 100/105 looper letters, 61 selfloop transitions, 14 changer transitions 0/142 dead transitions. [2025-03-17 11:15:47,754 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 142 transitions, 697 flow [2025-03-17 11:15:47,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 11:15:47,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-17 11:15:47,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1151 transitions. [2025-03-17 11:15:47,756 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7307936507936508 [2025-03-17 11:15:47,756 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,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 142 transitions, 697 flow [2025-03-17 11:15:47,759 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,760 INFO L231 Difference]: Finished difference. Result has 135 places, 107 transitions, 417 flow [2025-03-17 11:15:47,760 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,760 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, 26 predicate places. [2025-03-17 11:15:47,760 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 107 transitions, 417 flow [2025-03-17 11:15:47,760 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,760 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:47,761 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,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-17 11:15:47,761 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,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:47,761 INFO L85 PathProgramCache]: Analyzing trace with hash 161660950, now seen corresponding path program 1 times [2025-03-17 11:15:47,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:47,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725774246] [2025-03-17 11:15:47,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:47,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:47,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-17 11:15:47,775 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,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:47,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:47,890 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,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:47,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725774246] [2025-03-17 11:15:47,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725774246] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:47,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:47,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 11:15:47,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248803954] [2025-03-17 11:15:47,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:47,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 11:15:47,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:47,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 11:15:47,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-03-17 11:15:47,966 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 105 [2025-03-17 11:15:47,967 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:47,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:47,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 105 [2025-03-17 11:15:47,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:48,194 INFO L124 PetriNetUnfolderBase]: 485/1596 cut-off events. [2025-03-17 11:15:48,195 INFO L125 PetriNetUnfolderBase]: For 2656/2656 co-relation queries the response was YES. [2025-03-17 11:15:48,199 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,202 INFO L140 encePairwiseOnDemand]: 100/105 looper letters, 57 selfloop transitions, 16 changer transitions 0/116 dead transitions. [2025-03-17 11:15:48,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 116 transitions, 628 flow [2025-03-17 11:15:48,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 11:15:48,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-17 11:15:48,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1370 transitions. [2025-03-17 11:15:48,203 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7248677248677249 [2025-03-17 11:15:48,203 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,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 116 transitions, 628 flow [2025-03-17 11:15:48,206 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,207 INFO L231 Difference]: Finished difference. Result has 110 places, 71 transitions, 270 flow [2025-03-17 11:15:48,207 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,207 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, 1 predicate places. [2025-03-17 11:15:48,207 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 71 transitions, 270 flow [2025-03-17 11:15:48,207 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,207 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:48,208 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,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-17 11:15:48,208 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,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:48,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1746814455, now seen corresponding path program 1 times [2025-03-17 11:15:48,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:48,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349934580] [2025-03-17 11:15:48,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:48,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:48,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-17 11:15:48,226 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,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:48,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:15:48,226 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 11:15:48,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-17 11:15:48,234 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,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:48,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:15:48,241 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 11:15:48,241 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 11:15:48,241 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2025-03-17 11:15:48,241 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2025-03-17 11:15:48,241 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2025-03-17 11:15:48,242 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2025-03-17 11:15:48,242 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2025-03-17 11:15:48,242 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining) [2025-03-17 11:15:48,242 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2025-03-17 11:15:48,242 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2025-03-17 11:15:48,242 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2025-03-17 11:15:48,242 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2025-03-17 11:15:48,242 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2025-03-17 11:15:48,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-17 11:15:48,242 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:15:48,243 WARN L246 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 11:15:48,243 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2025-03-17 11:15:48,255 INFO L143 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2025-03-17 11:15:48,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 113 transitions, 298 flow [2025-03-17 11:15:48,340 INFO L124 PetriNetUnfolderBase]: 149/1721 cut-off events. [2025-03-17 11:15:48,340 INFO L125 PetriNetUnfolderBase]: For 242/242 co-relation queries the response was YES. [2025-03-17 11:15:48,343 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,343 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 113 transitions, 298 flow [2025-03-17 11:15:48,346 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 113 transitions, 298 flow [2025-03-17 11:15:48,347 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:15:48,347 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;@2d089349, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:15:48,347 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-03-17 11:15:48,348 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:15:48,348 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-03-17 11:15:48,348 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:15:48,348 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:48,348 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,348 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,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:48,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1846429972, now seen corresponding path program 1 times [2025-03-17 11:15:48,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:48,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890701629] [2025-03-17 11:15:48,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:48,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:48,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 11:15:48,352 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,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:48,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:48,354 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,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:48,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890701629] [2025-03-17 11:15:48,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890701629] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:48,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:48,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 11:15:48,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515622056] [2025-03-17 11:15:48,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:48,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 11:15:48,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:48,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 11:15:48,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 11:15:48,355 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 113 [2025-03-17 11:15:48,355 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,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:48,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 113 [2025-03-17 11:15:48,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:49,106 INFO L124 PetriNetUnfolderBase]: 2323/11440 cut-off events. [2025-03-17 11:15:49,106 INFO L125 PetriNetUnfolderBase]: For 5938/11264 co-relation queries the response was YES. [2025-03-17 11:15:49,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16399 conditions, 11440 events. 2323/11440 cut-off events. For 5938/11264 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,157 INFO L140 encePairwiseOnDemand]: 104/113 looper letters, 19 selfloop transitions, 0 changer transitions 0/102 dead transitions. [2025-03-17 11:15:49,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 102 transitions, 314 flow [2025-03-17 11:15:49,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 11:15:49,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-17 11:15:49,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 196 transitions. [2025-03-17 11:15:49,158 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8672566371681416 [2025-03-17 11:15:49,158 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,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 102 transitions, 314 flow [2025-03-17 11:15:49,160 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,161 INFO L231 Difference]: Finished difference. Result has 110 places, 102 transitions, 276 flow [2025-03-17 11:15:49,161 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,161 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, -8 predicate places. [2025-03-17 11:15:49,161 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 102 transitions, 276 flow [2025-03-17 11:15:49,162 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,162 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:49,162 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,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-17 11:15:49,162 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,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:49,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1167750102, now seen corresponding path program 1 times [2025-03-17 11:15:49,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:49,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328730285] [2025-03-17 11:15:49,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:49,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:49,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 11:15:49,166 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,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:49,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:49,172 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,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:49,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328730285] [2025-03-17 11:15:49,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328730285] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:49,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:49,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:15:49,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060770631] [2025-03-17 11:15:49,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:49,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:15:49,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:49,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:15:49,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:15:49,190 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 113 [2025-03-17 11:15:49,191 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,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:49,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 113 [2025-03-17 11:15:49,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:50,958 INFO L124 PetriNetUnfolderBase]: 4800/23220 cut-off events. [2025-03-17 11:15:50,958 INFO L125 PetriNetUnfolderBase]: For 6357/6357 co-relation queries the response was YES. [2025-03-17 11:15:51,026 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,071 INFO L140 encePairwiseOnDemand]: 110/113 looper letters, 24 selfloop transitions, 2 changer transitions 3/104 dead transitions. [2025-03-17 11:15:51,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 104 transitions, 334 flow [2025-03-17 11:15:51,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:15:51,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:15:51,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 262 transitions. [2025-03-17 11:15:51,072 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7728613569321534 [2025-03-17 11:15:51,072 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,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 104 transitions, 334 flow [2025-03-17 11:15:51,074 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,075 INFO L231 Difference]: Finished difference. Result has 113 places, 100 transitions, 282 flow [2025-03-17 11:15:51,075 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,075 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, -5 predicate places. [2025-03-17 11:15:51,075 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 100 transitions, 282 flow [2025-03-17 11:15:51,075 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,075 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:51,075 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,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-17 11:15:51,076 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,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:51,076 INFO L85 PathProgramCache]: Analyzing trace with hash 34128496, now seen corresponding path program 1 times [2025-03-17 11:15:51,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:51,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144723098] [2025-03-17 11:15:51,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:51,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:51,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 11:15:51,082 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,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:51,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:51,157 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,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:51,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144723098] [2025-03-17 11:15:51,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144723098] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:51,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:51,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:15:51,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537291620] [2025-03-17 11:15:51,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:51,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:15:51,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:51,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:15:51,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:15:51,222 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 113 [2025-03-17 11:15:51,223 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,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:51,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 113 [2025-03-17 11:15:51,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:53,389 INFO L124 PetriNetUnfolderBase]: 12237/28343 cut-off events. [2025-03-17 11:15:53,390 INFO L125 PetriNetUnfolderBase]: For 6163/6163 co-relation queries the response was YES. [2025-03-17 11:15:53,451 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,509 INFO L140 encePairwiseOnDemand]: 107/113 looper letters, 53 selfloop transitions, 6 changer transitions 2/123 dead transitions. [2025-03-17 11:15:53,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 123 transitions, 448 flow [2025-03-17 11:15:53,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:15:53,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:15:53,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 456 transitions. [2025-03-17 11:15:53,511 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.672566371681416 [2025-03-17 11:15:53,511 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,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 123 transitions, 448 flow [2025-03-17 11:15:53,512 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,513 INFO L231 Difference]: Finished difference. Result has 113 places, 97 transitions, 286 flow [2025-03-17 11:15:53,513 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,514 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, -5 predicate places. [2025-03-17 11:15:53,514 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 97 transitions, 286 flow [2025-03-17 11:15:53,514 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,514 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:53,514 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,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-17 11:15:53,514 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,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:53,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1310358400, now seen corresponding path program 1 times [2025-03-17 11:15:53,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:53,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415318467] [2025-03-17 11:15:53,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:53,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:53,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 11:15:53,521 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,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:53,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:53,542 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,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:53,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415318467] [2025-03-17 11:15:53,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415318467] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:53,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:53,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:15:53,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963158272] [2025-03-17 11:15:53,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:53,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:15:53,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:53,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:15:53,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:15:53,563 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 113 [2025-03-17 11:15:53,564 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,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:53,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 113 [2025-03-17 11:15:53,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:54,958 INFO L124 PetriNetUnfolderBase]: 3980/18675 cut-off events. [2025-03-17 11:15:54,958 INFO L125 PetriNetUnfolderBase]: For 6485/6485 co-relation queries the response was YES. [2025-03-17 11:15:54,992 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,031 INFO L140 encePairwiseOnDemand]: 108/113 looper letters, 31 selfloop transitions, 5 changer transitions 0/106 dead transitions. [2025-03-17 11:15:55,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 106 transitions, 380 flow [2025-03-17 11:15:55,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:15:55,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:15:55,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 493 transitions. [2025-03-17 11:15:55,034 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7271386430678466 [2025-03-17 11:15:55,034 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,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 106 transitions, 380 flow [2025-03-17 11:15:55,037 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,038 INFO L231 Difference]: Finished difference. Result has 114 places, 100 transitions, 306 flow [2025-03-17 11:15:55,038 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,038 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, -4 predicate places. [2025-03-17 11:15:55,038 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 100 transitions, 306 flow [2025-03-17 11:15:55,038 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,038 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:55,038 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,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-17 11:15:55,039 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,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:55,039 INFO L85 PathProgramCache]: Analyzing trace with hash 153768073, now seen corresponding path program 1 times [2025-03-17 11:15:55,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:55,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894862053] [2025-03-17 11:15:55,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:55,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:55,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-17 11:15:55,048 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,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:55,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:55,062 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,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:55,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894862053] [2025-03-17 11:15:55,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894862053] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:55,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:55,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:15:55,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136880358] [2025-03-17 11:15:55,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:55,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:15:55,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:55,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:15:55,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:15:55,066 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 113 [2025-03-17 11:15:55,066 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,066 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:55,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 113 [2025-03-17 11:15:55,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:57,471 INFO L124 PetriNetUnfolderBase]: 5985/26381 cut-off events. [2025-03-17 11:15:57,471 INFO L125 PetriNetUnfolderBase]: For 10449/13035 co-relation queries the response was YES. [2025-03-17 11:15:57,588 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,676 INFO L140 encePairwiseOnDemand]: 104/113 looper letters, 27 selfloop transitions, 8 changer transitions 0/113 dead transitions. [2025-03-17 11:15:57,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 113 transitions, 420 flow [2025-03-17 11:15:57,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:15:57,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:15:57,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 279 transitions. [2025-03-17 11:15:57,680 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8230088495575221 [2025-03-17 11:15:57,680 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,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 113 transitions, 420 flow [2025-03-17 11:15:57,691 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,692 INFO L231 Difference]: Finished difference. Result has 116 places, 107 transitions, 362 flow [2025-03-17 11:15:57,692 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,692 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, -2 predicate places. [2025-03-17 11:15:57,693 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 107 transitions, 362 flow [2025-03-17 11:15:57,693 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,693 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:57,693 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,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-17 11:15:57,693 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,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:57,693 INFO L85 PathProgramCache]: Analyzing trace with hash 784753645, now seen corresponding path program 1 times [2025-03-17 11:15:57,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:57,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290510508] [2025-03-17 11:15:57,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:57,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:57,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 11:15:57,704 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,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:57,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:57,756 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,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:57,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290510508] [2025-03-17 11:15:57,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290510508] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:57,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:57,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 11:15:57,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916651726] [2025-03-17 11:15:57,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:57,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 11:15:57,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:57,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 11:15:57,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:15:57,801 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 113 [2025-03-17 11:15:57,802 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,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:57,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 113 [2025-03-17 11:15:57,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:59,851 INFO L124 PetriNetUnfolderBase]: 7561/28064 cut-off events. [2025-03-17 11:15:59,852 INFO L125 PetriNetUnfolderBase]: For 19957/21015 co-relation queries the response was YES. [2025-03-17 11:15:59,980 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,089 INFO L140 encePairwiseOnDemand]: 108/113 looper letters, 44 selfloop transitions, 8 changer transitions 0/123 dead transitions. [2025-03-17 11:16:00,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 123 transitions, 532 flow [2025-03-17 11:16:00,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 11:16:00,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 11:16:00,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 731 transitions. [2025-03-17 11:16:00,090 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7187807276302851 [2025-03-17 11:16:00,090 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,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 123 transitions, 532 flow [2025-03-17 11:16:00,103 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,105 INFO L231 Difference]: Finished difference. Result has 125 places, 110 transitions, 390 flow [2025-03-17 11:16:00,105 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,105 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 7 predicate places. [2025-03-17 11:16:00,105 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 110 transitions, 390 flow [2025-03-17 11:16:00,105 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,105 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:16:00,105 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,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-03-17 11:16:00,105 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,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:16:00,106 INFO L85 PathProgramCache]: Analyzing trace with hash -354968827, now seen corresponding path program 1 times [2025-03-17 11:16:00,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:16:00,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167239274] [2025-03-17 11:16:00,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:16:00,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:16:00,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-17 11:16:00,118 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,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:16:00,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:16:00,190 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,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:16:00,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167239274] [2025-03-17 11:16:00,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167239274] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:16:00,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:16:00,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 11:16:00,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421247339] [2025-03-17 11:16:00,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:16:00,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 11:16:00,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:16:00,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 11:16:00,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-17 11:16:00,235 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 113 [2025-03-17 11:16:00,236 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,236 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:16:00,236 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 113 [2025-03-17 11:16:00,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:16:03,245 INFO L124 PetriNetUnfolderBase]: 7473/27953 cut-off events. [2025-03-17 11:16:03,245 INFO L125 PetriNetUnfolderBase]: For 17394/18429 co-relation queries the response was YES. [2025-03-17 11:16:03,380 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,483 INFO L140 encePairwiseOnDemand]: 108/113 looper letters, 54 selfloop transitions, 11 changer transitions 0/136 dead transitions. [2025-03-17 11:16:03,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 136 transitions, 634 flow [2025-03-17 11:16:03,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 11:16:03,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-17 11:16:03,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 972 transitions. [2025-03-17 11:16:03,484 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7168141592920354 [2025-03-17 11:16:03,484 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,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 136 transitions, 634 flow [2025-03-17 11:16:03,489 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,490 INFO L231 Difference]: Finished difference. Result has 134 places, 113 transitions, 428 flow [2025-03-17 11:16:03,490 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,491 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 16 predicate places. [2025-03-17 11:16:03,491 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 113 transitions, 428 flow [2025-03-17 11:16:03,491 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,491 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:16:03,491 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,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-03-17 11:16:03,491 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,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:16:03,492 INFO L85 PathProgramCache]: Analyzing trace with hash 12619166, now seen corresponding path program 1 times [2025-03-17 11:16:03,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:16:03,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625505099] [2025-03-17 11:16:03,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:16:03,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:16:03,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-17 11:16:03,506 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,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:16:03,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:16:03,616 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,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:16:03,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625505099] [2025-03-17 11:16:03,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625505099] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:16:03,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:16:03,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 11:16:03,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029497643] [2025-03-17 11:16:03,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:16:03,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 11:16:03,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:16:03,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 11:16:03,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-17 11:16:03,667 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 113 [2025-03-17 11:16:03,667 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,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:16:03,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 113 [2025-03-17 11:16:03,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:16:05,919 INFO L124 PetriNetUnfolderBase]: 7228/27696 cut-off events. [2025-03-17 11:16:05,919 INFO L125 PetriNetUnfolderBase]: For 18372/19331 co-relation queries the response was YES. [2025-03-17 11:16:06,059 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,160 INFO L140 encePairwiseOnDemand]: 108/113 looper letters, 67 selfloop transitions, 14 changer transitions 0/152 dead transitions. [2025-03-17 11:16:06,160 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 152 transitions, 764 flow [2025-03-17 11:16:06,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 11:16:06,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-17 11:16:06,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1216 transitions. [2025-03-17 11:16:06,162 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7174041297935103 [2025-03-17 11:16:06,162 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,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 152 transitions, 764 flow [2025-03-17 11:16:06,167 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,168 INFO L231 Difference]: Finished difference. Result has 143 places, 116 transitions, 466 flow [2025-03-17 11:16:06,168 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,168 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 25 predicate places. [2025-03-17 11:16:06,169 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 116 transitions, 466 flow [2025-03-17 11:16:06,169 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,169 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:16:06,169 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,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-03-17 11:16:06,169 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,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:16:06,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1411461944, now seen corresponding path program 1 times [2025-03-17 11:16:06,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:16:06,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842841514] [2025-03-17 11:16:06,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:16:06,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:16:06,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-17 11:16:06,182 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,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:16:06,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:16:06,283 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,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:16:06,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842841514] [2025-03-17 11:16:06,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842841514] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:16:06,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:16:06,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 11:16:06,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802231450] [2025-03-17 11:16:06,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:16:06,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 11:16:06,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:16:06,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 11:16:06,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-03-17 11:16:06,330 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 113 [2025-03-17 11:16:06,331 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,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:16:06,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 113 [2025-03-17 11:16:06,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:16:09,001 INFO L124 PetriNetUnfolderBase]: 6602/27953 cut-off events. [2025-03-17 11:16:09,001 INFO L125 PetriNetUnfolderBase]: For 19098/19820 co-relation queries the response was YES. [2025-03-17 11:16:09,072 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,129 INFO L140 encePairwiseOnDemand]: 108/113 looper letters, 81 selfloop transitions, 17 changer transitions 0/169 dead transitions. [2025-03-17 11:16:09,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 169 transitions, 886 flow [2025-03-17 11:16:09,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 11:16:09,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-17 11:16:09,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1461 transitions. [2025-03-17 11:16:09,130 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7182890855457227 [2025-03-17 11:16:09,130 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,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 169 transitions, 886 flow [2025-03-17 11:16:09,134 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,135 INFO L231 Difference]: Finished difference. Result has 152 places, 118 transitions, 490 flow [2025-03-17 11:16:09,135 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,136 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 34 predicate places. [2025-03-17 11:16:09,136 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 118 transitions, 490 flow [2025-03-17 11:16:09,136 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,136 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:16:09,136 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,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-03-17 11:16:09,136 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,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:16:09,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1396946481, now seen corresponding path program 1 times [2025-03-17 11:16:09,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:16:09,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38001881] [2025-03-17 11:16:09,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:16:09,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:16:09,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-17 11:16:09,152 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,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:16:09,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:16:09,274 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,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:16:09,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38001881] [2025-03-17 11:16:09,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38001881] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:16:09,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:16:09,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-17 11:16:09,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918097268] [2025-03-17 11:16:09,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:16:09,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 11:16:09,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:16:09,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 11:16:09,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-17 11:16:09,353 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 113 [2025-03-17 11:16:09,354 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,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:16:09,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 113 [2025-03-17 11:16:09,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:16:09,751 INFO L124 PetriNetUnfolderBase]: 1221/3418 cut-off events. [2025-03-17 11:16:09,752 INFO L125 PetriNetUnfolderBase]: For 7522/7522 co-relation queries the response was YES. [2025-03-17 11:16:09,763 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:09,772 INFO L140 encePairwiseOnDemand]: 108/113 looper letters, 77 selfloop transitions, 19 changer transitions 0/143 dead transitions. [2025-03-17 11:16:09,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 143 transitions, 808 flow [2025-03-17 11:16:09,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-17 11:16:09,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-17 11:16:09,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1693 transitions. [2025-03-17 11:16:09,774 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7134428992836073 [2025-03-17 11:16:09,774 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:09,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 143 transitions, 808 flow [2025-03-17 11:16:09,779 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:09,780 INFO L231 Difference]: Finished difference. Result has 126 places, 80 transitions, 316 flow [2025-03-17 11:16:09,780 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:09,781 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 8 predicate places. [2025-03-17 11:16:09,781 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 80 transitions, 316 flow [2025-03-17 11:16:09,781 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:09,781 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:16:09,781 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:09,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-03-17 11:16:09,781 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:09,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:16:09,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1368644618, now seen corresponding path program 1 times [2025-03-17 11:16:09,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:16:09,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144903678] [2025-03-17 11:16:09,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:16:09,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:16:09,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-17 11:16:09,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-17 11:16:09,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:16:09,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:16:09,804 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 11:16:09,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-17 11:16:09,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-17 11:16:09,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:16:09,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:16:09,822 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 11:16:09,823 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 11:16:09,823 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 12 remaining) [2025-03-17 11:16:09,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining) [2025-03-17 11:16:09,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining) [2025-03-17 11:16:09,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining) [2025-03-17 11:16:09,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 12 remaining) [2025-03-17 11:16:09,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (6 of 12 remaining) [2025-03-17 11:16:09,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 12 remaining) [2025-03-17 11:16:09,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining) [2025-03-17 11:16:09,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining) [2025-03-17 11:16:09,824 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining) [2025-03-17 11:16:09,824 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining) [2025-03-17 11:16:09,824 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining) [2025-03-17 11:16:09,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-03-17 11:16:09,824 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:16:09,824 WARN L246 ceAbstractionStarter]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 11:16:09,824 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 7 thread instances. [2025-03-17 11:16:09,844 INFO L143 ThreadInstanceAdder]: Constructed 7 joinOtherThreadTransitions. [2025-03-17 11:16:09,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 121 transitions, 333 flow [2025-03-17 11:16:10,030 INFO L124 PetriNetUnfolderBase]: 344/3292 cut-off events. [2025-03-17 11:16:10,030 INFO L125 PetriNetUnfolderBase]: For 525/525 co-relation queries the response was YES. [2025-03-17 11:16:10,038 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,038 INFO L82 GeneralOperation]: Start removeDead. Operand has 127 places, 121 transitions, 333 flow [2025-03-17 11:16:10,044 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 127 places, 121 transitions, 333 flow [2025-03-17 11:16:10,044 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:16:10,045 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;@2d089349, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:16:10,045 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-03-17 11:16:10,045 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:16:10,045 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-03-17 11:16:10,045 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:16:10,045 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:16:10,045 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,045 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,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:16:10,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1922090804, now seen corresponding path program 1 times [2025-03-17 11:16:10,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:16:10,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708031574] [2025-03-17 11:16:10,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:16:10,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:16:10,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 11:16:10,049 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,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:16:10,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:16:10,051 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,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:16:10,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708031574] [2025-03-17 11:16:10,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708031574] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:16:10,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:16:10,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 11:16:10,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116724167] [2025-03-17 11:16:10,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:16:10,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 11:16:10,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:16:10,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 11:16:10,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 11:16:10,052 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 121 [2025-03-17 11:16:10,052 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,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:16:10,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 121 [2025-03-17 11:16:10,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:16:12,558 INFO L124 PetriNetUnfolderBase]: 8348/35176 cut-off events. [2025-03-17 11:16:12,558 INFO L125 PetriNetUnfolderBase]: For 19197/38611 co-relation queries the response was YES. [2025-03-17 11:16:12,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51839 conditions, 35176 events. 8348/35176 cut-off events. For 19197/38611 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:12,844 INFO L140 encePairwiseOnDemand]: 111/121 looper letters, 22 selfloop transitions, 0 changer transitions 0/109 dead transitions. [2025-03-17 11:16:12,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 109 transitions, 353 flow [2025-03-17 11:16:12,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 11:16:12,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-17 11:16:12,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 208 transitions. [2025-03-17 11:16:12,844 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.859504132231405 [2025-03-17 11:16:12,844 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:12,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 109 transitions, 353 flow [2025-03-17 11:16:12,853 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:12,854 INFO L231 Difference]: Finished difference. Result has 118 places, 109 transitions, 309 flow [2025-03-17 11:16:12,854 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:12,854 INFO L279 CegarLoopForPetriNet]: 127 programPoint places, -9 predicate places. [2025-03-17 11:16:12,854 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 109 transitions, 309 flow [2025-03-17 11:16:12,854 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:12,854 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:16:12,854 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:12,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-03-17 11:16:12,855 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:12,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:16:12,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1769664465, now seen corresponding path program 1 times [2025-03-17 11:16:12,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:16:12,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974032068] [2025-03-17 11:16:12,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:16:12,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:16:12,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 11:16:12,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 11:16:12,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:16:12,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:16:12,865 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:12,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:16:12,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974032068] [2025-03-17 11:16:12,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974032068] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:16:12,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:16:12,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:16:12,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489914] [2025-03-17 11:16:12,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:16:12,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:16:12,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:16:12,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:16:12,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:16:12,878 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 121 [2025-03-17 11:16:12,878 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:12,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:16:12,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 121 [2025-03-17 11:16:12,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:16:18,976 INFO L124 PetriNetUnfolderBase]: 15877/67988 cut-off events. [2025-03-17 11:16:18,976 INFO L125 PetriNetUnfolderBase]: For 20791/20791 co-relation queries the response was YES. [2025-03-17 11:16:19,157 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:19,274 INFO L140 encePairwiseOnDemand]: 118/121 looper letters, 27 selfloop transitions, 2 changer transitions 3/111 dead transitions. [2025-03-17 11:16:19,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 111 transitions, 373 flow [2025-03-17 11:16:19,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:16:19,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:16:19,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 277 transitions. [2025-03-17 11:16:19,275 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7630853994490359 [2025-03-17 11:16:19,275 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:19,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 111 transitions, 373 flow [2025-03-17 11:16:19,277 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:19,278 INFO L231 Difference]: Finished difference. Result has 121 places, 107 transitions, 315 flow [2025-03-17 11:16:19,278 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:19,278 INFO L279 CegarLoopForPetriNet]: 127 programPoint places, -6 predicate places. [2025-03-17 11:16:19,278 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 107 transitions, 315 flow [2025-03-17 11:16:19,278 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:19,278 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:16:19,278 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:19,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-03-17 11:16:19,278 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:19,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:16:19,279 INFO L85 PathProgramCache]: Analyzing trace with hash 16076137, now seen corresponding path program 1 times [2025-03-17 11:16:19,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:16:19,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233383407] [2025-03-17 11:16:19,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:16:19,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:16:19,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 11:16:19,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 11:16:19,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:16:19,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:16:19,357 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:19,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:16:19,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233383407] [2025-03-17 11:16:19,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233383407] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:16:19,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:16:19,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:16:19,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773717899] [2025-03-17 11:16:19,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:16:19,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:16:19,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:16:19,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:16:19,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:16:19,429 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 121 [2025-03-17 11:16:19,430 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:19,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:16:19,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 121 [2025-03-17 11:16:19,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:16:26,827 INFO L124 PetriNetUnfolderBase]: 40254/84695 cut-off events. [2025-03-17 11:16:26,828 INFO L125 PetriNetUnfolderBase]: For 20298/20298 co-relation queries the response was YES. [2025-03-17 11:16:27,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146508 conditions, 84695 events. 40254/84695 cut-off events. For 20298/20298 co-relation queries the response was YES. Maximal size of possible extension queue 1786. Compared 881170 event pairs, 34428 based on Foata normal form. 0/81309 useless extension candidates. Maximal degree in co-relation 146496. Up to 49523 conditions per place. [2025-03-17 11:16:27,433 INFO L140 encePairwiseOnDemand]: 115/121 looper letters, 60 selfloop transitions, 6 changer transitions 2/134 dead transitions. [2025-03-17 11:16:27,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 134 transitions, 503 flow [2025-03-17 11:16:27,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:16:27,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:16:27,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 487 transitions. [2025-03-17 11:16:27,434 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6707988980716253 [2025-03-17 11:16:27,434 INFO L175 Difference]: Start difference. First operand has 121 places, 107 transitions, 315 flow. Second operand 6 states and 487 transitions. [2025-03-17 11:16:27,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 134 transitions, 503 flow [2025-03-17 11:16:27,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 134 transitions, 501 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:16:27,481 INFO L231 Difference]: Finished difference. Result has 121 places, 104 transitions, 319 flow [2025-03-17 11:16:27,481 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=311, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=319, PETRI_PLACES=121, PETRI_TRANSITIONS=104} [2025-03-17 11:16:27,481 INFO L279 CegarLoopForPetriNet]: 127 programPoint places, -6 predicate places. [2025-03-17 11:16:27,481 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 104 transitions, 319 flow [2025-03-17 11:16:27,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 71.66666666666667) internal successors, (430), 6 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:16:27,482 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:16:27,482 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:16:27,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-03-17 11:16:27,482 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-17 11:16:27,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:16:27,482 INFO L85 PathProgramCache]: Analyzing trace with hash 2115739699, now seen corresponding path program 1 times [2025-03-17 11:16:27,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:16:27,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117634663] [2025-03-17 11:16:27,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:16:27,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:16:27,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 11:16:27,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 11:16:27,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:16:27,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:16:27,507 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:27,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:16:27,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117634663] [2025-03-17 11:16:27,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117634663] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:16:27,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:16:27,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:16:27,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905875036] [2025-03-17 11:16:27,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:16:27,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:16:27,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:16:27,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:16:27,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:16:27,674 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 121 [2025-03-17 11:16:27,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 104 transitions, 319 flow. Second operand has 5 states, 5 states have (on average 81.8) internal successors, (409), 5 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:16:27,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:16:27,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 121 [2025-03-17 11:16:27,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand