./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-nondet/nondet-array-2.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-nondet/nondet-array-2.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 2796c466e7d8363340777400f1e90c0fc7eb53096f49ded0fb8aa6814bf1ef21 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 11:03:17,045 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:03:17,097 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-17 11:03:17,105 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:03:17,105 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:03:17,124 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:03:17,125 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:03:17,125 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:03:17,125 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:03:17,125 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:03:17,126 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:03:17,126 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:03:17,126 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:03:17,126 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:03:17,126 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 11:03:17,126 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 11:03:17,126 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:03:17,126 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 11:03:17,126 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:03:17,127 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 11:03:17,127 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:03:17,127 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 11:03:17,127 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-17 11:03:17,127 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:03:17,127 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 11:03:17,127 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 11:03:17,127 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:03:17,127 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:03:17,127 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:03:17,128 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:03:17,128 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:03:17,128 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:03:17,128 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:03:17,128 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:03:17,128 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 11:03:17,128 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 11:03:17,128 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:03:17,128 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:03:17,129 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:03:17,129 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:03:17,129 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:03:17,129 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:03:17,129 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 -> 2796c466e7d8363340777400f1e90c0fc7eb53096f49ded0fb8aa6814bf1ef21 [2025-03-17 11:03:17,368 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:03:17,377 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:03:17,380 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:03:17,381 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:03:17,382 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:03:17,384 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-nondet/nondet-array-2.i [2025-03-17 11:03:18,544 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78509e863/1a7d1d0db3974dbc88201bbcf4c6c1c5/FLAGe7ba484fc [2025-03-17 11:03:18,841 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:03:18,842 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-nondet/nondet-array-2.i [2025-03-17 11:03:18,850 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78509e863/1a7d1d0db3974dbc88201bbcf4c6c1c5/FLAGe7ba484fc [2025-03-17 11:03:19,132 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78509e863/1a7d1d0db3974dbc88201bbcf4c6c1c5 [2025-03-17 11:03:19,134 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:03:19,135 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:03:19,136 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:03:19,136 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:03:19,139 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:03:19,140 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:03:19" (1/1) ... [2025-03-17 11:03:19,140 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b94c4c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:03:19, skipping insertion in model container [2025-03-17 11:03:19,140 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:03:19" (1/1) ... [2025-03-17 11:03:19,158 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:03:19,346 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:03:19,355 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:03:19,396 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:03:19,422 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:03:19,422 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:03:19 WrapperNode [2025-03-17 11:03:19,422 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:03:19,423 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:03:19,423 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:03:19,423 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:03:19,428 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:03:19" (1/1) ... [2025-03-17 11:03:19,436 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:03:19" (1/1) ... [2025-03-17 11:03:19,461 INFO L138 Inliner]: procedures = 169, calls = 28, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 90 [2025-03-17 11:03:19,462 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:03:19,462 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:03:19,462 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:03:19,462 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:03:19,467 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:03:19" (1/1) ... [2025-03-17 11:03:19,467 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:03:19" (1/1) ... [2025-03-17 11:03:19,474 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:03:19" (1/1) ... [2025-03-17 11:03:19,474 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:03:19" (1/1) ... [2025-03-17 11:03:19,479 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:03:19" (1/1) ... [2025-03-17 11:03:19,480 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:03:19" (1/1) ... [2025-03-17 11:03:19,482 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:03:19" (1/1) ... [2025-03-17 11:03:19,482 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:03:19" (1/1) ... [2025-03-17 11:03:19,484 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:03:19,485 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:03:19,485 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:03:19,485 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:03:19,485 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:03:19" (1/1) ... [2025-03-17 11:03:19,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:03:19,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:03:19,508 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:03:19,510 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:03:19,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 11:03:19,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 11:03:19,526 INFO L130 BoogieDeclarations]: Found specification of procedure thr [2025-03-17 11:03:19,526 INFO L138 BoogieDeclarations]: Found implementation of procedure thr [2025-03-17 11:03:19,527 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 11:03:19,527 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 11:03:19,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 11:03:19,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 11:03:19,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:03:19,527 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:03:19,528 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:03:19,611 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:03:19,613 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:03:19,842 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L698: havoc main_~#t~1#1.base, main_~#t~1#1.offset; [2025-03-17 11:03:19,844 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L698-1: SUMMARY for call ULTIMATE.dealloc(main_~#t~1#1.base, main_~#t~1#1.offset); srcloc: null [2025-03-17 11:03:19,877 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 11:03:19,877 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:03:19,886 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:03:19,886 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 11:03:19,886 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:03:19 BoogieIcfgContainer [2025-03-17 11:03:19,886 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:03:19,888 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:03:19,888 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:03:19,891 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:03:19,892 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:03:19" (1/3) ... [2025-03-17 11:03:19,892 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bf20ac5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:03:19, skipping insertion in model container [2025-03-17 11:03:19,892 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:03:19" (2/3) ... [2025-03-17 11:03:19,892 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bf20ac5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:03:19, skipping insertion in model container [2025-03-17 11:03:19,892 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:03:19" (3/3) ... [2025-03-17 11:03:19,893 INFO L128 eAbstractionObserver]: Analyzing ICFG nondet-array-2.i [2025-03-17 11:03:19,903 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:03:19,904 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG nondet-array-2.i that has 2 procedures, 124 locations, 1 initial locations, 3 loop locations, and 6 error locations. [2025-03-17 11:03:19,904 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 11:03:19,964 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-17 11:03:19,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 129 transitions, 265 flow [2025-03-17 11:03:20,070 INFO L124 PetriNetUnfolderBase]: 8/187 cut-off events. [2025-03-17 11:03:20,073 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 11:03:20,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192 conditions, 187 events. 8/187 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 457 event pairs, 0 based on Foata normal form. 0/167 useless extension candidates. Maximal degree in co-relation 95. Up to 4 conditions per place. [2025-03-17 11:03:20,078 INFO L82 GeneralOperation]: Start removeDead. Operand has 127 places, 129 transitions, 265 flow [2025-03-17 11:03:20,081 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 127 places, 129 transitions, 265 flow [2025-03-17 11:03:20,086 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:03:20,098 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;@1ce4f80f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:03:20,098 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-17 11:03:20,114 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:03:20,114 INFO L124 PetriNetUnfolderBase]: 1/64 cut-off events. [2025-03-17 11:03:20,114 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:03:20,114 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:03:20,120 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:03:20,120 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-03-17 11:03:20,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:03:20,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1993874590, now seen corresponding path program 1 times [2025-03-17 11:03:20,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:03:20,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326062394] [2025-03-17 11:03:20,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:03:20,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:03:20,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-17 11:03:20,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 11:03:20,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:03:20,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:03:20,454 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:03:20,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:03:20,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326062394] [2025-03-17 11:03:20,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326062394] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:03:20,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:03:20,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:03:20,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681366749] [2025-03-17 11:03:20,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:03:20,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:03:20,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:03:20,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:03:20,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:03:20,644 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 129 [2025-03-17 11:03:20,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 129 transitions, 265 flow. Second operand has 5 states, 5 states have (on average 108.4) internal successors, (542), 5 states have internal predecessors, (542), 0 states have call successors, (0), 0 states 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:03:20,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:03:20,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 129 [2025-03-17 11:03:20,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:03:20,718 INFO L124 PetriNetUnfolderBase]: 3/196 cut-off events. [2025-03-17 11:03:20,718 INFO L125 PetriNetUnfolderBase]: For 4/12 co-relation queries the response was YES. [2025-03-17 11:03:20,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 235 conditions, 196 events. 3/196 cut-off events. For 4/12 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 312 event pairs, 0 based on Foata normal form. 9/186 useless extension candidates. Maximal degree in co-relation 67. Up to 17 conditions per place. [2025-03-17 11:03:20,721 INFO L140 encePairwiseOnDemand]: 114/129 looper letters, 16 selfloop transitions, 8 changer transitions 7/136 dead transitions. [2025-03-17 11:03:20,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 136 transitions, 339 flow [2025-03-17 11:03:20,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:03:20,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 11:03:20,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 465 transitions. [2025-03-17 11:03:20,737 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9011627906976745 [2025-03-17 11:03:20,739 INFO L175 Difference]: Start difference. First operand has 127 places, 129 transitions, 265 flow. Second operand 4 states and 465 transitions. [2025-03-17 11:03:20,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 136 transitions, 339 flow [2025-03-17 11:03:20,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 136 transitions, 339 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:03:20,749 INFO L231 Difference]: Finished difference. Result has 131 places, 126 transitions, 305 flow [2025-03-17 11:03:20,751 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=305, PETRI_PLACES=131, PETRI_TRANSITIONS=126} [2025-03-17 11:03:20,754 INFO L279 CegarLoopForPetriNet]: 127 programPoint places, 4 predicate places. [2025-03-17 11:03:20,754 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 126 transitions, 305 flow [2025-03-17 11:03:20,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.4) internal successors, (542), 5 states have internal predecessors, (542), 0 states have call successors, (0), 0 states 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:03:20,754 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:03:20,755 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:03:20,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 11:03:20,755 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-03-17 11:03:20,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:03:20,755 INFO L85 PathProgramCache]: Analyzing trace with hash 978748974, now seen corresponding path program 1 times [2025-03-17 11:03:20,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:03:20,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177706414] [2025-03-17 11:03:20,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:03:20,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:03:20,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-17 11:03:20,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-17 11:03:20,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:03:20,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:03:21,173 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:03:21,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:03:21,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177706414] [2025-03-17 11:03:21,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177706414] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:03:21,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:03:21,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:03:21,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243896771] [2025-03-17 11:03:21,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:03:21,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:03:21,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:03:21,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:03:21,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:03:21,350 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 129 [2025-03-17 11:03:21,351 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 126 transitions, 305 flow. Second operand has 6 states, 6 states have (on average 92.66666666666667) internal successors, (556), 6 states have internal predecessors, (556), 0 states have call successors, (0), 0 states 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:03:21,351 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:03:21,351 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 129 [2025-03-17 11:03:21,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:03:21,470 INFO L124 PetriNetUnfolderBase]: 83/506 cut-off events. [2025-03-17 11:03:21,470 INFO L125 PetriNetUnfolderBase]: For 64/70 co-relation queries the response was YES. [2025-03-17 11:03:21,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 799 conditions, 506 events. 83/506 cut-off events. For 64/70 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2508 event pairs, 47 based on Foata normal form. 0/455 useless extension candidates. Maximal degree in co-relation 640. Up to 191 conditions per place. [2025-03-17 11:03:21,474 INFO L140 encePairwiseOnDemand]: 118/129 looper letters, 35 selfloop transitions, 22 changer transitions 0/147 dead transitions. [2025-03-17 11:03:21,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 147 transitions, 461 flow [2025-03-17 11:03:21,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:03:21,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:03:21,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 602 transitions. [2025-03-17 11:03:21,477 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7777777777777778 [2025-03-17 11:03:21,477 INFO L175 Difference]: Start difference. First operand has 131 places, 126 transitions, 305 flow. Second operand 6 states and 602 transitions. [2025-03-17 11:03:21,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 147 transitions, 461 flow [2025-03-17 11:03:21,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 147 transitions, 459 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-03-17 11:03:21,482 INFO L231 Difference]: Finished difference. Result has 140 places, 147 transitions, 453 flow [2025-03-17 11:03:21,483 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=303, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=453, PETRI_PLACES=140, PETRI_TRANSITIONS=147} [2025-03-17 11:03:21,483 INFO L279 CegarLoopForPetriNet]: 127 programPoint places, 13 predicate places. [2025-03-17 11:03:21,483 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 147 transitions, 453 flow [2025-03-17 11:03:21,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.66666666666667) internal successors, (556), 6 states have internal predecessors, (556), 0 states have call successors, (0), 0 states 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:03:21,484 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:03:21,484 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:03:21,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 11:03:21,484 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thrErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-03-17 11:03:21,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:03:21,486 INFO L85 PathProgramCache]: Analyzing trace with hash -2103357255, now seen corresponding path program 1 times [2025-03-17 11:03:21,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:03:21,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887842193] [2025-03-17 11:03:21,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:03:21,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:03:21,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-17 11:03:21,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 11:03:21,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:03:21,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:03:21,526 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:03:21,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:03:21,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887842193] [2025-03-17 11:03:21,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887842193] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:03:21,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:03:21,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:03:21,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758811222] [2025-03-17 11:03:21,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:03:21,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:03:21,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:03:21,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:03:21,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:03:21,534 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 129 [2025-03-17 11:03:21,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 147 transitions, 453 flow. Second operand has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states 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:03:21,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:03:21,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 129 [2025-03-17 11:03:21,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:03:21,590 INFO L124 PetriNetUnfolderBase]: 33/309 cut-off events. [2025-03-17 11:03:21,591 INFO L125 PetriNetUnfolderBase]: For 37/39 co-relation queries the response was YES. [2025-03-17 11:03:21,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 500 conditions, 309 events. 33/309 cut-off events. For 37/39 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1005 event pairs, 0 based on Foata normal form. 0/287 useless extension candidates. Maximal degree in co-relation 418. Up to 45 conditions per place. [2025-03-17 11:03:21,593 INFO L140 encePairwiseOnDemand]: 126/129 looper letters, 3 selfloop transitions, 2 changer transitions 0/146 dead transitions. [2025-03-17 11:03:21,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 146 transitions, 461 flow [2025-03-17 11:03:21,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:03:21,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:03:21,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 363 transitions. [2025-03-17 11:03:21,595 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.937984496124031 [2025-03-17 11:03:21,595 INFO L175 Difference]: Start difference. First operand has 140 places, 147 transitions, 453 flow. Second operand 3 states and 363 transitions. [2025-03-17 11:03:21,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 146 transitions, 461 flow [2025-03-17 11:03:21,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 146 transitions, 461 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:03:21,601 INFO L231 Difference]: Finished difference. Result has 141 places, 146 transitions, 455 flow [2025-03-17 11:03:21,601 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=451, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=455, PETRI_PLACES=141, PETRI_TRANSITIONS=146} [2025-03-17 11:03:21,602 INFO L279 CegarLoopForPetriNet]: 127 programPoint places, 14 predicate places. [2025-03-17 11:03:21,602 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 146 transitions, 455 flow [2025-03-17 11:03:21,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states 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:03:21,602 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:03:21,602 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:03:21,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 11:03:21,603 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thrErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-03-17 11:03:21,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:03:21,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1587110973, now seen corresponding path program 1 times [2025-03-17 11:03:21,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:03:21,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544279543] [2025-03-17 11:03:21,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:03:21,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:03:21,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-17 11:03:21,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 11:03:21,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:03:21,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:03:21,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:03:21,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:03:21,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544279543] [2025-03-17 11:03:21,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544279543] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:03:21,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:03:21,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:03:21,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949222295] [2025-03-17 11:03:21,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:03:21,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:03:21,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:03:21,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:03:21,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:03:22,002 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 129 [2025-03-17 11:03:22,003 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 146 transitions, 455 flow. Second operand has 6 states, 6 states have (on average 103.16666666666667) internal successors, (619), 6 states have internal predecessors, (619), 0 states have call successors, (0), 0 states 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:03:22,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:03:22,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 129 [2025-03-17 11:03:22,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:03:22,121 INFO L124 PetriNetUnfolderBase]: 131/551 cut-off events. [2025-03-17 11:03:22,121 INFO L125 PetriNetUnfolderBase]: For 147/162 co-relation queries the response was YES. [2025-03-17 11:03:22,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1188 conditions, 551 events. 131/551 cut-off events. For 147/162 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2617 event pairs, 23 based on Foata normal form. 0/511 useless extension candidates. Maximal degree in co-relation 1097. Up to 247 conditions per place. [2025-03-17 11:03:22,125 INFO L140 encePairwiseOnDemand]: 114/129 looper letters, 38 selfloop transitions, 48 changer transitions 0/189 dead transitions. [2025-03-17 11:03:22,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 189 transitions, 783 flow [2025-03-17 11:03:22,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:03:22,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:03:22,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 668 transitions. [2025-03-17 11:03:22,127 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8630490956072352 [2025-03-17 11:03:22,127 INFO L175 Difference]: Start difference. First operand has 141 places, 146 transitions, 455 flow. Second operand 6 states and 668 transitions. [2025-03-17 11:03:22,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 189 transitions, 783 flow [2025-03-17 11:03:22,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 189 transitions, 779 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:03:22,132 INFO L231 Difference]: Finished difference. Result has 149 places, 189 transitions, 839 flow [2025-03-17 11:03:22,132 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=451, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=839, PETRI_PLACES=149, PETRI_TRANSITIONS=189} [2025-03-17 11:03:22,133 INFO L279 CegarLoopForPetriNet]: 127 programPoint places, 22 predicate places. [2025-03-17 11:03:22,133 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 189 transitions, 839 flow [2025-03-17 11:03:22,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 103.16666666666667) internal successors, (619), 6 states have internal predecessors, (619), 0 states have call successors, (0), 0 states 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:03:22,134 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:03:22,134 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:03:22,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 11:03:22,134 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-03-17 11:03:22,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:03:22,135 INFO L85 PathProgramCache]: Analyzing trace with hash -387382517, now seen corresponding path program 1 times [2025-03-17 11:03:22,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:03:22,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602281774] [2025-03-17 11:03:22,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:03:22,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:03:22,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-17 11:03:22,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-17 11:03:22,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:03:22,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:03:22,476 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:03:22,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:03:22,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602281774] [2025-03-17 11:03:22,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602281774] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:03:22,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:03:22,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:03:22,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788043441] [2025-03-17 11:03:22,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:03:22,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:03:22,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:03:22,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:03:22,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:03:22,729 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 129 [2025-03-17 11:03:22,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 189 transitions, 839 flow. Second operand has 6 states, 6 states have (on average 99.83333333333333) internal successors, (599), 6 states have internal predecessors, (599), 0 states have call successors, (0), 0 states 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:03:22,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:03:22,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 129 [2025-03-17 11:03:22,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:03:22,869 INFO L124 PetriNetUnfolderBase]: 159/718 cut-off events. [2025-03-17 11:03:22,870 INFO L125 PetriNetUnfolderBase]: For 551/624 co-relation queries the response was YES. [2025-03-17 11:03:22,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1964 conditions, 718 events. 159/718 cut-off events. For 551/624 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4098 event pairs, 26 based on Foata normal form. 0/678 useless extension candidates. Maximal degree in co-relation 1774. Up to 300 conditions per place. [2025-03-17 11:03:22,874 INFO L140 encePairwiseOnDemand]: 118/129 looper letters, 87 selfloop transitions, 32 changer transitions 0/217 dead transitions. [2025-03-17 11:03:22,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 217 transitions, 1248 flow [2025-03-17 11:03:22,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:03:22,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:03:22,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 633 transitions. [2025-03-17 11:03:22,878 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8178294573643411 [2025-03-17 11:03:22,878 INFO L175 Difference]: Start difference. First operand has 149 places, 189 transitions, 839 flow. Second operand 6 states and 633 transitions. [2025-03-17 11:03:22,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 217 transitions, 1248 flow [2025-03-17 11:03:22,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 217 transitions, 1230 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-03-17 11:03:22,890 INFO L231 Difference]: Finished difference. Result has 159 places, 216 transitions, 1147 flow [2025-03-17 11:03:22,891 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=821, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1147, PETRI_PLACES=159, PETRI_TRANSITIONS=216} [2025-03-17 11:03:22,891 INFO L279 CegarLoopForPetriNet]: 127 programPoint places, 32 predicate places. [2025-03-17 11:03:22,891 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 216 transitions, 1147 flow [2025-03-17 11:03:22,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 99.83333333333333) internal successors, (599), 6 states have internal predecessors, (599), 0 states have call successors, (0), 0 states 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:03:22,892 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:03:22,892 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:03:22,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 11:03:22,892 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thrErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-03-17 11:03:22,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:03:22,893 INFO L85 PathProgramCache]: Analyzing trace with hash -209642857, now seen corresponding path program 1 times [2025-03-17 11:03:22,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:03:22,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500600512] [2025-03-17 11:03:22,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:03:22,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:03:22,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-17 11:03:22,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-17 11:03:22,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:03:22,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:03:22,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:03:22,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:03:22,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500600512] [2025-03-17 11:03:22,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500600512] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:03:22,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:03:22,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:03:22,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217828199] [2025-03-17 11:03:22,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:03:22,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:03:22,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:03:22,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:03:22,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:03:22,941 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 129 [2025-03-17 11:03:22,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 216 transitions, 1147 flow. Second operand has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states 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:03:22,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:03:22,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 129 [2025-03-17 11:03:22,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:03:23,024 INFO L124 PetriNetUnfolderBase]: 134/590 cut-off events. [2025-03-17 11:03:23,024 INFO L125 PetriNetUnfolderBase]: For 468/485 co-relation queries the response was YES. [2025-03-17 11:03:23,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1655 conditions, 590 events. 134/590 cut-off events. For 468/485 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3030 event pairs, 6 based on Foata normal form. 1/587 useless extension candidates. Maximal degree in co-relation 1563. Up to 129 conditions per place. [2025-03-17 11:03:23,030 INFO L140 encePairwiseOnDemand]: 126/129 looper letters, 5 selfloop transitions, 2 changer transitions 19/215 dead transitions. [2025-03-17 11:03:23,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 215 transitions, 1159 flow [2025-03-17 11:03:23,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:03:23,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:03:23,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 359 transitions. [2025-03-17 11:03:23,031 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9276485788113695 [2025-03-17 11:03:23,031 INFO L175 Difference]: Start difference. First operand has 159 places, 216 transitions, 1147 flow. Second operand 3 states and 359 transitions. [2025-03-17 11:03:23,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 215 transitions, 1159 flow [2025-03-17 11:03:23,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 215 transitions, 1103 flow, removed 28 selfloop flow, removed 0 redundant places. [2025-03-17 11:03:23,043 INFO L231 Difference]: Finished difference. Result has 160 places, 196 transitions, 1043 flow [2025-03-17 11:03:23,043 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=1089, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1043, PETRI_PLACES=160, PETRI_TRANSITIONS=196} [2025-03-17 11:03:23,044 INFO L279 CegarLoopForPetriNet]: 127 programPoint places, 33 predicate places. [2025-03-17 11:03:23,044 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 196 transitions, 1043 flow [2025-03-17 11:03:23,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states 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:03:23,045 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:03:23,045 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:03:23,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 11:03:23,045 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-03-17 11:03:23,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:03:23,047 INFO L85 PathProgramCache]: Analyzing trace with hash -2072897036, now seen corresponding path program 1 times [2025-03-17 11:03:23,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:03:23,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795888461] [2025-03-17 11:03:23,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:03:23,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:03:23,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-17 11:03:23,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-17 11:03:23,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:03:23,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:03:23,078 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 11:03:23,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-17 11:03:23,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-17 11:03:23,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:03:23,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:03:23,119 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 11:03:23,119 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 11:03:23,120 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-03-17 11:03:23,122 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2025-03-17 11:03:23,123 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2025-03-17 11:03:23,123 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2025-03-17 11:03:23,123 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2025-03-17 11:03:23,123 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2025-03-17 11:03:23,123 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2025-03-17 11:03:23,123 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2025-03-17 11:03:23,123 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2025-03-17 11:03:23,123 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2025-03-17 11:03:23,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 11:03:23,124 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:03:23,126 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 11:03:23,126 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-17 11:03:23,149 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-17 11:03:23,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 152 transitions, 320 flow [2025-03-17 11:03:23,183 INFO L124 PetriNetUnfolderBase]: 16/329 cut-off events. [2025-03-17 11:03:23,184 INFO L125 PetriNetUnfolderBase]: For 6/7 co-relation queries the response was YES. [2025-03-17 11:03:23,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 341 conditions, 329 events. 16/329 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 944 event pairs, 0 based on Foata normal form. 0/292 useless extension candidates. Maximal degree in co-relation 189. Up to 8 conditions per place. [2025-03-17 11:03:23,185 INFO L82 GeneralOperation]: Start removeDead. Operand has 151 places, 152 transitions, 320 flow [2025-03-17 11:03:23,186 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 151 places, 152 transitions, 320 flow [2025-03-17 11:03:23,187 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:03:23,187 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;@1ce4f80f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:03:23,187 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-03-17 11:03:23,193 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:03:23,193 INFO L124 PetriNetUnfolderBase]: 1/64 cut-off events. [2025-03-17 11:03:23,193 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:03:23,193 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:03:23,193 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:03:23,194 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-17 11:03:23,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:03:23,194 INFO L85 PathProgramCache]: Analyzing trace with hash 842286434, now seen corresponding path program 1 times [2025-03-17 11:03:23,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:03:23,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000790480] [2025-03-17 11:03:23,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:03:23,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:03:23,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-17 11:03:23,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 11:03:23,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:03:23,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:03:23,285 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:03:23,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:03:23,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000790480] [2025-03-17 11:03:23,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000790480] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:03:23,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:03:23,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:03:23,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146229664] [2025-03-17 11:03:23,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:03:23,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:03:23,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:03:23,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:03:23,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:03:23,382 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 152 [2025-03-17 11:03:23,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 152 transitions, 320 flow. Second operand has 5 states, 5 states have (on average 129.4) internal successors, (647), 5 states have internal predecessors, (647), 0 states have call successors, (0), 0 states 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:03:23,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:03:23,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 152 [2025-03-17 11:03:23,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:03:23,433 INFO L124 PetriNetUnfolderBase]: 10/400 cut-off events. [2025-03-17 11:03:23,434 INFO L125 PetriNetUnfolderBase]: For 20/38 co-relation queries the response was YES. [2025-03-17 11:03:23,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 485 conditions, 400 events. 10/400 cut-off events. For 20/38 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1300 event pairs, 0 based on Foata normal form. 19/377 useless extension candidates. Maximal degree in co-relation 231. Up to 42 conditions per place. [2025-03-17 11:03:23,435 INFO L140 encePairwiseOnDemand]: 137/152 looper letters, 24 selfloop transitions, 9 changer transitions 4/163 dead transitions. [2025-03-17 11:03:23,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 163 transitions, 420 flow [2025-03-17 11:03:23,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:03:23,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 11:03:23,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 555 transitions. [2025-03-17 11:03:23,438 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.912828947368421 [2025-03-17 11:03:23,438 INFO L175 Difference]: Start difference. First operand has 151 places, 152 transitions, 320 flow. Second operand 4 states and 555 transitions. [2025-03-17 11:03:23,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 163 transitions, 420 flow [2025-03-17 11:03:23,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 163 transitions, 420 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:03:23,441 INFO L231 Difference]: Finished difference. Result has 155 places, 153 transitions, 378 flow [2025-03-17 11:03:23,441 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=378, PETRI_PLACES=155, PETRI_TRANSITIONS=153} [2025-03-17 11:03:23,442 INFO L279 CegarLoopForPetriNet]: 151 programPoint places, 4 predicate places. [2025-03-17 11:03:23,442 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 153 transitions, 378 flow [2025-03-17 11:03:23,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 129.4) internal successors, (647), 5 states have internal predecessors, (647), 0 states have call successors, (0), 0 states 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:03:23,442 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:03:23,442 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:03:23,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 11:03:23,443 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-17 11:03:23,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:03:23,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1294572346, now seen corresponding path program 1 times [2025-03-17 11:03:23,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:03:23,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128060916] [2025-03-17 11:03:23,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:03:23,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:03:23,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-17 11:03:23,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-17 11:03:23,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:03:23,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:03:23,636 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:03:23,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:03:23,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128060916] [2025-03-17 11:03:23,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128060916] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:03:23,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:03:23,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:03:23,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471912665] [2025-03-17 11:03:23,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:03:23,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:03:23,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:03:23,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:03:23,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:03:23,786 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 152 [2025-03-17 11:03:23,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 153 transitions, 378 flow. Second operand has 6 states, 6 states have (on average 109.66666666666667) internal successors, (658), 6 states have internal predecessors, (658), 0 states have call successors, (0), 0 states 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:03:23,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:03:23,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 152 [2025-03-17 11:03:23,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:03:24,186 INFO L124 PetriNetUnfolderBase]: 1178/4239 cut-off events. [2025-03-17 11:03:24,186 INFO L125 PetriNetUnfolderBase]: For 458/480 co-relation queries the response was YES. [2025-03-17 11:03:24,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6807 conditions, 4239 events. 1178/4239 cut-off events. For 458/480 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 36397 event pairs, 769 based on Foata normal form. 0/3826 useless extension candidates. Maximal degree in co-relation 4257. Up to 1921 conditions per place. [2025-03-17 11:03:24,206 INFO L140 encePairwiseOnDemand]: 137/152 looper letters, 45 selfloop transitions, 38 changer transitions 0/191 dead transitions. [2025-03-17 11:03:24,206 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 191 transitions, 625 flow [2025-03-17 11:03:24,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:03:24,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:03:24,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 727 transitions. [2025-03-17 11:03:24,208 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7971491228070176 [2025-03-17 11:03:24,208 INFO L175 Difference]: Start difference. First operand has 155 places, 153 transitions, 378 flow. Second operand 6 states and 727 transitions. [2025-03-17 11:03:24,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 191 transitions, 625 flow [2025-03-17 11:03:24,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 191 transitions, 623 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-03-17 11:03:24,212 INFO L231 Difference]: Finished difference. Result has 164 places, 190 transitions, 630 flow [2025-03-17 11:03:24,212 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=630, PETRI_PLACES=164, PETRI_TRANSITIONS=190} [2025-03-17 11:03:24,212 INFO L279 CegarLoopForPetriNet]: 151 programPoint places, 13 predicate places. [2025-03-17 11:03:24,213 INFO L471 AbstractCegarLoop]: Abstraction has has 164 places, 190 transitions, 630 flow [2025-03-17 11:03:24,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 109.66666666666667) internal successors, (658), 6 states have internal predecessors, (658), 0 states have call successors, (0), 0 states 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:03:24,213 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:03:24,213 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:03:24,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 11:03:24,213 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thrErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-17 11:03:24,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:03:24,214 INFO L85 PathProgramCache]: Analyzing trace with hash -458135919, now seen corresponding path program 1 times [2025-03-17 11:03:24,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:03:24,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472935905] [2025-03-17 11:03:24,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:03:24,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:03:24,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-17 11:03:24,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 11:03:24,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:03:24,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:03:24,239 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:03:24,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:03:24,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472935905] [2025-03-17 11:03:24,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472935905] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:03:24,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:03:24,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:03:24,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857304222] [2025-03-17 11:03:24,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:03:24,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:03:24,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:03:24,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:03:24,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:03:24,251 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 152 [2025-03-17 11:03:24,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 190 transitions, 630 flow. Second operand has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states 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:03:24,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:03:24,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 152 [2025-03-17 11:03:24,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:03:24,570 INFO L124 PetriNetUnfolderBase]: 670/3615 cut-off events. [2025-03-17 11:03:24,571 INFO L125 PetriNetUnfolderBase]: For 560/592 co-relation queries the response was YES. [2025-03-17 11:03:24,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5978 conditions, 3615 events. 670/3615 cut-off events. For 560/592 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 32236 event pairs, 124 based on Foata normal form. 0/3290 useless extension candidates. Maximal degree in co-relation 4954. Up to 762 conditions per place. [2025-03-17 11:03:24,589 INFO L140 encePairwiseOnDemand]: 144/152 looper letters, 15 selfloop transitions, 6 changer transitions 0/199 dead transitions. [2025-03-17 11:03:24,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 199 transitions, 701 flow [2025-03-17 11:03:24,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:03:24,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:03:24,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 431 transitions. [2025-03-17 11:03:24,590 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9451754385964912 [2025-03-17 11:03:24,590 INFO L175 Difference]: Start difference. First operand has 164 places, 190 transitions, 630 flow. Second operand 3 states and 431 transitions. [2025-03-17 11:03:24,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 199 transitions, 701 flow [2025-03-17 11:03:24,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 199 transitions, 701 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:03:24,597 INFO L231 Difference]: Finished difference. Result has 168 places, 196 transitions, 682 flow [2025-03-17 11:03:24,597 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=630, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=682, PETRI_PLACES=168, PETRI_TRANSITIONS=196} [2025-03-17 11:03:24,599 INFO L279 CegarLoopForPetriNet]: 151 programPoint places, 17 predicate places. [2025-03-17 11:03:24,599 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 196 transitions, 682 flow [2025-03-17 11:03:24,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states 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:03:24,599 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:03:24,599 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:03:24,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 11:03:24,599 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thrErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-17 11:03:24,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:03:24,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1957623659, now seen corresponding path program 1 times [2025-03-17 11:03:24,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:03:24,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720656488] [2025-03-17 11:03:24,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:03:24,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:03:24,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-17 11:03:24,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 11:03:24,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:03:24,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:03:24,826 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:03:24,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:03:24,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720656488] [2025-03-17 11:03:24,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720656488] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:03:24,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:03:24,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:03:24,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422375847] [2025-03-17 11:03:24,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:03:24,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:03:24,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:03:24,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:03:24,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:03:24,962 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 152 [2025-03-17 11:03:24,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 196 transitions, 682 flow. Second operand has 6 states, 6 states have (on average 120.16666666666667) internal successors, (721), 6 states have internal predecessors, (721), 0 states have call successors, (0), 0 states 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:03:24,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:03:24,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 152 [2025-03-17 11:03:24,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:03:26,230 INFO L124 PetriNetUnfolderBase]: 3407/12504 cut-off events. [2025-03-17 11:03:26,230 INFO L125 PetriNetUnfolderBase]: For 2995/3140 co-relation queries the response was YES. [2025-03-17 11:03:26,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24834 conditions, 12504 events. 3407/12504 cut-off events. For 2995/3140 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 131734 event pairs, 722 based on Foata normal form. 1/11316 useless extension candidates. Maximal degree in co-relation 21053. Up to 4281 conditions per place. [2025-03-17 11:03:26,318 INFO L140 encePairwiseOnDemand]: 129/152 looper letters, 95 selfloop transitions, 96 changer transitions 0/322 dead transitions. [2025-03-17 11:03:26,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 322 transitions, 1580 flow [2025-03-17 11:03:26,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:03:26,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:03:26,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 828 transitions. [2025-03-17 11:03:26,320 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9078947368421053 [2025-03-17 11:03:26,320 INFO L175 Difference]: Start difference. First operand has 168 places, 196 transitions, 682 flow. Second operand 6 states and 828 transitions. [2025-03-17 11:03:26,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 322 transitions, 1580 flow [2025-03-17 11:03:26,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 322 transitions, 1568 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:03:26,338 INFO L231 Difference]: Finished difference. Result has 175 places, 290 transitions, 1466 flow [2025-03-17 11:03:26,338 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=670, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1466, PETRI_PLACES=175, PETRI_TRANSITIONS=290} [2025-03-17 11:03:26,339 INFO L279 CegarLoopForPetriNet]: 151 programPoint places, 24 predicate places. [2025-03-17 11:03:26,339 INFO L471 AbstractCegarLoop]: Abstraction has has 175 places, 290 transitions, 1466 flow [2025-03-17 11:03:26,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 120.16666666666667) internal successors, (721), 6 states have internal predecessors, (721), 0 states have call successors, (0), 0 states 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:03:26,339 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:03:26,339 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:03:26,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 11:03:26,340 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-17 11:03:26,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:03:26,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1779137774, now seen corresponding path program 1 times [2025-03-17 11:03:26,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:03:26,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225670937] [2025-03-17 11:03:26,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:03:26,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:03:26,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-17 11:03:26,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-17 11:03:26,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:03:26,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:03:26,624 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:03:26,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:03:26,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225670937] [2025-03-17 11:03:26,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225670937] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:03:26,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:03:26,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:03:26,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290640071] [2025-03-17 11:03:26,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:03:26,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:03:26,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:03:26,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:03:26,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:03:26,801 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 152 [2025-03-17 11:03:26,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 290 transitions, 1466 flow. Second operand has 6 states, 6 states have (on average 116.83333333333333) internal successors, (701), 6 states have internal predecessors, (701), 0 states have call successors, (0), 0 states 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:03:26,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:03:26,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 152 [2025-03-17 11:03:26,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:03:28,404 INFO L124 PetriNetUnfolderBase]: 4645/17035 cut-off events. [2025-03-17 11:03:28,404 INFO L125 PetriNetUnfolderBase]: For 11889/12725 co-relation queries the response was YES. [2025-03-17 11:03:28,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42404 conditions, 17035 events. 4645/17035 cut-off events. For 11889/12725 co-relation queries the response was YES. Maximal size of possible extension queue 570. Compared 193978 event pairs, 1005 based on Foata normal form. 55/15438 useless extension candidates. Maximal degree in co-relation 35461. Up to 6495 conditions per place. [2025-03-17 11:03:28,549 INFO L140 encePairwiseOnDemand]: 137/152 looper letters, 147 selfloop transitions, 72 changer transitions 0/359 dead transitions. [2025-03-17 11:03:28,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 359 transitions, 2356 flow [2025-03-17 11:03:28,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:03:28,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:03:28,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 758 transitions. [2025-03-17 11:03:28,552 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.831140350877193 [2025-03-17 11:03:28,552 INFO L175 Difference]: Start difference. First operand has 175 places, 290 transitions, 1466 flow. Second operand 6 states and 758 transitions. [2025-03-17 11:03:28,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 359 transitions, 2356 flow [2025-03-17 11:03:28,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 359 transitions, 2338 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-03-17 11:03:28,621 INFO L231 Difference]: Finished difference. Result has 185 places, 357 transitions, 2242 flow [2025-03-17 11:03:28,621 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=1448, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2242, PETRI_PLACES=185, PETRI_TRANSITIONS=357} [2025-03-17 11:03:28,622 INFO L279 CegarLoopForPetriNet]: 151 programPoint places, 34 predicate places. [2025-03-17 11:03:28,622 INFO L471 AbstractCegarLoop]: Abstraction has has 185 places, 357 transitions, 2242 flow [2025-03-17 11:03:28,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.83333333333333) internal successors, (701), 6 states have internal predecessors, (701), 0 states have call successors, (0), 0 states 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:03:28,623 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:03:28,623 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:03:28,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 11:03:28,623 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thrErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-17 11:03:28,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:03:28,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1678667092, now seen corresponding path program 1 times [2025-03-17 11:03:28,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:03:28,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039023798] [2025-03-17 11:03:28,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:03:28,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:03:28,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-17 11:03:28,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-17 11:03:28,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:03:28,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:03:28,661 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:03:28,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:03:28,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039023798] [2025-03-17 11:03:28,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039023798] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:03:28,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:03:28,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:03:28,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000119838] [2025-03-17 11:03:28,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:03:28,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:03:28,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:03:28,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:03:28,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:03:28,674 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 152 [2025-03-17 11:03:28,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 357 transitions, 2242 flow. Second operand has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states 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:03:28,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:03:28,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 152 [2025-03-17 11:03:28,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:03:29,986 INFO L124 PetriNetUnfolderBase]: 3720/14670 cut-off events. [2025-03-17 11:03:29,986 INFO L125 PetriNetUnfolderBase]: For 11049/11504 co-relation queries the response was YES. [2025-03-17 11:03:30,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36181 conditions, 14670 events. 3720/14670 cut-off events. For 11049/11504 co-relation queries the response was YES. Maximal size of possible extension queue 545. Compared 166295 event pairs, 358 based on Foata normal form. 28/13567 useless extension candidates. Maximal degree in co-relation 31262. Up to 3155 conditions per place. [2025-03-17 11:03:30,091 INFO L140 encePairwiseOnDemand]: 146/152 looper letters, 16 selfloop transitions, 7 changer transitions 0/364 dead transitions. [2025-03-17 11:03:30,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 364 transitions, 2316 flow [2025-03-17 11:03:30,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:03:30,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:03:30,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 427 transitions. [2025-03-17 11:03:30,093 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9364035087719298 [2025-03-17 11:03:30,093 INFO L175 Difference]: Start difference. First operand has 185 places, 357 transitions, 2242 flow. Second operand 3 states and 427 transitions. [2025-03-17 11:03:30,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 364 transitions, 2316 flow [2025-03-17 11:03:30,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 364 transitions, 2176 flow, removed 70 selfloop flow, removed 0 redundant places. [2025-03-17 11:03:30,157 INFO L231 Difference]: Finished difference. Result has 189 places, 362 transitions, 2158 flow [2025-03-17 11:03:30,158 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=2102, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2158, PETRI_PLACES=189, PETRI_TRANSITIONS=362} [2025-03-17 11:03:30,159 INFO L279 CegarLoopForPetriNet]: 151 programPoint places, 38 predicate places. [2025-03-17 11:03:30,159 INFO L471 AbstractCegarLoop]: Abstraction has has 189 places, 362 transitions, 2158 flow [2025-03-17 11:03:30,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states 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:03:30,159 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:03:30,160 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:03:30,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 11:03:30,160 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thrErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-17 11:03:30,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:03:30,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1651562113, now seen corresponding path program 1 times [2025-03-17 11:03:30,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:03:30,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027370454] [2025-03-17 11:03:30,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:03:30,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:03:30,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-17 11:03:30,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-17 11:03:30,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:03:30,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:03:30,530 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:03:30,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:03:30,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027370454] [2025-03-17 11:03:30,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027370454] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:03:30,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:03:30,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 11:03:30,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858797571] [2025-03-17 11:03:30,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:03:30,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 11:03:30,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:03:30,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 11:03:30,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-17 11:03:30,924 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 152 [2025-03-17 11:03:30,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 362 transitions, 2158 flow. Second operand has 10 states, 10 states have (on average 113.7) internal successors, (1137), 10 states have internal predecessors, (1137), 0 states have call successors, (0), 0 states 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:03:30,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:03:30,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 152 [2025-03-17 11:03:30,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:03:33,744 INFO L124 PetriNetUnfolderBase]: 7011/22053 cut-off events. [2025-03-17 11:03:33,744 INFO L125 PetriNetUnfolderBase]: For 23505/24427 co-relation queries the response was YES. [2025-03-17 11:03:33,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66049 conditions, 22053 events. 7011/22053 cut-off events. For 23505/24427 co-relation queries the response was YES. Maximal size of possible extension queue 917. Compared 252278 event pairs, 930 based on Foata normal form. 333/20977 useless extension candidates. Maximal degree in co-relation 59730. Up to 5009 conditions per place. [2025-03-17 11:03:33,857 INFO L140 encePairwiseOnDemand]: 133/152 looper letters, 326 selfloop transitions, 238 changer transitions 1/697 dead transitions. [2025-03-17 11:03:33,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 697 transitions, 5706 flow [2025-03-17 11:03:33,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 11:03:33,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-17 11:03:33,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1275 transitions. [2025-03-17 11:03:33,860 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8388157894736842 [2025-03-17 11:03:33,860 INFO L175 Difference]: Start difference. First operand has 189 places, 362 transitions, 2158 flow. Second operand 10 states and 1275 transitions. [2025-03-17 11:03:33,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 697 transitions, 5706 flow [2025-03-17 11:03:33,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 697 transitions, 5692 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:03:33,944 INFO L231 Difference]: Finished difference. Result has 203 places, 535 transitions, 4595 flow [2025-03-17 11:03:33,944 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=2144, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4595, PETRI_PLACES=203, PETRI_TRANSITIONS=535} [2025-03-17 11:03:33,945 INFO L279 CegarLoopForPetriNet]: 151 programPoint places, 52 predicate places. [2025-03-17 11:03:33,945 INFO L471 AbstractCegarLoop]: Abstraction has has 203 places, 535 transitions, 4595 flow [2025-03-17 11:03:33,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 113.7) internal successors, (1137), 10 states have internal predecessors, (1137), 0 states have call successors, (0), 0 states 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:03:33,945 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:03:33,945 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:03:33,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 11:03:33,946 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-17 11:03:33,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:03:33,946 INFO L85 PathProgramCache]: Analyzing trace with hash -977113703, now seen corresponding path program 1 times [2025-03-17 11:03:33,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:03:33,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865225393] [2025-03-17 11:03:33,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:03:33,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:03:33,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-17 11:03:33,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-17 11:03:33,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:03:33,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:03:34,205 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:03:34,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:03:34,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865225393] [2025-03-17 11:03:34,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865225393] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:03:34,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:03:34,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 11:03:34,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41663699] [2025-03-17 11:03:34,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:03:34,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 11:03:34,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:03:34,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 11:03:34,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-17 11:03:34,765 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 152 [2025-03-17 11:03:34,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 535 transitions, 4595 flow. Second operand has 10 states, 10 states have (on average 113.0) internal successors, (1130), 10 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states 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:03:34,767 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:03:34,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 152 [2025-03-17 11:03:34,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:03:37,405 INFO L124 PetriNetUnfolderBase]: 6443/22042 cut-off events. [2025-03-17 11:03:37,406 INFO L125 PetriNetUnfolderBase]: For 48246/49766 co-relation queries the response was YES. [2025-03-17 11:03:37,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75870 conditions, 22042 events. 6443/22042 cut-off events. For 48246/49766 co-relation queries the response was YES. Maximal size of possible extension queue 875. Compared 259757 event pairs, 944 based on Foata normal form. 363/20607 useless extension candidates. Maximal degree in co-relation 71438. Up to 5177 conditions per place. [2025-03-17 11:03:37,584 INFO L140 encePairwiseOnDemand]: 142/152 looper letters, 476 selfloop transitions, 38 changer transitions 0/680 dead transitions. [2025-03-17 11:03:37,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 680 transitions, 7431 flow [2025-03-17 11:03:37,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 11:03:37,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 11:03:37,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1076 transitions. [2025-03-17 11:03:37,586 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7865497076023392 [2025-03-17 11:03:37,586 INFO L175 Difference]: Start difference. First operand has 203 places, 535 transitions, 4595 flow. Second operand 9 states and 1076 transitions. [2025-03-17 11:03:37,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 680 transitions, 7431 flow [2025-03-17 11:03:37,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 680 transitions, 7394 flow, removed 17 selfloop flow, removed 2 redundant places. [2025-03-17 11:03:37,778 INFO L231 Difference]: Finished difference. Result has 208 places, 534 transitions, 4638 flow [2025-03-17 11:03:37,778 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=4562, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=534, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=496, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4638, PETRI_PLACES=208, PETRI_TRANSITIONS=534} [2025-03-17 11:03:37,778 INFO L279 CegarLoopForPetriNet]: 151 programPoint places, 57 predicate places. [2025-03-17 11:03:37,779 INFO L471 AbstractCegarLoop]: Abstraction has has 208 places, 534 transitions, 4638 flow [2025-03-17 11:03:37,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 113.0) internal successors, (1130), 10 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states 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:03:37,779 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:03:37,779 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:03:37,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 11:03:37,779 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-17 11:03:37,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:03:37,780 INFO L85 PathProgramCache]: Analyzing trace with hash 964399959, now seen corresponding path program 1 times [2025-03-17 11:03:37,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:03:37,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125981382] [2025-03-17 11:03:37,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:03:37,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:03:37,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-17 11:03:37,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-17 11:03:37,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:03:37,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:03:38,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:03:38,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:03:38,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125981382] [2025-03-17 11:03:38,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125981382] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:03:38,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:03:38,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 11:03:38,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163441876] [2025-03-17 11:03:38,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:03:38,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 11:03:38,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:03:38,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 11:03:38,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-17 11:03:38,629 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 152 [2025-03-17 11:03:38,631 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 534 transitions, 4638 flow. Second operand has 10 states, 10 states have (on average 107.1) internal successors, (1071), 10 states have internal predecessors, (1071), 0 states have call successors, (0), 0 states 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:03:38,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:03:38,631 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 152 [2025-03-17 11:03:38,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:03:41,849 INFO L124 PetriNetUnfolderBase]: 6833/22454 cut-off events. [2025-03-17 11:03:41,849 INFO L125 PetriNetUnfolderBase]: For 53949/55284 co-relation queries the response was YES. [2025-03-17 11:03:42,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80174 conditions, 22454 events. 6833/22454 cut-off events. For 53949/55284 co-relation queries the response was YES. Maximal size of possible extension queue 872. Compared 261055 event pairs, 1112 based on Foata normal form. 287/20931 useless extension candidates. Maximal degree in co-relation 75918. Up to 6626 conditions per place. [2025-03-17 11:03:42,121 INFO L140 encePairwiseOnDemand]: 142/152 looper letters, 500 selfloop transitions, 36 changer transitions 0/679 dead transitions. [2025-03-17 11:03:42,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 679 transitions, 7510 flow [2025-03-17 11:03:42,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 11:03:42,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 11:03:42,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1028 transitions. [2025-03-17 11:03:42,123 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7514619883040936 [2025-03-17 11:03:42,123 INFO L175 Difference]: Start difference. First operand has 208 places, 534 transitions, 4638 flow. Second operand 9 states and 1028 transitions. [2025-03-17 11:03:42,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 679 transitions, 7510 flow [2025-03-17 11:03:42,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 679 transitions, 7434 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-17 11:03:42,366 INFO L231 Difference]: Finished difference. Result has 207 places, 533 transitions, 4630 flow [2025-03-17 11:03:42,366 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=4558, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=533, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=497, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4630, PETRI_PLACES=207, PETRI_TRANSITIONS=533} [2025-03-17 11:03:42,367 INFO L279 CegarLoopForPetriNet]: 151 programPoint places, 56 predicate places. [2025-03-17 11:03:42,367 INFO L471 AbstractCegarLoop]: Abstraction has has 207 places, 533 transitions, 4630 flow [2025-03-17 11:03:42,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 107.1) internal successors, (1071), 10 states have internal predecessors, (1071), 0 states have call successors, (0), 0 states 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:03:42,367 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:03:42,367 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:03:42,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 11:03:42,367 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thrErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-17 11:03:42,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:03:42,368 INFO L85 PathProgramCache]: Analyzing trace with hash -799149325, now seen corresponding path program 1 times [2025-03-17 11:03:42,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:03:42,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543640460] [2025-03-17 11:03:42,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:03:42,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:03:42,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-17 11:03:42,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-17 11:03:42,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:03:42,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:03:42,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:03:42,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:03:42,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543640460] [2025-03-17 11:03:42,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543640460] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:03:42,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:03:42,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:03:42,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50998176] [2025-03-17 11:03:42,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:03:42,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:03:42,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:03:42,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:03:42,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:03:42,725 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 152 [2025-03-17 11:03:42,725 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 533 transitions, 4630 flow. Second operand has 6 states, 6 states have (on average 120.33333333333333) internal successors, (722), 6 states have internal predecessors, (722), 0 states have call successors, (0), 0 states 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:03:42,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:03:42,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 152 [2025-03-17 11:03:42,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:03:45,548 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([456] thrEXIT-->L706: Formula: (= |v_ULTIMATE.start_main_#t~mem10#1_8| v_thrThread1of2ForFork0_thidvar0_4) InVars {thrThread1of2ForFork0_thidvar0=v_thrThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_8|} OutVars{thrThread1of2ForFork0_thidvar0=v_thrThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_8|} AuxVars[] AssignedVars[][213], [Black: 190#(= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0), Black: 192#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0)), Black: 191#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0)), Black: 188#true, Black: 201#(= |thrThread1of2ForFork0_#t~nondet4| |#race~x~0|), 152#true, 273#true, 156#(= |ULTIMATE.start_main_~i~0#1| 0), 15#L695-4true, 264#(and (= (select |#valid| 3) 1) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3))), Black: 154#true, 120#L706true, Black: 158#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 0)), Black: 225#(and (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|) (= (select |#valid| 3) 1) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 3 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= 3 |~#a~0.base|) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 221#(and (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|) (= (select |#valid| 3) 1) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3)) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 207#(and (= (select |#valid| 3) 1) (= 3 |~#a~0.base|)), 162#true, 193#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 3 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0)), Black: 219#(and (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|) (= (select |#valid| 3) 1) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3)) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 223#(and (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|) (= (select |#valid| 3) 1) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 3 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3)) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 217#(and (= (select |#valid| 3) 1) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3)) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 164#(= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|), Black: 165#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), 149#true, Black: 166#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), Black: 167#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 3 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), 215#(and (= (select |#valid| 3) 1) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3))), Black: 173#true, Black: 183#(and (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 3 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 182#(and (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 181#(and (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 180#(= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|), 178#true]) [2025-03-17 11:03:45,549 INFO L294 olderBase$Statistics]: this new event has 109 ancestors and is not cut-off event [2025-03-17 11:03:45,549 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is not cut-off event [2025-03-17 11:03:45,549 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is not cut-off event [2025-03-17 11:03:45,549 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is not cut-off event [2025-03-17 11:03:46,483 INFO L124 PetriNetUnfolderBase]: 11929/32731 cut-off events. [2025-03-17 11:03:46,483 INFO L125 PetriNetUnfolderBase]: For 85228/86546 co-relation queries the response was YES. [2025-03-17 11:03:46,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119448 conditions, 32731 events. 11929/32731 cut-off events. For 85228/86546 co-relation queries the response was YES. Maximal size of possible extension queue 1399. Compared 371409 event pairs, 1384 based on Foata normal form. 29/30628 useless extension candidates. Maximal degree in co-relation 113172. Up to 14386 conditions per place. [2025-03-17 11:03:46,944 INFO L140 encePairwiseOnDemand]: 129/152 looper letters, 367 selfloop transitions, 354 changer transitions 0/890 dead transitions. [2025-03-17 11:03:46,944 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 890 transitions, 9346 flow [2025-03-17 11:03:46,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:03:46,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:03:46,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 824 transitions. [2025-03-17 11:03:46,946 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9035087719298246 [2025-03-17 11:03:46,946 INFO L175 Difference]: Start difference. First operand has 207 places, 533 transitions, 4630 flow. Second operand 6 states and 824 transitions. [2025-03-17 11:03:46,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 890 transitions, 9346 flow [2025-03-17 11:03:47,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 890 transitions, 9126 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-17 11:03:47,408 INFO L231 Difference]: Finished difference. Result has 208 places, 821 transitions, 8451 flow [2025-03-17 11:03:47,409 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=4558, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=533, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=121, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=308, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=8451, PETRI_PLACES=208, PETRI_TRANSITIONS=821} [2025-03-17 11:03:47,409 INFO L279 CegarLoopForPetriNet]: 151 programPoint places, 57 predicate places. [2025-03-17 11:03:47,409 INFO L471 AbstractCegarLoop]: Abstraction has has 208 places, 821 transitions, 8451 flow [2025-03-17 11:03:47,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 120.33333333333333) internal successors, (722), 6 states have internal predecessors, (722), 0 states have call successors, (0), 0 states 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:03:47,410 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:03:47,410 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:03:47,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 11:03:47,410 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thrErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-17 11:03:47,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:03:47,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1952667591, now seen corresponding path program 1 times [2025-03-17 11:03:47,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:03:47,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656983478] [2025-03-17 11:03:47,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:03:47,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:03:47,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-17 11:03:47,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-17 11:03:47,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:03:47,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:03:47,447 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:03:47,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:03:47,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656983478] [2025-03-17 11:03:47,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656983478] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:03:47,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:03:47,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:03:47,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55666339] [2025-03-17 11:03:47,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:03:47,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:03:47,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:03:47,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:03:47,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:03:47,461 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 152 [2025-03-17 11:03:47,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 821 transitions, 8451 flow. Second operand has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states 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:03:47,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:03:47,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 152 [2025-03-17 11:03:47,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:03:50,107 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([456] thrEXIT-->L706: Formula: (= |v_ULTIMATE.start_main_#t~mem10#1_8| v_thrThread1of2ForFork0_thidvar0_4) InVars {thrThread1of2ForFork0_thidvar0=v_thrThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_8|} OutVars{thrThread1of2ForFork0_thidvar0=v_thrThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_8|} AuxVars[] AssignedVars[][217], [Black: 190#(= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0), Black: 192#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0)), Black: 191#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0)), Black: 188#true, 283#true, Black: 201#(= |thrThread1of2ForFork0_#t~nondet4| |#race~x~0|), 152#true, 273#true, 156#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 278#(and (= |thrThread2of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 3 (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset|))) (= |thrThread2of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 2 (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset|))) (= |thrThread2of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset| 1))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread2of2ForFork0_#t~nondet3|)), Black: 277#(and (= |thrThread2of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 2 (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset|))) (= |thrThread2of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset| 1))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread2of2ForFork0_#t~nondet3|)), Black: 276#(and (= |thrThread2of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset| 1))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread2of2ForFork0_#t~nondet3|)), Black: 275#(= (select (select |#race| |~#a~0.base|) (+ (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread2of2ForFork0_#t~nondet3|), Black: 154#true, 120#L706true, Black: 158#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 0)), Black: 225#(and (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|) (= (select |#valid| 3) 1) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 3 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= 3 |~#a~0.base|) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 221#(and (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|) (= (select |#valid| 3) 1) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3)) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 207#(and (= (select |#valid| 3) 1) (= 3 |~#a~0.base|)), 193#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 3 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0)), 162#true, Black: 219#(and (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|) (= (select |#valid| 3) 1) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3)) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 223#(and (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|) (= (select |#valid| 3) 1) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 3 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3)) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 217#(and (= (select |#valid| 3) 1) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3)) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 164#(= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|), Black: 165#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), 149#true, Black: 166#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), Black: 167#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 3 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), 215#(and (= (select |#valid| 3) 1) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3))), Black: 173#true, Black: 183#(and (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 3 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 182#(and (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 181#(and (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 180#(= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|), 178#true, 55#L695-2true]) [2025-03-17 11:03:50,107 INFO L294 olderBase$Statistics]: this new event has 111 ancestors and is cut-off event [2025-03-17 11:03:50,107 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-03-17 11:03:50,107 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-03-17 11:03:50,107 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-03-17 11:03:50,182 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([456] thrEXIT-->L706: Formula: (= |v_ULTIMATE.start_main_#t~mem10#1_8| v_thrThread1of2ForFork0_thidvar0_4) InVars {thrThread1of2ForFork0_thidvar0=v_thrThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_8|} OutVars{thrThread1of2ForFork0_thidvar0=v_thrThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_8|} AuxVars[] AssignedVars[][782], [Black: 190#(= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0), Black: 192#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0)), Black: 191#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0)), Black: 188#true, Black: 201#(= |thrThread1of2ForFork0_#t~nondet4| |#race~x~0|), 152#true, 273#true, 156#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 278#(and (= |thrThread2of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 3 (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset|))) (= |thrThread2of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 2 (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset|))) (= |thrThread2of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset| 1))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread2of2ForFork0_#t~nondet3|)), Black: 277#(and (= |thrThread2of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 2 (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset|))) (= |thrThread2of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset| 1))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread2of2ForFork0_#t~nondet3|)), Black: 276#(and (= |thrThread2of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset| 1))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread2of2ForFork0_#t~nondet3|)), Black: 275#(= (select (select |#race| |~#a~0.base|) (+ (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread2of2ForFork0_#t~nondet3|), 285#(= |thrThread2of2ForFork0_#t~nondet4| |#race~x~0|), Black: 154#true, 120#L706true, Black: 158#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 0)), Black: 225#(and (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|) (= (select |#valid| 3) 1) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 3 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= 3 |~#a~0.base|) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 221#(and (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|) (= (select |#valid| 3) 1) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3)) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 207#(and (= (select |#valid| 3) 1) (= 3 |~#a~0.base|)), 193#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 3 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0)), 162#true, Black: 219#(and (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|) (= (select |#valid| 3) 1) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3)) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 223#(and (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|) (= (select |#valid| 3) 1) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 3 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3)) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 217#(and (= (select |#valid| 3) 1) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3)) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), 80#L695-1true, Black: 164#(= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|), Black: 165#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), 149#true, Black: 166#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), Black: 167#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 3 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), 215#(and (= (select |#valid| 3) 1) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3))), Black: 175#(= |#race~x~0| 0), Black: 183#(and (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 3 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 182#(and (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 181#(and (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 180#(= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|), 178#true]) [2025-03-17 11:03:50,182 INFO L294 olderBase$Statistics]: this new event has 113 ancestors and is cut-off event [2025-03-17 11:03:50,182 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2025-03-17 11:03:50,182 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2025-03-17 11:03:50,182 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2025-03-17 11:03:50,776 INFO L124 PetriNetUnfolderBase]: 10379/30619 cut-off events. [2025-03-17 11:03:50,776 INFO L125 PetriNetUnfolderBase]: For 86758/88512 co-relation queries the response was YES. [2025-03-17 11:03:50,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115214 conditions, 30619 events. 10379/30619 cut-off events. For 86758/88512 co-relation queries the response was YES. Maximal size of possible extension queue 1486. Compared 360619 event pairs, 744 based on Foata normal form. 72/29750 useless extension candidates. Maximal degree in co-relation 109283. Up to 7301 conditions per place. [2025-03-17 11:03:51,064 INFO L140 encePairwiseOnDemand]: 146/152 looper letters, 16 selfloop transitions, 9 changer transitions 0/827 dead transitions. [2025-03-17 11:03:51,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 827 transitions, 8526 flow [2025-03-17 11:03:51,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:03:51,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:03:51,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 426 transitions. [2025-03-17 11:03:51,065 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9342105263157895 [2025-03-17 11:03:51,065 INFO L175 Difference]: Start difference. First operand has 208 places, 821 transitions, 8451 flow. Second operand 3 states and 426 transitions. [2025-03-17 11:03:51,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 827 transitions, 8526 flow [2025-03-17 11:03:51,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 827 transitions, 8442 flow, removed 42 selfloop flow, removed 0 redundant places. [2025-03-17 11:03:51,775 INFO L231 Difference]: Finished difference. Result has 212 places, 826 transitions, 8435 flow [2025-03-17 11:03:51,776 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=8367, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=821, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=812, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=8435, PETRI_PLACES=212, PETRI_TRANSITIONS=826} [2025-03-17 11:03:51,776 INFO L279 CegarLoopForPetriNet]: 151 programPoint places, 61 predicate places. [2025-03-17 11:03:51,776 INFO L471 AbstractCegarLoop]: Abstraction has has 212 places, 826 transitions, 8435 flow [2025-03-17 11:03:51,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states 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:03:51,776 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:03:51,776 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:03:51,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 11:03:51,776 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-17 11:03:51,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:03:51,777 INFO L85 PathProgramCache]: Analyzing trace with hash -272088769, now seen corresponding path program 1 times [2025-03-17 11:03:51,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:03:51,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159396873] [2025-03-17 11:03:51,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:03:51,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:03:51,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-17 11:03:51,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-17 11:03:51,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:03:51,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:03:51,792 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 11:03:51,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-17 11:03:51,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-17 11:03:51,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:03:51,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:03:51,809 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 11:03:51,809 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 11:03:51,809 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2025-03-17 11:03:51,809 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (11 of 13 remaining) [2025-03-17 11:03:51,809 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (10 of 13 remaining) [2025-03-17 11:03:51,809 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 13 remaining) [2025-03-17 11:03:51,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (8 of 13 remaining) [2025-03-17 11:03:51,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (7 of 13 remaining) [2025-03-17 11:03:51,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (6 of 13 remaining) [2025-03-17 11:03:51,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (5 of 13 remaining) [2025-03-17 11:03:51,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (4 of 13 remaining) [2025-03-17 11:03:51,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (3 of 13 remaining) [2025-03-17 11:03:51,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (2 of 13 remaining) [2025-03-17 11:03:51,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (1 of 13 remaining) [2025-03-17 11:03:51,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (0 of 13 remaining) [2025-03-17 11:03:51,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 11:03:51,810 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:03:51,811 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 11:03:51,811 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-17 11:03:51,828 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-17 11:03:51,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 175 places, 175 transitions, 377 flow [2025-03-17 11:03:51,860 INFO L124 PetriNetUnfolderBase]: 33/574 cut-off events. [2025-03-17 11:03:51,861 INFO L125 PetriNetUnfolderBase]: For 19/21 co-relation queries the response was YES. [2025-03-17 11:03:51,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 599 conditions, 574 events. 33/574 cut-off events. For 19/21 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1972 event pairs, 1 based on Foata normal form. 0/508 useless extension candidates. Maximal degree in co-relation 337. Up to 16 conditions per place. [2025-03-17 11:03:51,862 INFO L82 GeneralOperation]: Start removeDead. Operand has 175 places, 175 transitions, 377 flow [2025-03-17 11:03:51,867 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 175 places, 175 transitions, 377 flow [2025-03-17 11:03:51,869 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:03:51,869 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;@1ce4f80f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:03:51,869 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-03-17 11:03:51,871 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:03:51,871 INFO L124 PetriNetUnfolderBase]: 1/64 cut-off events. [2025-03-17 11:03:51,872 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:03:51,872 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:03:51,872 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:03:51,872 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-17 11:03:51,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:03:51,872 INFO L85 PathProgramCache]: Analyzing trace with hash 942890658, now seen corresponding path program 1 times [2025-03-17 11:03:51,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:03:51,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128436844] [2025-03-17 11:03:51,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:03:51,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:03:51,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-17 11:03:51,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 11:03:51,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:03:51,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:03:51,915 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:03:51,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:03:51,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128436844] [2025-03-17 11:03:51,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128436844] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:03:51,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:03:51,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:03:51,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555126091] [2025-03-17 11:03:51,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:03:51,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:03:51,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:03:51,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:03:51,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:03:51,996 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 175 [2025-03-17 11:03:51,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 175 transitions, 377 flow. Second operand has 5 states, 5 states have (on average 150.4) internal successors, (752), 5 states have internal predecessors, (752), 0 states have call successors, (0), 0 states 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:03:51,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:03:51,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 175 [2025-03-17 11:03:51,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:03:52,078 INFO L124 PetriNetUnfolderBase]: 25/757 cut-off events. [2025-03-17 11:03:52,078 INFO L125 PetriNetUnfolderBase]: For 58/86 co-relation queries the response was YES. [2025-03-17 11:03:52,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 926 conditions, 757 events. 25/757 cut-off events. For 58/86 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3340 event pairs, 0 based on Foata normal form. 37/713 useless extension candidates. Maximal degree in co-relation 480. Up to 91 conditions per place. [2025-03-17 11:03:52,081 INFO L140 encePairwiseOnDemand]: 160/175 looper letters, 27 selfloop transitions, 9 changer transitions 4/187 dead transitions. [2025-03-17 11:03:52,081 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 187 transitions, 488 flow [2025-03-17 11:03:52,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:03:52,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 11:03:52,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 642 transitions. [2025-03-17 11:03:52,083 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9171428571428571 [2025-03-17 11:03:52,083 INFO L175 Difference]: Start difference. First operand has 175 places, 175 transitions, 377 flow. Second operand 4 states and 642 transitions. [2025-03-17 11:03:52,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 187 transitions, 488 flow [2025-03-17 11:03:52,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 187 transitions, 488 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:03:52,085 INFO L231 Difference]: Finished difference. Result has 179 places, 176 transitions, 435 flow [2025-03-17 11:03:52,086 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=435, PETRI_PLACES=179, PETRI_TRANSITIONS=176} [2025-03-17 11:03:52,086 INFO L279 CegarLoopForPetriNet]: 175 programPoint places, 4 predicate places. [2025-03-17 11:03:52,086 INFO L471 AbstractCegarLoop]: Abstraction has has 179 places, 176 transitions, 435 flow [2025-03-17 11:03:52,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 150.4) internal successors, (752), 5 states have internal predecessors, (752), 0 states have call successors, (0), 0 states 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:03:52,087 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:03:52,087 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:03:52,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 11:03:52,087 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-17 11:03:52,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:03:52,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1824158773, now seen corresponding path program 1 times [2025-03-17 11:03:52,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:03:52,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173181260] [2025-03-17 11:03:52,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:03:52,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:03:52,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-17 11:03:52,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-17 11:03:52,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:03:52,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:03:52,221 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:03:52,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:03:52,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173181260] [2025-03-17 11:03:52,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173181260] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:03:52,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:03:52,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:03:52,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620580557] [2025-03-17 11:03:52,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:03:52,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:03:52,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:03:52,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:03:52,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:03:52,362 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 175 [2025-03-17 11:03:52,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 176 transitions, 435 flow. Second operand has 6 states, 6 states have (on average 126.66666666666667) internal successors, (760), 6 states have internal predecessors, (760), 0 states have call successors, (0), 0 states 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:03:52,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:03:52,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 175 [2025-03-17 11:03:52,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:03:54,382 INFO L124 PetriNetUnfolderBase]: 10841/30705 cut-off events. [2025-03-17 11:03:54,382 INFO L125 PetriNetUnfolderBase]: For 3370/3494 co-relation queries the response was YES. [2025-03-17 11:03:54,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49795 conditions, 30705 events. 10841/30705 cut-off events. For 3370/3494 co-relation queries the response was YES. Maximal size of possible extension queue 934. Compared 345789 event pairs, 8007 based on Foata normal form. 0/27748 useless extension candidates. Maximal degree in co-relation 21955. Up to 15381 conditions per place. [2025-03-17 11:03:54,535 INFO L140 encePairwiseOnDemand]: 156/175 looper letters, 52 selfloop transitions, 54 changer transitions 0/231 dead transitions. [2025-03-17 11:03:54,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 231 transitions, 769 flow [2025-03-17 11:03:54,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:03:54,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:03:54,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 852 transitions. [2025-03-17 11:03:54,541 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8114285714285714 [2025-03-17 11:03:54,541 INFO L175 Difference]: Start difference. First operand has 179 places, 176 transitions, 435 flow. Second operand 6 states and 852 transitions. [2025-03-17 11:03:54,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 231 transitions, 769 flow [2025-03-17 11:03:54,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 231 transitions, 767 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-03-17 11:03:54,546 INFO L231 Difference]: Finished difference. Result has 188 places, 229 transitions, 791 flow [2025-03-17 11:03:54,546 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=433, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=791, PETRI_PLACES=188, PETRI_TRANSITIONS=229} [2025-03-17 11:03:54,547 INFO L279 CegarLoopForPetriNet]: 175 programPoint places, 13 predicate places. [2025-03-17 11:03:54,547 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 229 transitions, 791 flow [2025-03-17 11:03:54,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 126.66666666666667) internal successors, (760), 6 states have internal predecessors, (760), 0 states have call successors, (0), 0 states 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:03:54,548 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:03:54,548 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:03:54,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 11:03:54,548 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thrErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-17 11:03:54,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:03:54,548 INFO L85 PathProgramCache]: Analyzing trace with hash -429026154, now seen corresponding path program 1 times [2025-03-17 11:03:54,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:03:54,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207353322] [2025-03-17 11:03:54,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:03:54,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:03:54,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-17 11:03:54,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 11:03:54,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:03:54,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:03:54,567 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:03:54,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:03:54,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207353322] [2025-03-17 11:03:54,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207353322] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:03:54,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:03:54,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:03:54,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9558224] [2025-03-17 11:03:54,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:03:54,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:03:54,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:03:54,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:03:54,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:03:54,585 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 175 [2025-03-17 11:03:54,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 229 transitions, 791 flow. Second operand has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 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:03:54,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:03:54,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 175 [2025-03-17 11:03:54,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:03:57,542 INFO L124 PetriNetUnfolderBase]: 9552/38538 cut-off events. [2025-03-17 11:03:57,542 INFO L125 PetriNetUnfolderBase]: For 7584/7994 co-relation queries the response was YES. [2025-03-17 11:03:57,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65206 conditions, 38538 events. 9552/38538 cut-off events. For 7584/7994 co-relation queries the response was YES. Maximal size of possible extension queue 1294. Compared 517301 event pairs, 2680 based on Foata normal form. 1/34841 useless extension candidates. Maximal degree in co-relation 54593. Up to 9627 conditions per place. [2025-03-17 11:03:57,811 INFO L140 encePairwiseOnDemand]: 163/175 looper letters, 23 selfloop transitions, 9 changer transitions 0/243 dead transitions. [2025-03-17 11:03:57,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 243 transitions, 904 flow [2025-03-17 11:03:57,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:03:57,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:03:57,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 494 transitions. [2025-03-17 11:03:57,812 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.940952380952381 [2025-03-17 11:03:57,812 INFO L175 Difference]: Start difference. First operand has 188 places, 229 transitions, 791 flow. Second operand 3 states and 494 transitions. [2025-03-17 11:03:57,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 243 transitions, 904 flow [2025-03-17 11:03:57,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 243 transitions, 904 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:03:57,879 INFO L231 Difference]: Finished difference. Result has 192 places, 238 transitions, 869 flow [2025-03-17 11:03:57,879 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=791, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=869, PETRI_PLACES=192, PETRI_TRANSITIONS=238} [2025-03-17 11:03:57,879 INFO L279 CegarLoopForPetriNet]: 175 programPoint places, 17 predicate places. [2025-03-17 11:03:57,879 INFO L471 AbstractCegarLoop]: Abstraction has has 192 places, 238 transitions, 869 flow [2025-03-17 11:03:57,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 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:03:57,880 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:03:57,880 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:03:57,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 11:03:57,880 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thrErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-17 11:03:57,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:03:57,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1579757926, now seen corresponding path program 1 times [2025-03-17 11:03:57,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:03:57,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33175863] [2025-03-17 11:03:57,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:03:57,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:03:57,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-17 11:03:57,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 11:03:57,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:03:57,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:03:58,011 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:03:58,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:03:58,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33175863] [2025-03-17 11:03:58,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33175863] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:03:58,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:03:58,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:03:58,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21804617] [2025-03-17 11:03:58,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:03:58,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:03:58,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:03:58,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:03:58,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:03:58,158 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 175 [2025-03-17 11:03:58,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 238 transitions, 869 flow. Second operand has 6 states, 6 states have (on average 137.16666666666666) internal successors, (823), 6 states have internal predecessors, (823), 0 states have call successors, (0), 0 states 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:03:58,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:03:58,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 175 [2025-03-17 11:03:58,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:04:05,267 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([614] L694-5-->L694-4: Formula: (= (store |v_#race_40| |v_~#a~0.base_24| (store (select |v_#race_40| |v_~#a~0.base_24|) (+ |v_~#a~0.offset_24| (* 4 v_thrThread3of3ForFork0_~t~0_5)) |v_thrThread3of3ForFork0_#t~nondet3_3|)) |v_#race_39|) InVars {#race=|v_#race_40|, ~#a~0.base=|v_~#a~0.base_24|, ~#a~0.offset=|v_~#a~0.offset_24|, thrThread3of3ForFork0_~t~0=v_thrThread3of3ForFork0_~t~0_5, thrThread3of3ForFork0_#t~nondet3=|v_thrThread3of3ForFork0_#t~nondet3_3|} OutVars{#race=|v_#race_39|, ~#a~0.base=|v_~#a~0.base_24|, ~#a~0.offset=|v_~#a~0.offset_24|, thrThread3of3ForFork0_~t~0=v_thrThread3of3ForFork0_~t~0_5, thrThread3of3ForFork0_#t~nondet3=|v_thrThread3of3ForFork0_#t~nondet3_3|} AuxVars[] AssignedVars[#race][328], [Black: 189#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), Black: 190#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), Black: 191#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 3 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), Black: 188#(= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|), 172#true, Black: 197#true, 186#true, 54#L695true, 174#true, 125#L703-3true, 94#L694-1true, Black: 182#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 0)), 199#(= |#race~x~0| 0), Black: 180#(= |ULTIMATE.start_main_~i~0#1| 0), 129#L694-4true, 176#true, 202#true, 178#true]) [2025-03-17 11:04:05,267 INFO L294 olderBase$Statistics]: this new event has 129 ancestors and is cut-off event [2025-03-17 11:04:05,267 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2025-03-17 11:04:05,267 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2025-03-17 11:04:05,267 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2025-03-17 11:04:14,420 INFO L124 PetriNetUnfolderBase]: 55894/177292 cut-off events. [2025-03-17 11:04:14,420 INFO L125 PetriNetUnfolderBase]: For 44360/46507 co-relation queries the response was YES. [2025-03-17 11:04:15,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 351573 conditions, 177292 events. 55894/177292 cut-off events. For 44360/46507 co-relation queries the response was YES. Maximal size of possible extension queue 3890. Compared 2653746 event pairs, 14827 based on Foata normal form. 47/160318 useless extension candidates. Maximal degree in co-relation 299191. Up to 56957 conditions per place. [2025-03-17 11:04:15,692 INFO L140 encePairwiseOnDemand]: 148/175 looper letters, 137 selfloop transitions, 128 changer transitions 0/416 dead transitions. [2025-03-17 11:04:15,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 416 transitions, 2203 flow [2025-03-17 11:04:15,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:04:15,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:04:15,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 960 transitions. [2025-03-17 11:04:15,694 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9142857142857143 [2025-03-17 11:04:15,694 INFO L175 Difference]: Start difference. First operand has 192 places, 238 transitions, 869 flow. Second operand 6 states and 960 transitions. [2025-03-17 11:04:15,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 416 transitions, 2203 flow [2025-03-17 11:04:16,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 416 transitions, 2185 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:04:16,108 INFO L231 Difference]: Finished difference. Result has 199 places, 366 transitions, 1994 flow [2025-03-17 11:04:16,109 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=851, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1994, PETRI_PLACES=199, PETRI_TRANSITIONS=366} [2025-03-17 11:04:16,109 INFO L279 CegarLoopForPetriNet]: 175 programPoint places, 24 predicate places. [2025-03-17 11:04:16,109 INFO L471 AbstractCegarLoop]: Abstraction has has 199 places, 366 transitions, 1994 flow [2025-03-17 11:04:16,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 137.16666666666666) internal successors, (823), 6 states have internal predecessors, (823), 0 states have call successors, (0), 0 states 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:04:16,109 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:04:16,109 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:04:16,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 11:04:16,109 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-17 11:04:16,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:04:16,110 INFO L85 PathProgramCache]: Analyzing trace with hash 555323560, now seen corresponding path program 1 times [2025-03-17 11:04:16,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:04:16,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095225812] [2025-03-17 11:04:16,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:04:16,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:04:16,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-17 11:04:16,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-17 11:04:16,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:04:16,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:04:16,227 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:04:16,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:04:16,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095225812] [2025-03-17 11:04:16,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095225812] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:04:16,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:04:16,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:04:16,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318227944] [2025-03-17 11:04:16,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:04:16,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:04:16,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:04:16,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:04:16,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:04:16,398 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 175 [2025-03-17 11:04:16,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 366 transitions, 1994 flow. Second operand has 6 states, 6 states have (on average 133.83333333333334) internal successors, (803), 6 states have internal predecessors, (803), 0 states have call successors, (0), 0 states 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:04:16,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:04:16,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 175 [2025-03-17 11:04:16,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:04:19,247 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([614] L694-5-->L694-4: Formula: (= (store |v_#race_40| |v_~#a~0.base_24| (store (select |v_#race_40| |v_~#a~0.base_24|) (+ |v_~#a~0.offset_24| (* 4 v_thrThread3of3ForFork0_~t~0_5)) |v_thrThread3of3ForFork0_#t~nondet3_3|)) |v_#race_39|) InVars {#race=|v_#race_40|, ~#a~0.base=|v_~#a~0.base_24|, ~#a~0.offset=|v_~#a~0.offset_24|, thrThread3of3ForFork0_~t~0=v_thrThread3of3ForFork0_~t~0_5, thrThread3of3ForFork0_#t~nondet3=|v_thrThread3of3ForFork0_#t~nondet3_3|} OutVars{#race=|v_#race_39|, ~#a~0.base=|v_~#a~0.base_24|, ~#a~0.offset=|v_~#a~0.offset_24|, thrThread3of3ForFork0_~t~0=v_thrThread3of3ForFork0_~t~0_5, thrThread3of3ForFork0_#t~nondet3=|v_thrThread3of3ForFork0_#t~nondet3_3|} AuxVars[] AssignedVars[#race][323], [120#L702-1true, Black: 189#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), Black: 190#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), Black: 191#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 3 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), Black: 188#(= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|), 172#true, Black: 197#true, 186#true, 174#true, 167#L694-4true, 94#L694-1true, Black: 205#(and (= |thrThread1of3ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ (* thrThread1of3ForFork0_~t~0 4) |~#a~0.offset| 1))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of3ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of3ForFork0_#t~nondet3|)), Black: 207#(and (= |thrThread1of3ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ (* thrThread1of3ForFork0_~t~0 4) 2 |~#a~0.offset|))) (= |thrThread1of3ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ (* thrThread1of3ForFork0_~t~0 4) |~#a~0.offset| 1))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of3ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of3ForFork0_#t~nondet3|) (= |thrThread1of3ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ (* thrThread1of3ForFork0_~t~0 4) 3 |~#a~0.offset|)))), Black: 206#(and (= |thrThread1of3ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ (* thrThread1of3ForFork0_~t~0 4) 2 |~#a~0.offset|))) (= |thrThread1of3ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ (* thrThread1of3ForFork0_~t~0 4) |~#a~0.offset| 1))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of3ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of3ForFork0_#t~nondet3|)), Black: 204#(= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of3ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of3ForFork0_#t~nondet3|), Black: 182#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 0)), Black: 180#(= |ULTIMATE.start_main_~i~0#1| 0), 129#L694-4true, 176#true, 202#true, 212#true, 178#true]) [2025-03-17 11:04:19,248 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is cut-off event [2025-03-17 11:04:19,248 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-03-17 11:04:19,248 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-03-17 11:04:19,248 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-03-17 11:04:21,270 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([614] L694-5-->L694-4: Formula: (= (store |v_#race_40| |v_~#a~0.base_24| (store (select |v_#race_40| |v_~#a~0.base_24|) (+ |v_~#a~0.offset_24| (* 4 v_thrThread3of3ForFork0_~t~0_5)) |v_thrThread3of3ForFork0_#t~nondet3_3|)) |v_#race_39|) InVars {#race=|v_#race_40|, ~#a~0.base=|v_~#a~0.base_24|, ~#a~0.offset=|v_~#a~0.offset_24|, thrThread3of3ForFork0_~t~0=v_thrThread3of3ForFork0_~t~0_5, thrThread3of3ForFork0_#t~nondet3=|v_thrThread3of3ForFork0_#t~nondet3_3|} OutVars{#race=|v_#race_39|, ~#a~0.base=|v_~#a~0.base_24|, ~#a~0.offset=|v_~#a~0.offset_24|, thrThread3of3ForFork0_~t~0=v_thrThread3of3ForFork0_~t~0_5, thrThread3of3ForFork0_#t~nondet3=|v_thrThread3of3ForFork0_#t~nondet3_3|} AuxVars[] AssignedVars[#race][323], [Black: 189#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), Black: 190#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), Black: 191#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 3 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), Black: 188#(= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|), 172#true, Black: 197#true, 186#true, 174#true, 167#L694-4true, 94#L694-1true, Black: 205#(and (= |thrThread1of3ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ (* thrThread1of3ForFork0_~t~0 4) |~#a~0.offset| 1))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of3ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of3ForFork0_#t~nondet3|)), Black: 207#(and (= |thrThread1of3ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ (* thrThread1of3ForFork0_~t~0 4) 2 |~#a~0.offset|))) (= |thrThread1of3ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ (* thrThread1of3ForFork0_~t~0 4) |~#a~0.offset| 1))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of3ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of3ForFork0_#t~nondet3|) (= |thrThread1of3ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ (* thrThread1of3ForFork0_~t~0 4) 3 |~#a~0.offset|)))), Black: 206#(and (= |thrThread1of3ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ (* thrThread1of3ForFork0_~t~0 4) 2 |~#a~0.offset|))) (= |thrThread1of3ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ (* thrThread1of3ForFork0_~t~0 4) |~#a~0.offset| 1))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of3ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of3ForFork0_#t~nondet3|)), Black: 204#(= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of3ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of3ForFork0_#t~nondet3|), Black: 182#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 0)), 180#(= |ULTIMATE.start_main_~i~0#1| 0), 135#L705true, Black: 178#true, 129#L694-4true, 176#true, 202#true, 212#true]) [2025-03-17 11:04:21,271 INFO L294 olderBase$Statistics]: this new event has 113 ancestors and is cut-off event [2025-03-17 11:04:21,271 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2025-03-17 11:04:21,271 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2025-03-17 11:04:21,271 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event