/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.positions.where.we.compute.the.hoare.annotation All --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true --cacsl2boogietranslator.check.unreachability.of.reach_error.function false -i ../../../trunk/examples/svcomp/pthread/queue_ok_longer.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 00:03:33,956 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 00:03:34,011 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2025-03-15 00:03:34,062 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 00:03:34,065 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 00:03:34,065 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 00:03:34,065 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 00:03:34,065 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 00:03:34,065 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 00:03:34,066 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 00:03:34,066 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 00:03:34,066 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 00:03:34,066 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 00:03:34,066 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 00:03:34,066 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 00:03:34,066 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 00:03:34,066 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 00:03:34,066 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 00:03:34,066 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 00:03:34,066 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 00:03:34,066 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 00:03:34,066 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 00:03:34,066 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 00:03:34,067 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 00:03:34,067 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 00:03:34,067 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 00:03:34,067 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 00:03:34,067 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 00:03:34,067 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 00:03:34,067 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 00:03:34,067 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 00:03:34,067 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 00:03:34,067 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2025-03-15 00:03:34,370 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 00:03:34,377 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 00:03:34,378 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 00:03:34,380 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 00:03:34,380 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 00:03:34,381 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok_longer.i [2025-03-15 00:03:35,574 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0573c4a38/ed1c868339194ca984dbe0df4b0ee225/FLAG22687d6df [2025-03-15 00:03:35,861 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 00:03:35,862 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longer.i [2025-03-15 00:03:35,875 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0573c4a38/ed1c868339194ca984dbe0df4b0ee225/FLAG22687d6df [2025-03-15 00:03:35,886 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0573c4a38/ed1c868339194ca984dbe0df4b0ee225 [2025-03-15 00:03:35,888 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 00:03:35,890 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 00:03:35,891 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 00:03:35,891 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 00:03:35,894 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 00:03:35,894 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 12:03:35" (1/1) ... [2025-03-15 00:03:35,895 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1245c98d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:03:35, skipping insertion in model container [2025-03-15 00:03:35,895 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 12:03:35" (1/1) ... [2025-03-15 00:03:35,934 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 00:03:36,194 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 00:03:36,221 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 00:03:36,291 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 00:03:36,412 INFO L204 MainTranslator]: Completed translation [2025-03-15 00:03:36,413 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:03:36 WrapperNode [2025-03-15 00:03:36,413 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 00:03:36,415 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 00:03:36,415 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 00:03:36,415 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 00:03:36,419 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:03:36" (1/1) ... [2025-03-15 00:03:36,445 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:03:36" (1/1) ... [2025-03-15 00:03:36,521 INFO L138 Inliner]: procedures = 274, calls = 854, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 1169 [2025-03-15 00:03:36,521 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 00:03:36,522 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 00:03:36,522 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 00:03:36,522 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 00:03:36,528 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:03:36" (1/1) ... [2025-03-15 00:03:36,528 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:03:36" (1/1) ... [2025-03-15 00:03:36,546 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:03:36" (1/1) ... [2025-03-15 00:03:36,547 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:03:36" (1/1) ... [2025-03-15 00:03:36,587 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:03:36" (1/1) ... [2025-03-15 00:03:36,594 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:03:36" (1/1) ... [2025-03-15 00:03:36,600 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:03:36" (1/1) ... [2025-03-15 00:03:36,607 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:03:36" (1/1) ... [2025-03-15 00:03:36,610 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:03:36" (1/1) ... [2025-03-15 00:03:36,621 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 00:03:36,622 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 00:03:36,622 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 00:03:36,622 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 00:03:36,623 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:03:36" (1/1) ... [2025-03-15 00:03:36,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 00:03:36,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:03:36,652 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2025-03-15 00:03:36,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2025-03-15 00:03:36,672 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-15 00:03:36,672 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-15 00:03:36,672 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-15 00:03:36,672 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-15 00:03:36,672 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-15 00:03:36,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-15 00:03:36,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-15 00:03:36,672 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-15 00:03:36,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 00:03:36,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 00:03:36,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 00:03:36,672 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 00:03:36,673 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-15 00:03:36,777 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 00:03:36,778 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 00:03:37,986 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 00:03:37,987 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 00:03:38,031 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 00:03:38,031 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-15 00:03:38,031 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 12:03:38 BoogieIcfgContainer [2025-03-15 00:03:38,031 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 00:03:38,033 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 00:03:38,033 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 00:03:38,037 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 00:03:38,037 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 12:03:35" (1/3) ... [2025-03-15 00:03:38,037 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50343b59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 12:03:38, skipping insertion in model container [2025-03-15 00:03:38,037 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:03:36" (2/3) ... [2025-03-15 00:03:38,037 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50343b59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 12:03:38, skipping insertion in model container [2025-03-15 00:03:38,038 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 12:03:38" (3/3) ... [2025-03-15 00:03:38,038 INFO L128 eAbstractionObserver]: Analyzing ICFG queue_ok_longer.i [2025-03-15 00:03:38,051 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 00:03:38,053 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG queue_ok_longer.i that has 3 procedures, 1220 locations, 1 initial locations, 2 loop locations, and 33 error locations. [2025-03-15 00:03:38,054 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 00:03:38,206 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-15 00:03:38,264 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 00:03:38,275 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=All, 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;@250d925a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 00:03:38,276 INFO L334 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2025-03-15 00:03:38,528 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 00:03:38,528 INFO L124 PetriNetUnfolderBase]: 0/829 cut-off events. [2025-03-15 00:03:38,531 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 00:03:38,531 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:03:38,532 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 00:03:38,533 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-15 00:03:38,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:03:38,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1136366607, now seen corresponding path program 1 times [2025-03-15 00:03:38,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:03:38,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52375240] [2025-03-15 00:03:38,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:03:38,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:03:38,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:03:39,382 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-15 00:03:39,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:03:39,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52375240] [2025-03-15 00:03:39,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52375240] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:03:39,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:03:39,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:03:39,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59387971] [2025-03-15 00:03:39,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:03:39,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:03:39,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:03:39,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:03:39,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:03:39,431 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 1201 out of 1232 [2025-03-15 00:03:39,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1226 places, 1232 transitions, 2478 flow. Second operand has 3 states, 3 states have (on average 1202.3333333333333) internal successors, (3607), 3 states have internal predecessors, (3607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:03:39,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:03:39,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1201 of 1232 [2025-03-15 00:03:39,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:03:40,057 INFO L124 PetriNetUnfolderBase]: 83/1821 cut-off events. [2025-03-15 00:03:40,057 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2025-03-15 00:03:40,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1990 conditions, 1821 events. 83/1821 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 5004 event pairs, 53 based on Foata normal form. 3/1697 useless extension candidates. Maximal degree in co-relation 1060. Up to 137 conditions per place. [2025-03-15 00:03:40,080 INFO L140 encePairwiseOnDemand]: 1226/1232 looper letters, 19 selfloop transitions, 2 changer transitions 5/1217 dead transitions. [2025-03-15 00:03:40,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1217 places, 1217 transitions, 2492 flow [2025-03-15 00:03:40,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:03:40,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:03:40,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3630 transitions. [2025-03-15 00:03:40,095 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9821428571428571 [2025-03-15 00:03:40,098 INFO L298 CegarLoopForPetriNet]: 1226 programPoint places, -9 predicate places. [2025-03-15 00:03:40,098 INFO L471 AbstractCegarLoop]: Abstraction has has 1217 places, 1217 transitions, 2492 flow [2025-03-15 00:03:40,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1202.3333333333333) internal successors, (3607), 3 states have internal predecessors, (3607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:03:40,100 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:03:40,100 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 00:03:40,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 00:03:40,101 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-15 00:03:40,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:03:40,103 INFO L85 PathProgramCache]: Analyzing trace with hash -160965353, now seen corresponding path program 1 times [2025-03-15 00:03:40,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:03:40,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286796234] [2025-03-15 00:03:40,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:03:40,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:03:40,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:03:40,646 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-15 00:03:40,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:03:40,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286796234] [2025-03-15 00:03:40,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286796234] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:03:40,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:03:40,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:03:40,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200779184] [2025-03-15 00:03:40,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:03:40,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:03:40,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:03:40,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:03:40,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:03:40,656 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 1201 out of 1232 [2025-03-15 00:03:40,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1217 places, 1217 transitions, 2492 flow. Second operand has 3 states, 3 states have (on average 1202.3333333333333) internal successors, (3607), 3 states have internal predecessors, (3607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:03:40,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:03:40,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1201 of 1232 [2025-03-15 00:03:40,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:03:41,310 INFO L124 PetriNetUnfolderBase]: 158/2637 cut-off events. [2025-03-15 00:03:41,310 INFO L125 PetriNetUnfolderBase]: For 176/206 co-relation queries the response was YES. [2025-03-15 00:03:41,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3041 conditions, 2637 events. 158/2637 cut-off events. For 176/206 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 11463 event pairs, 99 based on Foata normal form. 0/2398 useless extension candidates. Maximal degree in co-relation 1899. Up to 186 conditions per place. [2025-03-15 00:03:41,326 INFO L140 encePairwiseOnDemand]: 1229/1232 looper letters, 19 selfloop transitions, 2 changer transitions 5/1216 dead transitions. [2025-03-15 00:03:41,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1218 places, 1216 transitions, 2536 flow [2025-03-15 00:03:41,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:03:41,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:03:41,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3627 transitions. [2025-03-15 00:03:41,334 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9813311688311688 [2025-03-15 00:03:41,335 INFO L298 CegarLoopForPetriNet]: 1226 programPoint places, -8 predicate places. [2025-03-15 00:03:41,335 INFO L471 AbstractCegarLoop]: Abstraction has has 1218 places, 1216 transitions, 2536 flow [2025-03-15 00:03:41,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1202.3333333333333) internal successors, (3607), 3 states have internal predecessors, (3607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:03:41,337 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:03:41,338 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 00:03:41,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-15 00:03:41,338 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-15 00:03:41,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:03:41,341 INFO L85 PathProgramCache]: Analyzing trace with hash 328459124, now seen corresponding path program 1 times [2025-03-15 00:03:41,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:03:41,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993819438] [2025-03-15 00:03:41,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:03:41,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:03:41,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:03:43,925 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-15 00:03:43,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:03:43,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993819438] [2025-03-15 00:03:43,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993819438] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:03:43,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:03:43,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:03:43,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158566928] [2025-03-15 00:03:43,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:03:43,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:03:43,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:03:43,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:03:43,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:03:43,939 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 1059 out of 1232 [2025-03-15 00:03:43,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1218 places, 1216 transitions, 2536 flow. Second operand has 6 states, 6 states have (on average 1060.5) internal successors, (6363), 6 states have internal predecessors, (6363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:03:43,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:03:43,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1059 of 1232 [2025-03-15 00:03:43,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:03:48,630 INFO L124 PetriNetUnfolderBase]: 4549/15170 cut-off events. [2025-03-15 00:03:48,630 INFO L125 PetriNetUnfolderBase]: For 3880/4810 co-relation queries the response was YES. [2025-03-15 00:03:48,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25612 conditions, 15170 events. 4549/15170 cut-off events. For 3880/4810 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 124091 event pairs, 3966 based on Foata normal form. 0/13321 useless extension candidates. Maximal degree in co-relation 24039. Up to 8532 conditions per place. [2025-03-15 00:03:48,811 INFO L140 encePairwiseOnDemand]: 1226/1232 looper letters, 159 selfloop transitions, 5 changer transitions 5/1215 dead transitions. [2025-03-15 00:03:48,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1222 places, 1215 transitions, 2864 flow [2025-03-15 00:03:48,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:03:48,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:03:48,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6520 transitions. [2025-03-15 00:03:48,831 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8820346320346321 [2025-03-15 00:03:48,832 INFO L298 CegarLoopForPetriNet]: 1226 programPoint places, -4 predicate places. [2025-03-15 00:03:48,832 INFO L471 AbstractCegarLoop]: Abstraction has has 1222 places, 1215 transitions, 2864 flow [2025-03-15 00:03:48,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1060.5) internal successors, (6363), 6 states have internal predecessors, (6363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:03:48,839 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:03:48,840 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 00:03:48,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-15 00:03:48,840 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-15 00:03:48,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:03:48,843 INFO L85 PathProgramCache]: Analyzing trace with hash -280133982, now seen corresponding path program 1 times [2025-03-15 00:03:48,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:03:48,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184657403] [2025-03-15 00:03:48,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:03:48,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:03:48,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:03:50,822 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-15 00:03:50,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:03:50,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184657403] [2025-03-15 00:03:50,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184657403] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:03:50,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:03:50,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:03:50,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199009794] [2025-03-15 00:03:50,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:03:50,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:03:50,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:03:50,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:03:50,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:03:50,829 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 1059 out of 1232 [2025-03-15 00:03:50,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1222 places, 1215 transitions, 2864 flow. Second operand has 6 states, 6 states have (on average 1061.5) internal successors, (6369), 6 states have internal predecessors, (6369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:03:50,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:03:50,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1059 of 1232 [2025-03-15 00:03:50,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:03:55,160 INFO L124 PetriNetUnfolderBase]: 4549/15169 cut-off events. [2025-03-15 00:03:55,160 INFO L125 PetriNetUnfolderBase]: For 5048/6928 co-relation queries the response was YES. [2025-03-15 00:03:55,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34146 conditions, 15169 events. 4549/15169 cut-off events. For 5048/6928 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 124156 event pairs, 3966 based on Foata normal form. 0/13321 useless extension candidates. Maximal degree in co-relation 32414. Up to 8531 conditions per place. [2025-03-15 00:03:55,257 INFO L140 encePairwiseOnDemand]: 1226/1232 looper letters, 158 selfloop transitions, 5 changer transitions 5/1214 dead transitions. [2025-03-15 00:03:55,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1226 places, 1214 transitions, 3188 flow [2025-03-15 00:03:55,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:03:55,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:03:55,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6519 transitions. [2025-03-15 00:03:55,267 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8818993506493507 [2025-03-15 00:03:55,268 INFO L298 CegarLoopForPetriNet]: 1226 programPoint places, 0 predicate places. [2025-03-15 00:03:55,268 INFO L471 AbstractCegarLoop]: Abstraction has has 1226 places, 1214 transitions, 3188 flow [2025-03-15 00:03:55,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1061.5) internal successors, (6369), 6 states have internal predecessors, (6369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:03:55,271 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:03:55,271 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 00:03:55,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-15 00:03:55,272 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-15 00:03:55,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:03:55,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1005758583, now seen corresponding path program 1 times [2025-03-15 00:03:55,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:03:55,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557036238] [2025-03-15 00:03:55,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:03:55,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:03:55,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:03:56,943 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-15 00:03:56,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:03:56,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557036238] [2025-03-15 00:03:56,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557036238] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:03:56,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:03:56,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:03:56,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831067653] [2025-03-15 00:03:56,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:03:56,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:03:56,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:03:56,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:03:56,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:03:56,951 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 1059 out of 1232 [2025-03-15 00:03:56,958 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1226 places, 1214 transitions, 3188 flow. Second operand has 6 states, 6 states have (on average 1062.5) internal successors, (6375), 6 states have internal predecessors, (6375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:03:56,958 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:03:56,958 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1059 of 1232 [2025-03-15 00:03:56,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:04:01,493 INFO L124 PetriNetUnfolderBase]: 4549/15168 cut-off events. [2025-03-15 00:04:01,493 INFO L125 PetriNetUnfolderBase]: For 7121/9951 co-relation queries the response was YES. [2025-03-15 00:04:01,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42678 conditions, 15168 events. 4549/15168 cut-off events. For 7121/9951 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 124094 event pairs, 3966 based on Foata normal form. 0/13321 useless extension candidates. Maximal degree in co-relation 40789. Up to 8530 conditions per place. [2025-03-15 00:04:01,601 INFO L140 encePairwiseOnDemand]: 1226/1232 looper letters, 157 selfloop transitions, 5 changer transitions 5/1213 dead transitions. [2025-03-15 00:04:01,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1230 places, 1213 transitions, 3508 flow [2025-03-15 00:04:01,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:04:01,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:04:01,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6518 transitions. [2025-03-15 00:04:01,611 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8817640692640693 [2025-03-15 00:04:01,612 INFO L298 CegarLoopForPetriNet]: 1226 programPoint places, 4 predicate places. [2025-03-15 00:04:01,612 INFO L471 AbstractCegarLoop]: Abstraction has has 1230 places, 1213 transitions, 3508 flow [2025-03-15 00:04:01,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1062.5) internal successors, (6375), 6 states have internal predecessors, (6375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:04:01,615 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:04:01,615 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 00:04:01,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-15 00:04:01,616 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-15 00:04:01,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:04:01,618 INFO L85 PathProgramCache]: Analyzing trace with hash -208347000, now seen corresponding path program 1 times [2025-03-15 00:04:01,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:04:01,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378180585] [2025-03-15 00:04:01,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:04:01,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:04:01,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:04:03,158 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-15 00:04:03,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:04:03,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378180585] [2025-03-15 00:04:03,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378180585] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:04:03,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:04:03,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:04:03,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265401800] [2025-03-15 00:04:03,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:04:03,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:04:03,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:04:03,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:04:03,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:04:03,163 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 1062 out of 1232 [2025-03-15 00:04:03,168 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1230 places, 1213 transitions, 3508 flow. Second operand has 6 states, 6 states have (on average 1065.8333333333333) internal successors, (6395), 6 states have internal predecessors, (6395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:04:03,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:04:03,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1062 of 1232 [2025-03-15 00:04:03,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:04:07,526 INFO L124 PetriNetUnfolderBase]: 4549/15167 cut-off events. [2025-03-15 00:04:07,526 INFO L125 PetriNetUnfolderBase]: For 10090/13870 co-relation queries the response was YES. [2025-03-15 00:04:07,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51205 conditions, 15167 events. 4549/15167 cut-off events. For 10090/13870 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 124164 event pairs, 3966 based on Foata normal form. 0/13321 useless extension candidates. Maximal degree in co-relation 49164. Up to 8529 conditions per place. [2025-03-15 00:04:07,620 INFO L140 encePairwiseOnDemand]: 1226/1232 looper letters, 153 selfloop transitions, 5 changer transitions 5/1212 dead transitions. [2025-03-15 00:04:07,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1234 places, 1212 transitions, 3818 flow [2025-03-15 00:04:07,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:04:07,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:04:07,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6532 transitions. [2025-03-15 00:04:07,629 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8836580086580087 [2025-03-15 00:04:07,631 INFO L298 CegarLoopForPetriNet]: 1226 programPoint places, 8 predicate places. [2025-03-15 00:04:07,631 INFO L471 AbstractCegarLoop]: Abstraction has has 1234 places, 1212 transitions, 3818 flow [2025-03-15 00:04:07,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1065.8333333333333) internal successors, (6395), 6 states have internal predecessors, (6395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:04:07,636 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:04:07,636 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 00:04:07,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-15 00:04:07,636 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-15 00:04:07,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:04:07,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1743456070, now seen corresponding path program 1 times [2025-03-15 00:04:07,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:04:07,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902236514] [2025-03-15 00:04:07,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:04:07,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:04:07,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:04:09,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:04:09,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:04:09,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902236514] [2025-03-15 00:04:09,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902236514] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:04:09,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:04:09,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:04:09,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680156660] [2025-03-15 00:04:09,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:04:09,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:04:09,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:04:09,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:04:09,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:04:09,020 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 1062 out of 1232 [2025-03-15 00:04:09,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1234 places, 1212 transitions, 3818 flow. Second operand has 6 states, 6 states have (on average 1066.8333333333333) internal successors, (6401), 6 states have internal predecessors, (6401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:04:09,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:04:09,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1062 of 1232 [2025-03-15 00:04:09,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:04:13,672 INFO L124 PetriNetUnfolderBase]: 4549/15166 cut-off events. [2025-03-15 00:04:13,673 INFO L125 PetriNetUnfolderBase]: For 13964/18694 co-relation queries the response was YES. [2025-03-15 00:04:13,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59730 conditions, 15166 events. 4549/15166 cut-off events. For 13964/18694 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 124242 event pairs, 3966 based on Foata normal form. 0/13321 useless extension candidates. Maximal degree in co-relation 57539. Up to 8528 conditions per place. [2025-03-15 00:04:13,794 INFO L140 encePairwiseOnDemand]: 1226/1232 looper letters, 152 selfloop transitions, 5 changer transitions 5/1211 dead transitions. [2025-03-15 00:04:13,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1238 places, 1211 transitions, 4124 flow [2025-03-15 00:04:13,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:04:13,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:04:13,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6531 transitions. [2025-03-15 00:04:13,801 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8835227272727273 [2025-03-15 00:04:13,802 INFO L298 CegarLoopForPetriNet]: 1226 programPoint places, 12 predicate places. [2025-03-15 00:04:13,802 INFO L471 AbstractCegarLoop]: Abstraction has has 1238 places, 1211 transitions, 4124 flow [2025-03-15 00:04:13,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1066.8333333333333) internal successors, (6401), 6 states have internal predecessors, (6401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:04:13,804 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:04:13,804 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 00:04:13,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-15 00:04:13,804 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-15 00:04:13,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:04:13,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1138334182, now seen corresponding path program 1 times [2025-03-15 00:04:13,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:04:13,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531986464] [2025-03-15 00:04:13,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:04:13,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:04:13,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:04:14,001 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-15 00:04:14,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:04:14,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531986464] [2025-03-15 00:04:14,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531986464] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:04:14,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:04:14,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:04:14,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027427054] [2025-03-15 00:04:14,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:04:14,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:04:14,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:04:14,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:04:14,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:04:14,005 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 1205 out of 1232 [2025-03-15 00:04:14,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1238 places, 1211 transitions, 4124 flow. Second operand has 3 states, 3 states have (on average 1207.0) internal successors, (3621), 3 states have internal predecessors, (3621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:04:14,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:04:14,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1205 of 1232 [2025-03-15 00:04:14,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:04:19,021 INFO L124 PetriNetUnfolderBase]: 4695/16209 cut-off events. [2025-03-15 00:04:19,022 INFO L125 PetriNetUnfolderBase]: For 23683/35251 co-relation queries the response was YES. [2025-03-15 00:04:19,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64951 conditions, 16209 events. 4695/16209 cut-off events. For 23683/35251 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 138679 event pairs, 3979 based on Foata normal form. 97/14317 useless extension candidates. Maximal degree in co-relation 62656. Up to 9014 conditions per place. [2025-03-15 00:04:19,137 INFO L140 encePairwiseOnDemand]: 1227/1232 looper letters, 24 selfloop transitions, 4 changer transitions 6/1222 dead transitions. [2025-03-15 00:04:19,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1240 places, 1222 transitions, 4309 flow [2025-03-15 00:04:19,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:04:19,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:04:19,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3646 transitions. [2025-03-15 00:04:19,141 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9864718614718615 [2025-03-15 00:04:19,142 INFO L298 CegarLoopForPetriNet]: 1226 programPoint places, 14 predicate places. [2025-03-15 00:04:19,142 INFO L471 AbstractCegarLoop]: Abstraction has has 1240 places, 1222 transitions, 4309 flow [2025-03-15 00:04:19,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1207.0) internal successors, (3621), 3 states have internal predecessors, (3621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:04:19,143 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:04:19,143 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 00:04:19,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-15 00:04:19,143 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-15 00:04:19,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:04:19,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1474722849, now seen corresponding path program 1 times [2025-03-15 00:04:19,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:04:19,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723885475] [2025-03-15 00:04:19,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:04:19,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:04:19,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:04:19,329 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-15 00:04:19,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:04:19,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723885475] [2025-03-15 00:04:19,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723885475] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:04:19,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:04:19,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:04:19,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780751472] [2025-03-15 00:04:19,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:04:19,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:04:19,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:04:19,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:04:19,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:04:19,334 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 1205 out of 1232 [2025-03-15 00:04:19,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1240 places, 1222 transitions, 4309 flow. Second operand has 3 states, 3 states have (on average 1207.3333333333333) internal successors, (3622), 3 states have internal predecessors, (3622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:04:19,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:04:19,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1205 of 1232 [2025-03-15 00:04:19,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:04:24,019 INFO L124 PetriNetUnfolderBase]: 4881/16741 cut-off events. [2025-03-15 00:04:24,019 INFO L125 PetriNetUnfolderBase]: For 38287/53633 co-relation queries the response was YES. [2025-03-15 00:04:24,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69358 conditions, 16741 events. 4881/16741 cut-off events. For 38287/53633 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 147394 event pairs, 3762 based on Foata normal form. 269/15019 useless extension candidates. Maximal degree in co-relation 66951. Up to 9503 conditions per place. [2025-03-15 00:04:24,158 INFO L140 encePairwiseOnDemand]: 1227/1232 looper letters, 31 selfloop transitions, 4 changer transitions 8/1236 dead transitions. [2025-03-15 00:04:24,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1242 places, 1236 transitions, 4581 flow [2025-03-15 00:04:24,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:04:24,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:04:24,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3645 transitions. [2025-03-15 00:04:24,164 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9862012987012987 [2025-03-15 00:04:24,165 INFO L298 CegarLoopForPetriNet]: 1226 programPoint places, 16 predicate places. [2025-03-15 00:04:24,165 INFO L471 AbstractCegarLoop]: Abstraction has has 1242 places, 1236 transitions, 4581 flow [2025-03-15 00:04:24,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1207.3333333333333) internal successors, (3622), 3 states have internal predecessors, (3622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:04:24,166 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:04:24,166 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 00:04:24,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-15 00:04:24,166 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-15 00:04:24,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:04:24,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1194486385, now seen corresponding path program 1 times [2025-03-15 00:04:24,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:04:24,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438111053] [2025-03-15 00:04:24,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:04:24,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:04:24,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:04:24,452 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-15 00:04:24,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:04:24,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438111053] [2025-03-15 00:04:24,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438111053] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:04:24,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:04:24,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 00:04:24,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373925538] [2025-03-15 00:04:24,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:04:24,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:04:24,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:04:24,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:04:24,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:04:24,457 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 1204 out of 1232 [2025-03-15 00:04:24,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1242 places, 1236 transitions, 4581 flow. Second operand has 3 states, 3 states have (on average 1205.6666666666667) internal successors, (3617), 3 states have internal predecessors, (3617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:04:24,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:04:24,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1204 of 1232 [2025-03-15 00:04:24,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:04:30,951 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2676] L1027-4-->L1039-2: Formula: (and (= |v_t2Thread1of1ForFork1_#t~ret74#1_1| 0) (= (store |v_#pthreadsMutex_40| |v_~#m~0.base_26| (store (select |v_#pthreadsMutex_40| |v_~#m~0.base_26|) |v_~#m~0.offset_26| 0)) |v_#pthreadsMutex_39|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_40|, ~#m~0.base=|v_~#m~0.base_26|, ~#m~0.offset=|v_~#m~0.offset_26|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_39|, ~#m~0.base=|v_~#m~0.base_26|, t2Thread1of1ForFork1_#t~ret74#1=|v_t2Thread1of1ForFork1_#t~ret74#1_1|, ~#m~0.offset=|v_~#m~0.offset_26|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~ret74#1][1016], [1259#true, 649#L1015-1true, 1268#true, 1229#true, 1241#true, t2Thread1of1ForFork1InUse, t1Thread1of1ForFork0InUse, 1232#true, 1273#(= 0 |t1Thread1of1ForFork0_~i~0#1|), 1253#true, 813#L1039-2true, 1247#true, 1265#true, 1235#true, 1082#L1053-4true]) [2025-03-15 00:04:30,951 INFO L294 olderBase$Statistics]: this new event has 1102 ancestors and is cut-off event [2025-03-15 00:04:30,952 INFO L297 olderBase$Statistics]: existing Event has 1093 ancestors and is cut-off event [2025-03-15 00:04:30,952 INFO L297 olderBase$Statistics]: existing Event has 996 ancestors and is cut-off event [2025-03-15 00:04:30,952 INFO L297 olderBase$Statistics]: existing Event has 1026 ancestors and is cut-off event [2025-03-15 00:04:33,641 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2697] L1037-2-->L1037-3: Formula: (= |v_#race~enqueue_flag~0_10| |v_t2Thread1of1ForFork1_#t~nondet73#1_3|) InVars {t2Thread1of1ForFork1_#t~nondet73#1=|v_t2Thread1of1ForFork1_#t~nondet73#1_3|} OutVars{t2Thread1of1ForFork1_#t~nondet73#1=|v_t2Thread1of1ForFork1_#t~nondet73#1_3|, #race~enqueue_flag~0=|v_#race~enqueue_flag~0_10|} AuxVars[] AssignedVars[#race~enqueue_flag~0][978], [1259#true, 1268#true, 1229#true, 1005#L1017-4true, 1241#true, 1271#true, t2Thread1of1ForFork1InUse, 286#L1037-3true, t1Thread1of1ForFork0InUse, 1232#true, 1253#true, 1247#true, 1265#true, 1235#true, 1082#L1053-4true]) [2025-03-15 00:04:33,641 INFO L294 olderBase$Statistics]: this new event has 1180 ancestors and is cut-off event [2025-03-15 00:04:33,641 INFO L297 olderBase$Statistics]: existing Event has 1038 ancestors and is cut-off event [2025-03-15 00:04:33,641 INFO L297 olderBase$Statistics]: existing Event has 1105 ancestors and is cut-off event [2025-03-15 00:04:33,641 INFO L297 olderBase$Statistics]: existing Event has 1008 ancestors and is cut-off event [2025-03-15 00:04:33,641 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2697] L1037-2-->L1037-3: Formula: (= |v_#race~enqueue_flag~0_10| |v_t2Thread1of1ForFork1_#t~nondet73#1_3|) InVars {t2Thread1of1ForFork1_#t~nondet73#1=|v_t2Thread1of1ForFork1_#t~nondet73#1_3|} OutVars{t2Thread1of1ForFork1_#t~nondet73#1=|v_t2Thread1of1ForFork1_#t~nondet73#1_3|, #race~enqueue_flag~0=|v_#race~enqueue_flag~0_10|} AuxVars[] AssignedVars[#race~enqueue_flag~0][978], [1259#true, 1268#true, 1229#true, 1241#true, 1271#true, t2Thread1of1ForFork1InUse, 286#L1037-3true, t1Thread1of1ForFork0InUse, 1232#true, 937#t1Err10ASSERT_VIOLATIONDATA_RACEtrue, 1253#true, 1247#true, 1265#true, 1235#true, 1082#L1053-4true]) [2025-03-15 00:04:33,641 INFO L294 olderBase$Statistics]: this new event has 1180 ancestors and is cut-off event [2025-03-15 00:04:33,641 INFO L297 olderBase$Statistics]: existing Event has 1038 ancestors and is cut-off event [2025-03-15 00:04:33,641 INFO L297 olderBase$Statistics]: existing Event has 1105 ancestors and is cut-off event [2025-03-15 00:04:33,641 INFO L297 olderBase$Statistics]: existing Event has 1008 ancestors and is cut-off event [2025-03-15 00:04:33,642 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2697] L1037-2-->L1037-3: Formula: (= |v_#race~enqueue_flag~0_10| |v_t2Thread1of1ForFork1_#t~nondet73#1_3|) InVars {t2Thread1of1ForFork1_#t~nondet73#1=|v_t2Thread1of1ForFork1_#t~nondet73#1_3|} OutVars{t2Thread1of1ForFork1_#t~nondet73#1=|v_t2Thread1of1ForFork1_#t~nondet73#1_3|, #race~enqueue_flag~0=|v_#race~enqueue_flag~0_10|} AuxVars[] AssignedVars[#race~enqueue_flag~0][978], [1259#true, 1034#L1017-3true, 1268#true, 1229#true, 1241#true, 1271#true, 286#L1037-3true, t2Thread1of1ForFork1InUse, t1Thread1of1ForFork0InUse, 1232#true, 1253#true, 1247#true, 1265#true, 1235#true, 1082#L1053-4true]) [2025-03-15 00:04:33,642 INFO L294 olderBase$Statistics]: this new event has 1179 ancestors and is cut-off event [2025-03-15 00:04:33,642 INFO L297 olderBase$Statistics]: existing Event has 1007 ancestors and is cut-off event [2025-03-15 00:04:33,642 INFO L297 olderBase$Statistics]: existing Event has 1104 ancestors and is cut-off event [2025-03-15 00:04:33,642 INFO L297 olderBase$Statistics]: existing Event has 1037 ancestors and is cut-off event [2025-03-15 00:04:33,646 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2556] L1017-2-->L1017-3: Formula: (= |v_t1Thread1of1ForFork0_#t~nondet64#1_3| |v_#race~enqueue_flag~0_4|) InVars {t1Thread1of1ForFork0_#t~nondet64#1=|v_t1Thread1of1ForFork0_#t~nondet64#1_3|} OutVars{#race~enqueue_flag~0=|v_#race~enqueue_flag~0_4|, t1Thread1of1ForFork0_#t~nondet64#1=|v_t1Thread1of1ForFork0_#t~nondet64#1_3|} AuxVars[] AssignedVars[#race~enqueue_flag~0][1209], [1259#true, 1034#L1017-3true, 1268#true, 1229#true, 1241#true, 1271#true, t2Thread1of1ForFork1InUse, 286#L1037-3true, t1Thread1of1ForFork0InUse, 1232#true, 1253#true, 1247#true, 1265#true, 1235#true, 1082#L1053-4true]) [2025-03-15 00:04:33,646 INFO L294 olderBase$Statistics]: this new event has 1179 ancestors and is cut-off event [2025-03-15 00:04:33,646 INFO L297 olderBase$Statistics]: existing Event has 1104 ancestors and is cut-off event [2025-03-15 00:04:33,646 INFO L297 olderBase$Statistics]: existing Event has 1007 ancestors and is cut-off event [2025-03-15 00:04:33,646 INFO L297 olderBase$Statistics]: existing Event has 1037 ancestors and is cut-off event [2025-03-15 00:04:33,649 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2556] L1017-2-->L1017-3: Formula: (= |v_t1Thread1of1ForFork0_#t~nondet64#1_3| |v_#race~enqueue_flag~0_4|) InVars {t1Thread1of1ForFork0_#t~nondet64#1=|v_t1Thread1of1ForFork0_#t~nondet64#1_3|} OutVars{#race~enqueue_flag~0=|v_#race~enqueue_flag~0_4|, t1Thread1of1ForFork0_#t~nondet64#1=|v_t1Thread1of1ForFork0_#t~nondet64#1_3|} AuxVars[] AssignedVars[#race~enqueue_flag~0][1209], [1259#true, 1034#L1017-3true, 1268#true, 1229#true, 1241#true, 1271#true, t2Thread1of1ForFork1InUse, t1Thread1of1ForFork0InUse, 1232#true, 1253#true, 1247#true, 1265#true, 1235#true, 886#L1037-4true, 1082#L1053-4true]) [2025-03-15 00:04:33,649 INFO L294 olderBase$Statistics]: this new event has 1180 ancestors and is cut-off event [2025-03-15 00:04:33,649 INFO L297 olderBase$Statistics]: existing Event has 1038 ancestors and is cut-off event [2025-03-15 00:04:33,649 INFO L297 olderBase$Statistics]: existing Event has 1105 ancestors and is cut-off event [2025-03-15 00:04:33,649 INFO L297 olderBase$Statistics]: existing Event has 1008 ancestors and is cut-off event [2025-03-15 00:04:33,650 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2556] L1017-2-->L1017-3: Formula: (= |v_t1Thread1of1ForFork0_#t~nondet64#1_3| |v_#race~enqueue_flag~0_4|) InVars {t1Thread1of1ForFork0_#t~nondet64#1=|v_t1Thread1of1ForFork0_#t~nondet64#1_3|} OutVars{#race~enqueue_flag~0=|v_#race~enqueue_flag~0_4|, t1Thread1of1ForFork0_#t~nondet64#1=|v_t1Thread1of1ForFork0_#t~nondet64#1_3|} AuxVars[] AssignedVars[#race~enqueue_flag~0][1209], [1259#true, 1034#L1017-3true, 1268#true, 1229#true, 1241#true, 1271#true, t2Thread1of1ForFork1InUse, t1Thread1of1ForFork0InUse, 1232#true, 1253#true, 1247#true, 1265#true, 1235#true, 940#t2Err13ASSERT_VIOLATIONDATA_RACEtrue, 1082#L1053-4true]) [2025-03-15 00:04:33,650 INFO L294 olderBase$Statistics]: this new event has 1180 ancestors and is cut-off event [2025-03-15 00:04:33,650 INFO L297 olderBase$Statistics]: existing Event has 1038 ancestors and is cut-off event [2025-03-15 00:04:33,650 INFO L297 olderBase$Statistics]: existing Event has 1008 ancestors and is cut-off event [2025-03-15 00:04:33,650 INFO L297 olderBase$Statistics]: existing Event has 1105 ancestors and is cut-off event [2025-03-15 00:04:33,652 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2567] L1018-2-->L1018-3: Formula: (= |v_t1Thread1of1ForFork0_#t~nondet65#1_3| |v_#race~dequeue_flag~0_4|) InVars {t1Thread1of1ForFork0_#t~nondet65#1=|v_t1Thread1of1ForFork0_#t~nondet65#1_3|} OutVars{#race~dequeue_flag~0=|v_#race~dequeue_flag~0_4|, t1Thread1of1ForFork0_#t~nondet65#1=|v_t1Thread1of1ForFork0_#t~nondet65#1_3|} AuxVars[] AssignedVars[#race~dequeue_flag~0][1196], [1259#true, 1268#true, 1229#true, 1241#true, 1271#true, t2Thread1of1ForFork1InUse, 530#L1018-3true, t1Thread1of1ForFork0InUse, 1232#true, 1133#L1036-4true, 1253#true, 1247#true, 1265#true, 1235#true, 1082#L1053-4true]) [2025-03-15 00:04:33,652 INFO L294 olderBase$Statistics]: this new event has 1180 ancestors and is cut-off event [2025-03-15 00:04:33,652 INFO L297 olderBase$Statistics]: existing Event has 1038 ancestors and is cut-off event [2025-03-15 00:04:33,652 INFO L297 olderBase$Statistics]: existing Event has 1105 ancestors and is cut-off event [2025-03-15 00:04:33,652 INFO L297 olderBase$Statistics]: existing Event has 1008 ancestors and is cut-off event [2025-03-15 00:04:33,652 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2567] L1018-2-->L1018-3: Formula: (= |v_t1Thread1of1ForFork0_#t~nondet65#1_3| |v_#race~dequeue_flag~0_4|) InVars {t1Thread1of1ForFork0_#t~nondet65#1=|v_t1Thread1of1ForFork0_#t~nondet65#1_3|} OutVars{#race~dequeue_flag~0=|v_#race~dequeue_flag~0_4|, t1Thread1of1ForFork0_#t~nondet65#1=|v_t1Thread1of1ForFork0_#t~nondet65#1_3|} AuxVars[] AssignedVars[#race~dequeue_flag~0][1196], [1259#true, 1268#true, 1229#true, 1241#true, 1271#true, t2Thread1of1ForFork1InUse, t1Thread1of1ForFork0InUse, 530#L1018-3true, 1232#true, 1253#true, 1247#true, 1265#true, 1235#true, 1172#L1036-3true, 1082#L1053-4true]) [2025-03-15 00:04:33,652 INFO L294 olderBase$Statistics]: this new event has 1179 ancestors and is cut-off event [2025-03-15 00:04:33,652 INFO L297 olderBase$Statistics]: existing Event has 1104 ancestors and is cut-off event [2025-03-15 00:04:33,652 INFO L297 olderBase$Statistics]: existing Event has 1007 ancestors and is cut-off event [2025-03-15 00:04:33,652 INFO L297 olderBase$Statistics]: existing Event has 1037 ancestors and is cut-off event [2025-03-15 00:04:33,652 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2567] L1018-2-->L1018-3: Formula: (= |v_t1Thread1of1ForFork0_#t~nondet65#1_3| |v_#race~dequeue_flag~0_4|) InVars {t1Thread1of1ForFork0_#t~nondet65#1=|v_t1Thread1of1ForFork0_#t~nondet65#1_3|} OutVars{#race~dequeue_flag~0=|v_#race~dequeue_flag~0_4|, t1Thread1of1ForFork0_#t~nondet65#1=|v_t1Thread1of1ForFork0_#t~nondet65#1_3|} AuxVars[] AssignedVars[#race~dequeue_flag~0][1196], [1259#true, 1268#true, 1229#true, 1241#true, 1271#true, t2Thread1of1ForFork1InUse, 530#L1018-3true, t1Thread1of1ForFork0InUse, 1232#true, 1253#true, 1247#true, 1265#true, 507#t2Err12ASSERT_VIOLATIONDATA_RACEtrue, 1235#true, 1082#L1053-4true]) [2025-03-15 00:04:33,652 INFO L294 olderBase$Statistics]: this new event has 1180 ancestors and is cut-off event [2025-03-15 00:04:33,652 INFO L297 olderBase$Statistics]: existing Event has 1038 ancestors and is cut-off event [2025-03-15 00:04:33,652 INFO L297 olderBase$Statistics]: existing Event has 1105 ancestors and is cut-off event [2025-03-15 00:04:33,653 INFO L297 olderBase$Statistics]: existing Event has 1008 ancestors and is cut-off event [2025-03-15 00:04:33,655 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2676] L1027-4-->L1039-2: Formula: (and (= |v_t2Thread1of1ForFork1_#t~ret74#1_1| 0) (= (store |v_#pthreadsMutex_40| |v_~#m~0.base_26| (store (select |v_#pthreadsMutex_40| |v_~#m~0.base_26|) |v_~#m~0.offset_26| 0)) |v_#pthreadsMutex_39|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_40|, ~#m~0.base=|v_~#m~0.base_26|, ~#m~0.offset=|v_~#m~0.offset_26|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_39|, ~#m~0.base=|v_~#m~0.base_26|, t2Thread1of1ForFork1_#t~ret74#1=|v_t2Thread1of1ForFork1_#t~ret74#1_1|, ~#m~0.offset=|v_~#m~0.offset_26|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~ret74#1][990], [1259#true, 1268#true, 1229#true, 1271#true, 1241#true, t2Thread1of1ForFork1InUse, t1Thread1of1ForFork0InUse, 1232#true, 410#L1011-4true, 1253#true, 813#L1039-2true, 1247#true, 1265#true, 1235#true, 1082#L1053-4true]) [2025-03-15 00:04:33,655 INFO L294 olderBase$Statistics]: this new event has 1177 ancestors and is cut-off event [2025-03-15 00:04:33,655 INFO L297 olderBase$Statistics]: existing Event has 1035 ancestors and is cut-off event [2025-03-15 00:04:33,655 INFO L297 olderBase$Statistics]: existing Event has 1005 ancestors and is cut-off event [2025-03-15 00:04:33,656 INFO L297 olderBase$Statistics]: existing Event has 1102 ancestors and is cut-off event [2025-03-15 00:04:33,656 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2676] L1027-4-->L1039-2: Formula: (and (= |v_t2Thread1of1ForFork1_#t~ret74#1_1| 0) (= (store |v_#pthreadsMutex_40| |v_~#m~0.base_26| (store (select |v_#pthreadsMutex_40| |v_~#m~0.base_26|) |v_~#m~0.offset_26| 0)) |v_#pthreadsMutex_39|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_40|, ~#m~0.base=|v_~#m~0.base_26|, ~#m~0.offset=|v_~#m~0.offset_26|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_39|, ~#m~0.base=|v_~#m~0.base_26|, t2Thread1of1ForFork1_#t~ret74#1=|v_t2Thread1of1ForFork1_#t~ret74#1_1|, ~#m~0.offset=|v_~#m~0.offset_26|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~ret74#1][990], [1259#true, 1268#true, 1229#true, 1241#true, 1271#true, t2Thread1of1ForFork1InUse, t1Thread1of1ForFork0InUse, 1232#true, 1253#true, 627#L1017true, 813#L1039-2true, 1247#true, 1265#true, 1235#true, 1082#L1053-4true]) [2025-03-15 00:04:33,656 INFO L294 olderBase$Statistics]: this new event has 1179 ancestors and is cut-off event [2025-03-15 00:04:33,656 INFO L297 olderBase$Statistics]: existing Event has 1037 ancestors and is cut-off event [2025-03-15 00:04:33,656 INFO L297 olderBase$Statistics]: existing Event has 1007 ancestors and is cut-off event [2025-03-15 00:04:33,656 INFO L297 olderBase$Statistics]: existing Event has 1104 ancestors and is cut-off event [2025-03-15 00:04:33,656 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2676] L1027-4-->L1039-2: Formula: (and (= |v_t2Thread1of1ForFork1_#t~ret74#1_1| 0) (= (store |v_#pthreadsMutex_40| |v_~#m~0.base_26| (store (select |v_#pthreadsMutex_40| |v_~#m~0.base_26|) |v_~#m~0.offset_26| 0)) |v_#pthreadsMutex_39|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_40|, ~#m~0.base=|v_~#m~0.base_26|, ~#m~0.offset=|v_~#m~0.offset_26|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_39|, ~#m~0.base=|v_~#m~0.base_26|, t2Thread1of1ForFork1_#t~ret74#1=|v_t2Thread1of1ForFork1_#t~ret74#1_1|, ~#m~0.offset=|v_~#m~0.offset_26|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~ret74#1][990], [1259#true, 570#L1013true, 1268#true, 1229#true, 1241#true, 1271#true, t2Thread1of1ForFork1InUse, t1Thread1of1ForFork0InUse, 1232#true, 1253#true, 813#L1039-2true, 1247#true, 1265#true, 1235#true, 1082#L1053-4true]) [2025-03-15 00:04:33,656 INFO L294 olderBase$Statistics]: this new event has 1179 ancestors and is cut-off event [2025-03-15 00:04:33,656 INFO L297 olderBase$Statistics]: existing Event has 1037 ancestors and is cut-off event [2025-03-15 00:04:33,656 INFO L297 olderBase$Statistics]: existing Event has 1007 ancestors and is cut-off event [2025-03-15 00:04:33,656 INFO L297 olderBase$Statistics]: existing Event has 1104 ancestors and is cut-off event [2025-03-15 00:04:33,658 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2686] L1036-2-->L1036-3: Formula: (= |v_#race~dequeue_flag~0_11| |v_t2Thread1of1ForFork1_#t~nondet72#1_3|) InVars {t2Thread1of1ForFork1_#t~nondet72#1=|v_t2Thread1of1ForFork1_#t~nondet72#1_3|} OutVars{#race~dequeue_flag~0=|v_#race~dequeue_flag~0_11|, t2Thread1of1ForFork1_#t~nondet72#1=|v_t2Thread1of1ForFork1_#t~nondet72#1_3|} AuxVars[] AssignedVars[#race~dequeue_flag~0][1230], [1259#true, 1268#true, 1229#true, 1241#true, 1271#true, t2Thread1of1ForFork1InUse, 530#L1018-3true, t1Thread1of1ForFork0InUse, 1232#true, 1253#true, 1247#true, 1265#true, 1235#true, 1172#L1036-3true, 1082#L1053-4true]) [2025-03-15 00:04:33,658 INFO L294 olderBase$Statistics]: this new event has 1179 ancestors and is cut-off event [2025-03-15 00:04:33,658 INFO L297 olderBase$Statistics]: existing Event has 1104 ancestors and is cut-off event [2025-03-15 00:04:33,658 INFO L297 olderBase$Statistics]: existing Event has 1037 ancestors and is cut-off event [2025-03-15 00:04:33,658 INFO L297 olderBase$Statistics]: existing Event has 1007 ancestors and is cut-off event [2025-03-15 00:04:33,659 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2686] L1036-2-->L1036-3: Formula: (= |v_#race~dequeue_flag~0_11| |v_t2Thread1of1ForFork1_#t~nondet72#1_3|) InVars {t2Thread1of1ForFork1_#t~nondet72#1=|v_t2Thread1of1ForFork1_#t~nondet72#1_3|} OutVars{#race~dequeue_flag~0=|v_#race~dequeue_flag~0_11|, t2Thread1of1ForFork1_#t~nondet72#1=|v_t2Thread1of1ForFork1_#t~nondet72#1_3|} AuxVars[] AssignedVars[#race~dequeue_flag~0][1230], [1259#true, 1268#true, 1229#true, 1241#true, 1271#true, t2Thread1of1ForFork1InUse, t1Thread1of1ForFork0InUse, 1232#true, 1253#true, 1247#true, 1265#true, 704#t1Err11ASSERT_VIOLATIONDATA_RACEtrue, 1235#true, 1172#L1036-3true, 1082#L1053-4true]) [2025-03-15 00:04:33,659 INFO L294 olderBase$Statistics]: this new event has 1180 ancestors and is cut-off event [2025-03-15 00:04:33,659 INFO L297 olderBase$Statistics]: existing Event has 1105 ancestors and is cut-off event [2025-03-15 00:04:33,659 INFO L297 olderBase$Statistics]: existing Event has 1038 ancestors and is cut-off event [2025-03-15 00:04:33,659 INFO L297 olderBase$Statistics]: existing Event has 1008 ancestors and is cut-off event [2025-03-15 00:04:33,660 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2686] L1036-2-->L1036-3: Formula: (= |v_#race~dequeue_flag~0_11| |v_t2Thread1of1ForFork1_#t~nondet72#1_3|) InVars {t2Thread1of1ForFork1_#t~nondet72#1=|v_t2Thread1of1ForFork1_#t~nondet72#1_3|} OutVars{#race~dequeue_flag~0=|v_#race~dequeue_flag~0_11|, t2Thread1of1ForFork1_#t~nondet72#1=|v_t2Thread1of1ForFork1_#t~nondet72#1_3|} AuxVars[] AssignedVars[#race~dequeue_flag~0][1230], [910#L1018-4true, 1259#true, 1268#true, 1229#true, 1241#true, 1271#true, t2Thread1of1ForFork1InUse, t1Thread1of1ForFork0InUse, 1232#true, 1253#true, 1247#true, 1265#true, 1235#true, 1172#L1036-3true, 1082#L1053-4true]) [2025-03-15 00:04:33,660 INFO L294 olderBase$Statistics]: this new event has 1180 ancestors and is cut-off event [2025-03-15 00:04:33,660 INFO L297 olderBase$Statistics]: existing Event has 1105 ancestors and is cut-off event [2025-03-15 00:04:33,660 INFO L297 olderBase$Statistics]: existing Event has 1038 ancestors and is cut-off event [2025-03-15 00:04:33,660 INFO L297 olderBase$Statistics]: existing Event has 1008 ancestors and is cut-off event [2025-03-15 00:04:33,661 INFO L124 PetriNetUnfolderBase]: 9086/30220 cut-off events. [2025-03-15 00:04:33,661 INFO L125 PetriNetUnfolderBase]: For 102998/130083 co-relation queries the response was YES. [2025-03-15 00:04:33,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129858 conditions, 30220 events. 9086/30220 cut-off events. For 102998/130083 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 287514 event pairs, 7287 based on Foata normal form. 787/27207 useless extension candidates. Maximal degree in co-relation 126148. Up to 17598 conditions per place. [2025-03-15 00:04:33,910 INFO L140 encePairwiseOnDemand]: 1229/1232 looper letters, 45 selfloop transitions, 2 changer transitions 8/1251 dead transitions. [2025-03-15 00:04:33,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1244 places, 1251 transitions, 4866 flow [2025-03-15 00:04:33,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:04:33,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:04:33,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3647 transitions. [2025-03-15 00:04:33,914 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9867424242424242 [2025-03-15 00:04:33,915 INFO L298 CegarLoopForPetriNet]: 1226 programPoint places, 18 predicate places. [2025-03-15 00:04:33,915 INFO L471 AbstractCegarLoop]: Abstraction has has 1244 places, 1251 transitions, 4866 flow [2025-03-15 00:04:33,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1205.6666666666667) internal successors, (3617), 3 states have internal predecessors, (3617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:04:33,916 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:04:33,916 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 00:04:33,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-15 00:04:33,916 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err12ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-15 00:04:33,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:04:33,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1142365514, now seen corresponding path program 1 times [2025-03-15 00:04:33,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:04:33,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131745171] [2025-03-15 00:04:33,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:04:33,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:04:33,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:04:34,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:04:34,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:04:34,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131745171] [2025-03-15 00:04:34,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131745171] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:04:34,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:04:34,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 00:04:34,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535301786] [2025-03-15 00:04:34,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:04:34,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:04:34,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:04:34,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:04:34,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:04:34,136 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 1204 out of 1232 [2025-03-15 00:04:34,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1244 places, 1251 transitions, 4866 flow. Second operand has 3 states, 3 states have (on average 1206.0) internal successors, (3618), 3 states have internal predecessors, (3618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:04:34,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:04:34,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1204 of 1232 [2025-03-15 00:04:34,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:04:51,540 INFO L124 PetriNetUnfolderBase]: 16871/53702 cut-off events. [2025-03-15 00:04:51,541 INFO L125 PetriNetUnfolderBase]: For 168787/197297 co-relation queries the response was YES. [2025-03-15 00:04:51,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 238522 conditions, 53702 events. 16871/53702 cut-off events. For 168787/197297 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 571708 event pairs, 14326 based on Foata normal form. 1148/47904 useless extension candidates. Maximal degree in co-relation 234673. Up to 32887 conditions per place. [2025-03-15 00:04:52,247 INFO L140 encePairwiseOnDemand]: 1229/1232 looper letters, 52 selfloop transitions, 2 changer transitions 8/1268 dead transitions. [2025-03-15 00:04:52,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1246 places, 1268 transitions, 5225 flow [2025-03-15 00:04:52,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:04:52,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:04:52,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3647 transitions. [2025-03-15 00:04:52,254 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9867424242424242 [2025-03-15 00:04:52,255 INFO L298 CegarLoopForPetriNet]: 1226 programPoint places, 20 predicate places. [2025-03-15 00:04:52,255 INFO L471 AbstractCegarLoop]: Abstraction has has 1246 places, 1268 transitions, 5225 flow [2025-03-15 00:04:52,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1206.0) internal successors, (3618), 3 states have internal predecessors, (3618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:04:52,260 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:04:52,261 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 00:04:52,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-15 00:04:52,262 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-15 00:04:52,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:04:52,264 INFO L85 PathProgramCache]: Analyzing trace with hash 2014635961, now seen corresponding path program 1 times [2025-03-15 00:04:52,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:04:52,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566979623] [2025-03-15 00:04:52,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:04:52,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:04:52,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:04:54,948 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-15 00:04:54,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:04:54,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566979623] [2025-03-15 00:04:54,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566979623] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:04:54,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:04:54,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:04:54,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16547698] [2025-03-15 00:04:54,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:04:54,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:04:54,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:04:54,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:04:54,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:04:54,959 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 1056 out of 1232 [2025-03-15 00:04:54,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1246 places, 1268 transitions, 5225 flow. Second operand has 6 states, 6 states have (on average 1061.8333333333333) internal successors, (6371), 6 states have internal predecessors, (6371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:04:54,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:04:54,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1056 of 1232 [2025-03-15 00:04:54,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:05:19,396 INFO L124 PetriNetUnfolderBase]: 24572/71175 cut-off events. [2025-03-15 00:05:19,397 INFO L125 PetriNetUnfolderBase]: For 229349/263830 co-relation queries the response was YES. [2025-03-15 00:05:19,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 360847 conditions, 71175 events. 24572/71175 cut-off events. For 229349/263830 co-relation queries the response was YES. Maximal size of possible extension queue 508. Compared 760208 event pairs, 11917 based on Foata normal form. 615/63451 useless extension candidates. Maximal degree in co-relation 356506. Up to 43860 conditions per place. [2025-03-15 00:05:20,318 INFO L140 encePairwiseOnDemand]: 1199/1232 looper letters, 484 selfloop transitions, 66 changer transitions 8/1619 dead transitions. [2025-03-15 00:05:20,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1251 places, 1619 transitions, 11105 flow [2025-03-15 00:05:20,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:05:20,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:05:20,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6802 transitions. [2025-03-15 00:05:20,326 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9201839826839827 [2025-03-15 00:05:20,326 INFO L298 CegarLoopForPetriNet]: 1226 programPoint places, 25 predicate places. [2025-03-15 00:05:20,327 INFO L471 AbstractCegarLoop]: Abstraction has has 1251 places, 1619 transitions, 11105 flow [2025-03-15 00:05:20,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1061.8333333333333) internal successors, (6371), 6 states have internal predecessors, (6371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:05:20,328 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:05:20,329 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 00:05:20,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-15 00:05:20,329 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-15 00:05:20,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:05:20,331 INFO L85 PathProgramCache]: Analyzing trace with hash -2080808418, now seen corresponding path program 1 times [2025-03-15 00:05:20,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:05:20,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444176669] [2025-03-15 00:05:20,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:05:20,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:05:20,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:05:20,795 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-15 00:05:20,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:05:20,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444176669] [2025-03-15 00:05:20,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444176669] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:05:20,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:05:20,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 00:05:20,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706802870] [2025-03-15 00:05:20,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:05:20,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:05:20,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:05:20,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:05:20,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:05:20,799 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 1211 out of 1232 [2025-03-15 00:05:20,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1251 places, 1619 transitions, 11105 flow. Second operand has 3 states, 3 states have (on average 1213.0) internal successors, (3639), 3 states have internal predecessors, (3639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:05:20,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:05:20,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1211 of 1232 [2025-03-15 00:05:20,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:05:22,307 INFO L124 PetriNetUnfolderBase]: 1146/5335 cut-off events. [2025-03-15 00:05:22,308 INFO L125 PetriNetUnfolderBase]: For 87249/91316 co-relation queries the response was YES. [2025-03-15 00:05:22,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29737 conditions, 5335 events. 1146/5335 cut-off events. For 87249/91316 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 34947 event pairs, 177 based on Foata normal form. 275/5235 useless extension candidates. Maximal degree in co-relation 25222. Up to 2580 conditions per place. [2025-03-15 00:05:22,350 INFO L140 encePairwiseOnDemand]: 1228/1232 looper letters, 57 selfloop transitions, 3 changer transitions 12/1286 dead transitions. [2025-03-15 00:05:22,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1249 places, 1286 transitions, 6397 flow [2025-03-15 00:05:22,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:05:22,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:05:22,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3655 transitions. [2025-03-15 00:05:22,353 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9889069264069265 [2025-03-15 00:05:22,353 INFO L298 CegarLoopForPetriNet]: 1226 programPoint places, 23 predicate places. [2025-03-15 00:05:22,354 INFO L471 AbstractCegarLoop]: Abstraction has has 1249 places, 1286 transitions, 6397 flow [2025-03-15 00:05:22,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1213.0) internal successors, (3639), 3 states have internal predecessors, (3639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:05:22,354 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:05:22,355 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 00:05:22,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-15 00:05:22,355 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-15 00:05:22,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:05:22,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1711580675, now seen corresponding path program 1 times [2025-03-15 00:05:22,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:05:22,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880107314] [2025-03-15 00:05:22,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:05:22,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:05:22,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:05:23,922 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-15 00:05:23,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:05:23,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880107314] [2025-03-15 00:05:23,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880107314] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:05:23,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:05:23,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:05:23,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785628740] [2025-03-15 00:05:23,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:05:23,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:05:23,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:05:23,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:05:23,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:05:23,926 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 1053 out of 1232 [2025-03-15 00:05:23,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1249 places, 1286 transitions, 6397 flow. Second operand has 6 states, 6 states have (on average 1060.0) internal successors, (6360), 6 states have internal predecessors, (6360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:05:23,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:05:23,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1053 of 1232 [2025-03-15 00:05:23,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:05:25,906 INFO L124 PetriNetUnfolderBase]: 1158/5339 cut-off events. [2025-03-15 00:05:25,906 INFO L125 PetriNetUnfolderBase]: For 89657/93234 co-relation queries the response was YES. [2025-03-15 00:05:25,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32550 conditions, 5339 events. 1158/5339 cut-off events. For 89657/93234 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 34947 event pairs, 177 based on Foata normal form. 142/5114 useless extension candidates. Maximal degree in co-relation 27672. Up to 2623 conditions per place. [2025-03-15 00:05:25,956 INFO L140 encePairwiseOnDemand]: 1226/1232 looper letters, 239 selfloop transitions, 5 changer transitions 12/1309 dead transitions. [2025-03-15 00:05:25,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1253 places, 1309 transitions, 7583 flow [2025-03-15 00:05:25,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:05:25,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:05:25,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6494 transitions. [2025-03-15 00:05:25,959 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.878517316017316 [2025-03-15 00:05:25,960 INFO L298 CegarLoopForPetriNet]: 1226 programPoint places, 27 predicate places. [2025-03-15 00:05:25,960 INFO L471 AbstractCegarLoop]: Abstraction has has 1253 places, 1309 transitions, 7583 flow [2025-03-15 00:05:25,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1060.0) internal successors, (6360), 6 states have internal predecessors, (6360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:05:25,961 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:05:25,961 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 00:05:25,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-15 00:05:25,961 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-15 00:05:25,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:05:25,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1363698178, now seen corresponding path program 1 times [2025-03-15 00:05:25,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:05:25,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815772807] [2025-03-15 00:05:25,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:05:25,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:05:26,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:05:27,501 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-15 00:05:27,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:05:27,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815772807] [2025-03-15 00:05:27,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815772807] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:05:27,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:05:27,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:05:27,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024486233] [2025-03-15 00:05:27,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:05:27,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:05:27,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:05:27,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:05:27,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:05:27,506 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 1056 out of 1232 [2025-03-15 00:05:27,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1253 places, 1309 transitions, 7583 flow. Second operand has 6 states, 6 states have (on average 1063.8333333333333) internal successors, (6383), 6 states have internal predecessors, (6383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:05:27,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:05:27,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1056 of 1232 [2025-03-15 00:05:27,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:05:29,269 INFO L124 PetriNetUnfolderBase]: 1152/5325 cut-off events. [2025-03-15 00:05:29,269 INFO L125 PetriNetUnfolderBase]: For 95171/98730 co-relation queries the response was YES. [2025-03-15 00:05:29,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35047 conditions, 5325 events. 1152/5325 cut-off events. For 95171/98730 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 34926 event pairs, 177 based on Foata normal form. 142/5108 useless extension candidates. Maximal degree in co-relation 29916. Up to 2609 conditions per place. [2025-03-15 00:05:29,320 INFO L140 encePairwiseOnDemand]: 1226/1232 looper letters, 259 selfloop transitions, 5 changer transitions 12/1332 dead transitions. [2025-03-15 00:05:29,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1257 places, 1332 transitions, 8855 flow [2025-03-15 00:05:29,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:05:29,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:05:29,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6508 transitions. [2025-03-15 00:05:29,324 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8804112554112554 [2025-03-15 00:05:29,324 INFO L298 CegarLoopForPetriNet]: 1226 programPoint places, 31 predicate places. [2025-03-15 00:05:29,324 INFO L471 AbstractCegarLoop]: Abstraction has has 1257 places, 1332 transitions, 8855 flow [2025-03-15 00:05:29,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1063.8333333333333) internal successors, (6383), 6 states have internal predecessors, (6383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:05:29,325 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:05:29,325 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 00:05:29,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-15 00:05:29,325 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-15 00:05:29,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:05:29,328 INFO L85 PathProgramCache]: Analyzing trace with hash 121956743, now seen corresponding path program 1 times [2025-03-15 00:05:29,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:05:29,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789109580] [2025-03-15 00:05:29,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:05:29,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:05:29,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:05:30,958 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-15 00:05:30,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:05:30,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789109580] [2025-03-15 00:05:30,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789109580] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:05:30,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:05:30,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:05:30,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718682901] [2025-03-15 00:05:30,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:05:30,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:05:30,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:05:30,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:05:30,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:05:30,972 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 1054 out of 1232 [2025-03-15 00:05:30,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1257 places, 1332 transitions, 8855 flow. Second operand has 6 states, 6 states have (on average 1063.0) internal successors, (6378), 6 states have internal predecessors, (6378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:05:30,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:05:30,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1054 of 1232 [2025-03-15 00:05:30,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:05:33,382 INFO L124 PetriNetUnfolderBase]: 1158/5323 cut-off events. [2025-03-15 00:05:33,383 INFO L125 PetriNetUnfolderBase]: For 103920/107501 co-relation queries the response was YES. [2025-03-15 00:05:33,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37744 conditions, 5323 events. 1158/5323 cut-off events. For 103920/107501 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 34788 event pairs, 177 based on Foata normal form. 142/5114 useless extension candidates. Maximal degree in co-relation 32288. Up to 2607 conditions per place. [2025-03-15 00:05:33,437 INFO L140 encePairwiseOnDemand]: 1226/1232 looper letters, 284 selfloop transitions, 5 changer transitions 12/1355 dead transitions. [2025-03-15 00:05:33,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1261 places, 1355 transitions, 10223 flow [2025-03-15 00:05:33,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:05:33,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:05:33,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6497 transitions. [2025-03-15 00:05:33,441 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8789231601731602 [2025-03-15 00:05:33,442 INFO L298 CegarLoopForPetriNet]: 1226 programPoint places, 35 predicate places. [2025-03-15 00:05:33,442 INFO L471 AbstractCegarLoop]: Abstraction has has 1261 places, 1355 transitions, 10223 flow [2025-03-15 00:05:33,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1063.0) internal successors, (6378), 6 states have internal predecessors, (6378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:05:33,443 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:05:33,443 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 00:05:33,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-15 00:05:33,444 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-15 00:05:33,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:05:33,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1202686858, now seen corresponding path program 1 times [2025-03-15 00:05:33,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:05:33,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943673109] [2025-03-15 00:05:33,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:05:33,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:05:33,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:05:35,002 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-15 00:05:35,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:05:35,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943673109] [2025-03-15 00:05:35,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943673109] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:05:35,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:05:35,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:05:35,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679593342] [2025-03-15 00:05:35,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:05:35,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:05:35,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:05:35,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:05:35,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:05:35,006 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 1054 out of 1232 [2025-03-15 00:05:35,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1261 places, 1355 transitions, 10223 flow. Second operand has 6 states, 6 states have (on average 1065.0) internal successors, (6390), 6 states have internal predecessors, (6390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:05:35,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:05:35,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1054 of 1232 [2025-03-15 00:05:35,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:05:36,945 INFO L124 PetriNetUnfolderBase]: 1164/5321 cut-off events. [2025-03-15 00:05:36,945 INFO L125 PetriNetUnfolderBase]: For 113900/117503 co-relation queries the response was YES. [2025-03-15 00:05:36,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40437 conditions, 5321 events. 1164/5321 cut-off events. For 113900/117503 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 34701 event pairs, 177 based on Foata normal form. 142/5120 useless extension candidates. Maximal degree in co-relation 34656. Up to 2605 conditions per place. [2025-03-15 00:05:36,995 INFO L140 encePairwiseOnDemand]: 1226/1232 looper letters, 307 selfloop transitions, 5 changer transitions 12/1378 dead transitions. [2025-03-15 00:05:36,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1265 places, 1378 transitions, 11683 flow [2025-03-15 00:05:36,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:05:36,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:05:36,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6496 transitions. [2025-03-15 00:05:36,998 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8787878787878788 [2025-03-15 00:05:36,999 INFO L298 CegarLoopForPetriNet]: 1226 programPoint places, 39 predicate places. [2025-03-15 00:05:36,999 INFO L471 AbstractCegarLoop]: Abstraction has has 1265 places, 1378 transitions, 11683 flow [2025-03-15 00:05:36,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1065.0) internal successors, (6390), 6 states have internal predecessors, (6390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:05:37,000 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:05:37,000 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 00:05:37,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-15 00:05:37,000 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-15 00:05:37,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:05:37,003 INFO L85 PathProgramCache]: Analyzing trace with hash -505921988, now seen corresponding path program 1 times [2025-03-15 00:05:37,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:05:37,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598309309] [2025-03-15 00:05:37,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:05:37,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:05:37,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:05:38,612 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-15 00:05:38,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:05:38,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598309309] [2025-03-15 00:05:38,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598309309] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:05:38,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:05:38,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:05:38,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166693037] [2025-03-15 00:05:38,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:05:38,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:05:38,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:05:38,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:05:38,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:05:38,617 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 1054 out of 1232 [2025-03-15 00:05:38,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1265 places, 1378 transitions, 11683 flow. Second operand has 6 states, 6 states have (on average 1066.0) internal successors, (6396), 6 states have internal predecessors, (6396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:05:38,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:05:38,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1054 of 1232 [2025-03-15 00:05:38,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:05:40,460 INFO L124 PetriNetUnfolderBase]: 1164/5313 cut-off events. [2025-03-15 00:05:40,460 INFO L125 PetriNetUnfolderBase]: For 123343/126948 co-relation queries the response was YES. [2025-03-15 00:05:40,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43008 conditions, 5313 events. 1164/5313 cut-off events. For 123343/126948 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 34718 event pairs, 177 based on Foata normal form. 142/5120 useless extension candidates. Maximal degree in co-relation 36944. Up to 2597 conditions per place. [2025-03-15 00:05:40,514 INFO L140 encePairwiseOnDemand]: 1226/1232 looper letters, 330 selfloop transitions, 5 changer transitions 12/1401 dead transitions. [2025-03-15 00:05:40,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1269 places, 1401 transitions, 13235 flow [2025-03-15 00:05:40,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:05:40,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:05:40,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6495 transitions. [2025-03-15 00:05:40,518 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8786525974025974 [2025-03-15 00:05:40,518 INFO L298 CegarLoopForPetriNet]: 1226 programPoint places, 43 predicate places. [2025-03-15 00:05:40,518 INFO L471 AbstractCegarLoop]: Abstraction has has 1269 places, 1401 transitions, 13235 flow [2025-03-15 00:05:40,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1066.0) internal successors, (6396), 6 states have internal predecessors, (6396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:05:40,519 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:05:40,520 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 00:05:40,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-15 00:05:40,520 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-15 00:05:40,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:05:40,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1394261404, now seen corresponding path program 1 times [2025-03-15 00:05:40,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:05:40,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768335803] [2025-03-15 00:05:40,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:05:40,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:05:40,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:05:42,047 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-15 00:05:42,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:05:42,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768335803] [2025-03-15 00:05:42,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768335803] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:05:42,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:05:42,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:05:42,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353346911] [2025-03-15 00:05:42,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:05:42,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:05:42,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:05:42,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:05:42,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:05:42,050 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 656 out of 1232 [2025-03-15 00:05:42,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1269 places, 1401 transitions, 13235 flow. Second operand has 6 states, 6 states have (on average 734.0) internal successors, (4404), 6 states have internal predecessors, (4404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:05:42,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:05:42,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 656 of 1232 [2025-03-15 00:05:42,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:05:44,528 INFO L124 PetriNetUnfolderBase]: 1170/5311 cut-off events. [2025-03-15 00:05:44,528 INFO L125 PetriNetUnfolderBase]: For 136015/139659 co-relation queries the response was YES. [2025-03-15 00:05:44,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46052 conditions, 5311 events. 1170/5311 cut-off events. For 136015/139659 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 34775 event pairs, 177 based on Foata normal form. 142/5126 useless extension candidates. Maximal degree in co-relation 39277. Up to 2960 conditions per place. [2025-03-15 00:05:44,588 INFO L140 encePairwiseOnDemand]: 1226/1232 looper letters, 751 selfloop transitions, 9 changer transitions 12/1423 dead transitions. [2025-03-15 00:05:44,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1273 places, 1423 transitions, 15655 flow [2025-03-15 00:05:44,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:05:44,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:05:44,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4504 transitions. [2025-03-15 00:05:44,591 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6093073593073594 [2025-03-15 00:05:44,591 INFO L298 CegarLoopForPetriNet]: 1226 programPoint places, 47 predicate places. [2025-03-15 00:05:44,592 INFO L471 AbstractCegarLoop]: Abstraction has has 1273 places, 1423 transitions, 15655 flow [2025-03-15 00:05:44,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 734.0) internal successors, (4404), 6 states have internal predecessors, (4404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:05:44,592 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:05:44,593 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 00:05:44,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-15 00:05:44,593 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-15 00:05:44,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:05:44,596 INFO L85 PathProgramCache]: Analyzing trace with hash 2083521777, now seen corresponding path program 1 times [2025-03-15 00:05:44,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:05:44,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623595804] [2025-03-15 00:05:44,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:05:44,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:05:44,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:05:44,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:05:44,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:05:44,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623595804] [2025-03-15 00:05:44,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623595804] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 00:05:44,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1604522986] [2025-03-15 00:05:44,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:05:44,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 00:05:44,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:05:44,987 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 00:05:44,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-15 00:05:45,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:05:45,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 2145 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-15 00:05:45,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 00:05:45,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 00:05:45,374 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-15 00:05:45,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1604522986] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:05:45,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-15 00:05:45,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-15 00:05:45,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540054284] [2025-03-15 00:05:45,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:05:45,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:05:45,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:05:45,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:05:45,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:05:45,378 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 1203 out of 1232 [2025-03-15 00:05:45,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1273 places, 1423 transitions, 15655 flow. Second operand has 3 states, 3 states have (on average 1206.0) internal successors, (3618), 3 states have internal predecessors, (3618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:05:45,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:05:45,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1203 of 1232 [2025-03-15 00:05:45,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:05:47,538 INFO L124 PetriNetUnfolderBase]: 1173/5310 cut-off events. [2025-03-15 00:05:47,538 INFO L125 PetriNetUnfolderBase]: For 158834/162505 co-relation queries the response was YES. [2025-03-15 00:05:47,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47261 conditions, 5310 events. 1173/5310 cut-off events. For 158834/162505 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 34845 event pairs, 171 based on Foata normal form. 142/5129 useless extension candidates. Maximal degree in co-relation 40294. Up to 2963 conditions per place. [2025-03-15 00:05:47,599 INFO L140 encePairwiseOnDemand]: 1229/1232 looper letters, 209 selfloop transitions, 2 changer transitions 12/1425 dead transitions. [2025-03-15 00:05:47,600 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1274 places, 1425 transitions, 16210 flow [2025-03-15 00:05:47,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:05:47,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:05:47,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3632 transitions. [2025-03-15 00:05:47,602 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9826839826839827 [2025-03-15 00:05:47,602 INFO L298 CegarLoopForPetriNet]: 1226 programPoint places, 48 predicate places. [2025-03-15 00:05:47,602 INFO L471 AbstractCegarLoop]: Abstraction has has 1274 places, 1425 transitions, 16210 flow [2025-03-15 00:05:47,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1206.0) internal successors, (3618), 3 states have internal predecessors, (3618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:05:47,603 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:05:47,603 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 00:05:47,615 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-15 00:05:47,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 00:05:47,804 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-15 00:05:47,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:05:47,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1546365805, now seen corresponding path program 1 times [2025-03-15 00:05:47,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:05:47,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199284797] [2025-03-15 00:05:47,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:05:47,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:05:47,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:05:48,463 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:05:48,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:05:48,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199284797] [2025-03-15 00:05:48,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199284797] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 00:05:48,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638065970] [2025-03-15 00:05:48,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:05:48,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 00:05:48,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:05:48,469 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 00:05:48,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-15 00:05:48,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:05:48,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 2153 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-15 00:05:48,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 00:05:48,952 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 00:05:48,952 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-15 00:05:48,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [638065970] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:05:48,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-15 00:05:48,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-15 00:05:48,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845395245] [2025-03-15 00:05:48,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:05:48,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:05:48,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:05:48,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:05:48,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:05:48,961 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 1203 out of 1232 [2025-03-15 00:05:48,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1274 places, 1425 transitions, 16210 flow. Second operand has 3 states, 3 states have (on average 1205.3333333333333) internal successors, (3616), 3 states have internal predecessors, (3616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:05:48,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:05:48,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1203 of 1232 [2025-03-15 00:05:48,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:05:51,878 INFO L124 PetriNetUnfolderBase]: 1221/6210 cut-off events. [2025-03-15 00:05:51,879 INFO L125 PetriNetUnfolderBase]: For 188615/193755 co-relation queries the response was YES. [2025-03-15 00:05:51,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54499 conditions, 6210 events. 1221/6210 cut-off events. For 188615/193755 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 43891 event pairs, 171 based on Foata normal form. 420/6213 useless extension candidates. Maximal degree in co-relation 47340. Up to 3375 conditions per place. [2025-03-15 00:05:51,964 INFO L140 encePairwiseOnDemand]: 1226/1232 looper letters, 162 selfloop transitions, 8 changer transitions 76/1441 dead transitions. [2025-03-15 00:05:51,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1276 places, 1441 transitions, 16969 flow [2025-03-15 00:05:51,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:05:51,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:05:51,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3642 transitions. [2025-03-15 00:05:51,966 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9853896103896104 [2025-03-15 00:05:51,967 INFO L298 CegarLoopForPetriNet]: 1226 programPoint places, 50 predicate places. [2025-03-15 00:05:51,967 INFO L471 AbstractCegarLoop]: Abstraction has has 1276 places, 1441 transitions, 16969 flow [2025-03-15 00:05:51,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1205.3333333333333) internal successors, (3616), 3 states have internal predecessors, (3616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:05:51,967 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:05:51,968 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 00:05:51,980 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-15 00:05:52,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-15 00:05:52,172 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting t2Err0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-15 00:05:52,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:05:52,176 INFO L85 PathProgramCache]: Analyzing trace with hash 353846605, now seen corresponding path program 1 times [2025-03-15 00:05:52,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:05:52,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104206932] [2025-03-15 00:05:52,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:05:52,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:05:52,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:05:52,654 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:05:52,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:05:52,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104206932] [2025-03-15 00:05:52,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104206932] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 00:05:52,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1265216004] [2025-03-15 00:05:52,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:05:52,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 00:05:52,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:05:52,665 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 00:05:52,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-15 00:05:53,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:05:53,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 2187 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-15 00:05:53,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 00:05:53,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-15 00:05:53,118 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 00:05:53,123 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-15 00:05:53,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1265216004] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:05:53,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-15 00:05:53,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-15 00:05:53,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040570206] [2025-03-15 00:05:53,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:05:53,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:05:53,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:05:53,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:05:53,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:05:53,126 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 1210 out of 1232 [2025-03-15 00:05:53,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1276 places, 1441 transitions, 16969 flow. Second operand has 3 states, 3 states have (on average 1213.6666666666667) internal successors, (3641), 3 states have internal predecessors, (3641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:05:53,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:05:53,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1210 of 1232 [2025-03-15 00:05:53,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:05:53,975 INFO L124 PetriNetUnfolderBase]: 346/2536 cut-off events. [2025-03-15 00:05:53,976 INFO L125 PetriNetUnfolderBase]: For 80624/80960 co-relation queries the response was YES. [2025-03-15 00:05:53,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18703 conditions, 2536 events. 346/2536 cut-off events. For 80624/80960 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 9351 event pairs, 8 based on Foata normal form. 157/2605 useless extension candidates. Maximal degree in co-relation 10894. Up to 1322 conditions per place. [2025-03-15 00:05:53,996 INFO L140 encePairwiseOnDemand]: 1228/1232 looper letters, 78 selfloop transitions, 3 changer transitions 32/1305 dead transitions. [2025-03-15 00:05:53,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1276 places, 1305 transitions, 11824 flow [2025-03-15 00:05:53,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:05:53,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:05:53,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3649 transitions. [2025-03-15 00:05:53,998 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9872835497835498 [2025-03-15 00:05:53,999 INFO L298 CegarLoopForPetriNet]: 1226 programPoint places, 50 predicate places. [2025-03-15 00:05:53,999 INFO L471 AbstractCegarLoop]: Abstraction has has 1276 places, 1305 transitions, 11824 flow [2025-03-15 00:05:53,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1213.6666666666667) internal successors, (3641), 3 states have internal predecessors, (3641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:05:53,999 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:05:54,000 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 00:05:54,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-15 00:05:54,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 00:05:54,201 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting t2Err1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-15 00:05:54,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:05:54,204 INFO L85 PathProgramCache]: Analyzing trace with hash 713298548, now seen corresponding path program 1 times [2025-03-15 00:05:54,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:05:54,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597675087] [2025-03-15 00:05:54,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:05:54,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:05:54,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:05:54,660 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:05:54,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:05:54,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597675087] [2025-03-15 00:05:54,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597675087] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 00:05:54,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1146421195] [2025-03-15 00:05:54,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:05:54,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 00:05:54,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:05:54,663 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 00:05:54,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-15 00:05:54,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:05:54,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 2230 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-15 00:05:54,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 00:05:55,096 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:05:55,097 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 00:05:55,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:05:55,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1146421195] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 00:05:55,212 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 00:05:55,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-15 00:05:55,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233238264] [2025-03-15 00:05:55,212 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 00:05:55,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-15 00:05:55,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:05:55,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-15 00:05:55,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-15 00:05:55,219 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 1203 out of 1232 [2025-03-15 00:05:55,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1276 places, 1305 transitions, 11824 flow. Second operand has 10 states, 10 states have (on average 1207.0) internal successors, (12070), 10 states have internal predecessors, (12070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:05:55,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:05:55,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1203 of 1232 [2025-03-15 00:05:55,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:05:56,259 INFO L124 PetriNetUnfolderBase]: 423/2894 cut-off events. [2025-03-15 00:05:56,260 INFO L125 PetriNetUnfolderBase]: For 66498/66685 co-relation queries the response was YES. [2025-03-15 00:05:56,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23261 conditions, 2894 events. 423/2894 cut-off events. For 66498/66685 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 9871 event pairs, 8 based on Foata normal form. 0/2803 useless extension candidates. Maximal degree in co-relation 15276. Up to 1532 conditions per place. [2025-03-15 00:05:56,286 INFO L140 encePairwiseOnDemand]: 1226/1232 looper letters, 133 selfloop transitions, 9 changer transitions 32/1351 dead transitions. [2025-03-15 00:05:56,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1284 places, 1351 transitions, 13988 flow [2025-03-15 00:05:56,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 00:05:56,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 00:05:56,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10878 transitions. [2025-03-15 00:05:56,290 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9810606060606061 [2025-03-15 00:05:56,291 INFO L298 CegarLoopForPetriNet]: 1226 programPoint places, 58 predicate places. [2025-03-15 00:05:56,291 INFO L471 AbstractCegarLoop]: Abstraction has has 1284 places, 1351 transitions, 13988 flow [2025-03-15 00:05:56,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1207.0) internal successors, (12070), 10 states have internal predecessors, (12070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:05:56,292 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:05:56,293 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 00:05:56,304 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-15 00:05:56,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 00:05:56,494 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting t2Err1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-15 00:05:56,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:05:56,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1527976088, now seen corresponding path program 2 times [2025-03-15 00:05:56,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:05:56,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812467311] [2025-03-15 00:05:56,499 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 00:05:56,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:05:56,568 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 00:05:56,569 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:05:58,073 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2025-03-15 00:05:58,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:05:58,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812467311] [2025-03-15 00:05:58,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812467311] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:05:58,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:05:58,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:05:58,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509695178] [2025-03-15 00:05:58,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:05:58,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:05:58,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:05:58,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:05:58,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:05:58,078 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 1062 out of 1232 [2025-03-15 00:05:58,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1284 places, 1351 transitions, 13988 flow. Second operand has 6 states, 6 states have (on average 1074.1666666666667) internal successors, (6445), 6 states have internal predecessors, (6445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:05:58,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:05:58,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1062 of 1232 [2025-03-15 00:05:58,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:05:59,535 INFO L124 PetriNetUnfolderBase]: 431/2903 cut-off events. [2025-03-15 00:05:59,535 INFO L125 PetriNetUnfolderBase]: For 74186/74387 co-relation queries the response was YES. [2025-03-15 00:05:59,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24559 conditions, 2903 events. 431/2903 cut-off events. For 74186/74387 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 9998 event pairs, 8 based on Foata normal form. 0/2816 useless extension candidates. Maximal degree in co-relation 16054. Up to 1536 conditions per place. [2025-03-15 00:05:59,554 INFO L140 encePairwiseOnDemand]: 1226/1232 looper letters, 267 selfloop transitions, 5 changer transitions 32/1358 dead transitions. [2025-03-15 00:05:59,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1288 places, 1358 transitions, 14954 flow [2025-03-15 00:05:59,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:05:59,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:05:59,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6525 transitions. [2025-03-15 00:05:59,557 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.882711038961039 [2025-03-15 00:05:59,557 INFO L298 CegarLoopForPetriNet]: 1226 programPoint places, 62 predicate places. [2025-03-15 00:05:59,557 INFO L471 AbstractCegarLoop]: Abstraction has has 1288 places, 1358 transitions, 14954 flow [2025-03-15 00:05:59,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1074.1666666666667) internal successors, (6445), 6 states have internal predecessors, (6445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:05:59,558 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:05:59,559 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 00:05:59,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-15 00:05:59,559 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting t2Err2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-15 00:05:59,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:05:59,562 INFO L85 PathProgramCache]: Analyzing trace with hash -30464180, now seen corresponding path program 1 times [2025-03-15 00:05:59,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:05:59,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319995338] [2025-03-15 00:05:59,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:05:59,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:05:59,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:06:00,352 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 0 proven. 228 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:06:00,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:06:00,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319995338] [2025-03-15 00:06:00,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319995338] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 00:06:00,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1597237182] [2025-03-15 00:06:00,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:06:00,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 00:06:00,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:06:00,355 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 00:06:00,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-15 00:06:00,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:06:00,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 2738 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-15 00:06:00,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 00:06:01,025 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 0 proven. 228 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:06:01,026 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 00:06:01,260 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 0 proven. 228 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:06:01,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1597237182] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 00:06:01,260 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 00:06:01,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-03-15 00:06:01,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272360646] [2025-03-15 00:06:01,261 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 00:06:01,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-15 00:06:01,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:06:01,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-15 00:06:01,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-15 00:06:01,269 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 1203 out of 1232 [2025-03-15 00:06:01,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1288 places, 1358 transitions, 14954 flow. Second operand has 18 states, 18 states have (on average 1207.4444444444443) internal successors, (21734), 18 states have internal predecessors, (21734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:06:01,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:06:01,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1203 of 1232 [2025-03-15 00:06:01,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:06:03,627 INFO L124 PetriNetUnfolderBase]: 727/4316 cut-off events. [2025-03-15 00:06:03,628 INFO L125 PetriNetUnfolderBase]: For 131229/131452 co-relation queries the response was YES. [2025-03-15 00:06:03,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42517 conditions, 4316 events. 727/4316 cut-off events. For 131229/131452 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 16703 event pairs, 8 based on Foata normal form. 0/4217 useless extension candidates. Maximal degree in co-relation 33829. Up to 2352 conditions per place. [2025-03-15 00:06:03,672 INFO L140 encePairwiseOnDemand]: 1226/1232 looper letters, 297 selfloop transitions, 21 changer transitions 32/1526 dead transitions. [2025-03-15 00:06:03,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1308 places, 1526 transitions, 23198 flow [2025-03-15 00:06:03,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-15 00:06:03,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-15 00:06:03,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25368 transitions. [2025-03-15 00:06:03,680 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9805194805194806 [2025-03-15 00:06:03,681 INFO L298 CegarLoopForPetriNet]: 1226 programPoint places, 82 predicate places. [2025-03-15 00:06:03,681 INFO L471 AbstractCegarLoop]: Abstraction has has 1308 places, 1526 transitions, 23198 flow [2025-03-15 00:06:03,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1207.4444444444443) internal successors, (21734), 18 states have internal predecessors, (21734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:06:03,684 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:06:03,684 INFO L221 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 00:06:03,697 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-15 00:06:03,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-15 00:06:03,885 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting t2Err2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-15 00:06:03,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:06:03,891 INFO L85 PathProgramCache]: Analyzing trace with hash 270830028, now seen corresponding path program 2 times [2025-03-15 00:06:03,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:06:03,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121685053] [2025-03-15 00:06:03,891 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 00:06:03,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:06:03,977 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 00:06:03,978 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:06:05,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1582 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1582 trivial. 0 not checked. [2025-03-15 00:06:05,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:06:05,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121685053] [2025-03-15 00:06:05,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121685053] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:06:05,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:06:05,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:06:05,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071488201] [2025-03-15 00:06:05,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:06:05,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:06:05,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:06:05,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:06:05,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:06:05,849 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 1062 out of 1232 [2025-03-15 00:06:05,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1308 places, 1526 transitions, 23198 flow. Second operand has 6 states, 6 states have (on average 1075.1666666666667) internal successors, (6451), 6 states have internal predecessors, (6451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:06:05,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:06:05,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1062 of 1232 [2025-03-15 00:06:05,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:06:09,413 INFO L124 PetriNetUnfolderBase]: 725/4302 cut-off events. [2025-03-15 00:06:09,414 INFO L125 PetriNetUnfolderBase]: For 139602/139839 co-relation queries the response was YES. [2025-03-15 00:06:09,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44360 conditions, 4302 events. 725/4302 cut-off events. For 139602/139839 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 16565 event pairs, 8 based on Foata normal form. 0/4207 useless extension candidates. Maximal degree in co-relation 35413. Up to 2346 conditions per place. [2025-03-15 00:06:09,462 INFO L140 encePairwiseOnDemand]: 1226/1232 looper letters, 422 selfloop transitions, 5 changer transitions 32/1533 dead transitions. [2025-03-15 00:06:09,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1312 places, 1533 transitions, 24504 flow [2025-03-15 00:06:09,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:06:09,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:06:09,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6524 transitions. [2025-03-15 00:06:09,466 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8825757575757576 [2025-03-15 00:06:09,466 INFO L298 CegarLoopForPetriNet]: 1226 programPoint places, 86 predicate places. [2025-03-15 00:06:09,466 INFO L471 AbstractCegarLoop]: Abstraction has has 1312 places, 1533 transitions, 24504 flow [2025-03-15 00:06:09,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1075.1666666666667) internal successors, (6451), 6 states have internal predecessors, (6451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:06:09,467 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:06:09,468 INFO L221 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 00:06:09,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-15 00:06:09,468 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting t2Err12ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-15 00:06:09,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:06:09,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1123620253, now seen corresponding path program 1 times [2025-03-15 00:06:09,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:06:09,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636383029] [2025-03-15 00:06:09,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:06:09,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:06:09,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:06:10,161 INFO L134 CoverageAnalysis]: Checked inductivity of 1583 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1582 trivial. 0 not checked. [2025-03-15 00:06:10,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:06:10,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636383029] [2025-03-15 00:06:10,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636383029] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:06:10,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:06:10,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-15 00:06:10,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758823269] [2025-03-15 00:06:10,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:06:10,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 00:06:10,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:06:10,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 00:06:10,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 00:06:10,166 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 1208 out of 1232 [2025-03-15 00:06:10,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1312 places, 1533 transitions, 24504 flow. Second operand has 4 states, 4 states have (on average 1210.75) internal successors, (4843), 4 states have internal predecessors, (4843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:06:10,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:06:10,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1208 of 1232 [2025-03-15 00:06:10,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:06:12,862 INFO L124 PetriNetUnfolderBase]: 878/4925 cut-off events. [2025-03-15 00:06:12,862 INFO L125 PetriNetUnfolderBase]: For 185963/186212 co-relation queries the response was YES. [2025-03-15 00:06:12,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53124 conditions, 4925 events. 878/4925 cut-off events. For 185963/186212 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 21707 event pairs, 8 based on Foata normal form. 0/4780 useless extension candidates. Maximal degree in co-relation 37798. Up to 2718 conditions per place. [2025-03-15 00:06:12,909 INFO L140 encePairwiseOnDemand]: 1227/1232 looper letters, 272 selfloop transitions, 4 changer transitions 35/1551 dead transitions. [2025-03-15 00:06:12,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1315 places, 1551 transitions, 25850 flow [2025-03-15 00:06:12,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 00:06:12,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 00:06:12,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4859 transitions. [2025-03-15 00:06:12,911 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9859983766233766 [2025-03-15 00:06:12,912 INFO L298 CegarLoopForPetriNet]: 1226 programPoint places, 89 predicate places. [2025-03-15 00:06:12,912 INFO L471 AbstractCegarLoop]: Abstraction has has 1315 places, 1551 transitions, 25850 flow [2025-03-15 00:06:12,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1210.75) internal successors, (4843), 4 states have internal predecessors, (4843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:06:12,912 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:06:12,913 INFO L221 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 00:06:12,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-15 00:06:12,913 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting t2Err12ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-15 00:06:12,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:06:12,919 INFO L85 PathProgramCache]: Analyzing trace with hash -976069723, now seen corresponding path program 1 times [2025-03-15 00:06:12,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:06:12,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111002132] [2025-03-15 00:06:12,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:06:12,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:06:13,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:06:13,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1583 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1582 trivial. 0 not checked. [2025-03-15 00:06:13,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:06:13,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111002132] [2025-03-15 00:06:13,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111002132] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 00:06:13,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [510936153] [2025-03-15 00:06:13,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:06:13,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 00:06:13,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:06:13,667 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 00:06:13,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-15 00:06:14,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:06:14,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 3738 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-15 00:06:14,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 00:06:14,306 INFO L134 CoverageAnalysis]: Checked inductivity of 1583 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1583 trivial. 0 not checked. [2025-03-15 00:06:14,306 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-15 00:06:14,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [510936153] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:06:14,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-15 00:06:14,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-15 00:06:14,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913276672] [2025-03-15 00:06:14,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:06:14,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:06:14,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:06:14,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:06:14,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:06:14,310 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 1203 out of 1232 [2025-03-15 00:06:14,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1315 places, 1551 transitions, 25850 flow. Second operand has 3 states, 3 states have (on average 1207.6666666666667) internal successors, (3623), 3 states have internal predecessors, (3623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:06:14,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:06:14,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1203 of 1232 [2025-03-15 00:06:14,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:06:17,523 INFO L124 PetriNetUnfolderBase]: 880/4922 cut-off events. [2025-03-15 00:06:17,524 INFO L125 PetriNetUnfolderBase]: For 203225/203486 co-relation queries the response was YES. [2025-03-15 00:06:17,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54069 conditions, 4922 events. 880/4922 cut-off events. For 203225/203486 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 21712 event pairs, 8 based on Foata normal form. 0/4781 useless extension candidates. Maximal degree in co-relation 38347. Up to 2720 conditions per place. [2025-03-15 00:06:17,559 INFO L140 encePairwiseOnDemand]: 1229/1232 looper letters, 272 selfloop transitions, 2 changer transitions 35/1552 dead transitions. [2025-03-15 00:06:17,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1316 places, 1552 transitions, 26556 flow [2025-03-15 00:06:17,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:06:17,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:06:17,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3629 transitions. [2025-03-15 00:06:17,561 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9818722943722944 [2025-03-15 00:06:17,561 INFO L298 CegarLoopForPetriNet]: 1226 programPoint places, 90 predicate places. [2025-03-15 00:06:17,562 INFO L471 AbstractCegarLoop]: Abstraction has has 1316 places, 1552 transitions, 26556 flow [2025-03-15 00:06:17,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1207.6666666666667) internal successors, (3623), 3 states have internal predecessors, (3623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:06:17,562 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:06:17,563 INFO L221 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 00:06:17,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-15 00:06:17,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-15 00:06:17,763 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting t2Err3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-15 00:06:17,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:06:17,767 INFO L85 PathProgramCache]: Analyzing trace with hash 483858286, now seen corresponding path program 1 times [2025-03-15 00:06:17,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:06:17,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311492691] [2025-03-15 00:06:17,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:06:17,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:06:17,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:06:19,496 INFO L134 CoverageAnalysis]: Checked inductivity of 1582 backedges. 0 proven. 1582 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:06:19,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:06:19,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311492691] [2025-03-15 00:06:19,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311492691] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 00:06:19,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [427504680] [2025-03-15 00:06:19,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:06:19,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 00:06:19,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:06:19,499 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 00:06:19,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-15 00:06:20,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:06:20,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 3752 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-15 00:06:20,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 00:06:20,502 INFO L134 CoverageAnalysis]: Checked inductivity of 1582 backedges. 0 proven. 1582 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:06:20,502 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 00:06:21,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1582 backedges. 0 proven. 1582 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:06:21,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [427504680] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 00:06:21,026 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 00:06:21,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2025-03-15 00:06:21,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303715415] [2025-03-15 00:06:21,026 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 00:06:21,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-15 00:06:21,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:06:21,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-15 00:06:21,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2025-03-15 00:06:21,040 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 1203 out of 1232 [2025-03-15 00:06:21,053 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1316 places, 1552 transitions, 26556 flow. Second operand has 34 states, 34 states have (on average 1207.7058823529412) internal successors, (41062), 34 states have internal predecessors, (41062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:06:21,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:06:21,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1203 of 1232 [2025-03-15 00:06:21,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:06:29,529 INFO L124 PetriNetUnfolderBase]: 1472/7741 cut-off events. [2025-03-15 00:06:29,530 INFO L125 PetriNetUnfolderBase]: For 357703/357990 co-relation queries the response was YES. [2025-03-15 00:06:29,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93588 conditions, 7741 events. 1472/7741 cut-off events. For 357703/357990 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 34824 event pairs, 8 based on Foata normal form. 0/7576 useless extension candidates. Maximal degree in co-relation 77532. Up to 4352 conditions per place. [2025-03-15 00:06:29,603 INFO L140 encePairwiseOnDemand]: 1226/1232 looper letters, 629 selfloop transitions, 45 changer transitions 35/1888 dead transitions. [2025-03-15 00:06:29,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1360 places, 1888 transitions, 45374 flow [2025-03-15 00:06:29,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-03-15 00:06:29,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2025-03-15 00:06:29,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54348 transitions. [2025-03-15 00:06:29,619 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9803030303030303 [2025-03-15 00:06:29,621 INFO L298 CegarLoopForPetriNet]: 1226 programPoint places, 134 predicate places. [2025-03-15 00:06:29,621 INFO L471 AbstractCegarLoop]: Abstraction has has 1360 places, 1888 transitions, 45374 flow [2025-03-15 00:06:29,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1207.7058823529412) internal successors, (41062), 34 states have internal predecessors, (41062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:06:29,626 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:06:29,627 INFO L221 CegarLoopForPetriNet]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 00:06:29,641 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-15 00:06:29,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 00:06:29,828 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting t2Err3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-15 00:06:29,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:06:29,836 INFO L85 PathProgramCache]: Analyzing trace with hash 826577210, now seen corresponding path program 2 times [2025-03-15 00:06:29,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:06:29,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162606866] [2025-03-15 00:06:29,837 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 00:06:29,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:06:29,959 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 00:06:29,959 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:06:31,683 INFO L134 CoverageAnalysis]: Checked inductivity of 7890 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7890 trivial. 0 not checked. [2025-03-15 00:06:31,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:06:31,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162606866] [2025-03-15 00:06:31,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162606866] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:06:31,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:06:31,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:06:31,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239051860] [2025-03-15 00:06:31,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:06:31,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:06:31,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:06:31,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:06:31,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:06:31,694 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 1056 out of 1232 [2025-03-15 00:06:31,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1360 places, 1888 transitions, 45374 flow. Second operand has 6 states, 6 states have (on average 1069.8333333333333) internal successors, (6419), 6 states have internal predecessors, (6419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:06:31,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:06:31,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1056 of 1232 [2025-03-15 00:06:31,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:06:41,549 INFO L124 PetriNetUnfolderBase]: 1504/7756 cut-off events. [2025-03-15 00:06:41,550 INFO L125 PetriNetUnfolderBase]: For 397375/397676 co-relation queries the response was YES. [2025-03-15 00:06:41,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98284 conditions, 7756 events. 1504/7756 cut-off events. For 397375/397676 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 35177 event pairs, 8 based on Foata normal form. 0/7615 useless extension candidates. Maximal degree in co-relation 80757. Up to 4360 conditions per place. [2025-03-15 00:06:41,634 INFO L140 encePairwiseOnDemand]: 1223/1232 looper letters, 748 selfloop transitions, 6 changer transitions 35/1901 dead transitions. [2025-03-15 00:06:41,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1362 places, 1901 transitions, 47846 flow [2025-03-15 00:06:41,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:06:41,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:06:41,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6493 transitions. [2025-03-15 00:06:41,637 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8783820346320347 [2025-03-15 00:06:41,638 INFO L298 CegarLoopForPetriNet]: 1226 programPoint places, 136 predicate places. [2025-03-15 00:06:41,638 INFO L471 AbstractCegarLoop]: Abstraction has has 1362 places, 1901 transitions, 47846 flow [2025-03-15 00:06:41,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1069.8333333333333) internal successors, (6419), 6 states have internal predecessors, (6419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:06:41,639 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:06:41,640 INFO L221 CegarLoopForPetriNet]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 00:06:41,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-15 00:06:41,640 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting t2Err13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-15 00:06:41,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:06:41,649 INFO L85 PathProgramCache]: Analyzing trace with hash -537450143, now seen corresponding path program 1 times [2025-03-15 00:06:41,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:06:41,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800272952] [2025-03-15 00:06:41,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:06:41,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:06:41,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:06:43,230 INFO L134 CoverageAnalysis]: Checked inductivity of 7891 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7890 trivial. 0 not checked. [2025-03-15 00:06:43,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:06:43,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800272952] [2025-03-15 00:06:43,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800272952] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 00:06:43,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [610184996] [2025-03-15 00:06:43,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:06:43,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 00:06:43,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:06:43,233 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 00:06:43,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-15 00:06:44,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:06:44,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 5674 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-15 00:06:44,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 00:06:44,190 INFO L134 CoverageAnalysis]: Checked inductivity of 7891 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7891 trivial. 0 not checked. [2025-03-15 00:06:44,190 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-15 00:06:44,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [610184996] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:06:44,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-15 00:06:44,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-15 00:06:44,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820229459] [2025-03-15 00:06:44,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:06:44,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:06:44,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:06:44,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:06:44,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:06:44,195 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 1203 out of 1232 [2025-03-15 00:06:44,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1362 places, 1901 transitions, 47846 flow. Second operand has 3 states, 3 states have (on average 1207.6666666666667) internal successors, (3623), 3 states have internal predecessors, (3623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:06:44,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:06:44,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1203 of 1232 [2025-03-15 00:06:44,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:06:52,626 INFO L124 PetriNetUnfolderBase]: 1506/7754 cut-off events. [2025-03-15 00:06:52,626 INFO L125 PetriNetUnfolderBase]: For 429793/430106 co-relation queries the response was YES. [2025-03-15 00:06:52,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99834 conditions, 7754 events. 1506/7754 cut-off events. For 429793/430106 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 35205 event pairs, 8 based on Foata normal form. 0/7617 useless extension candidates. Maximal degree in co-relation 81874. Up to 4362 conditions per place. [2025-03-15 00:06:52,883 INFO L140 encePairwiseOnDemand]: 1229/1232 looper letters, 536 selfloop transitions, 0 changer transitions 52/1902 dead transitions. [2025-03-15 00:06:52,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1363 places, 1902 transitions, 49110 flow [2025-03-15 00:06:52,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:06:52,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:06:52,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3629 transitions. [2025-03-15 00:06:52,886 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9818722943722944 [2025-03-15 00:06:52,886 INFO L298 CegarLoopForPetriNet]: 1226 programPoint places, 137 predicate places. [2025-03-15 00:06:52,886 INFO L471 AbstractCegarLoop]: Abstraction has has 1363 places, 1902 transitions, 49110 flow [2025-03-15 00:06:52,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1207.6666666666667) internal successors, (3623), 3 states have internal predecessors, (3623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:06:52,887 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:06:52,892 INFO L221 CegarLoopForPetriNet]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 00:06:52,911 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-15 00:06:53,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2025-03-15 00:06:53,093 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting t2Err4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-15 00:06:53,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:06:53,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1211588572, now seen corresponding path program 1 times [2025-03-15 00:06:53,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:06:53,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763116735] [2025-03-15 00:06:53,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:06:53,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:06:53,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:06:58,865 INFO L134 CoverageAnalysis]: Checked inductivity of 7890 backedges. 0 proven. 7890 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:06:58,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:06:58,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763116735] [2025-03-15 00:06:58,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763116735] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 00:06:58,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [722171412] [2025-03-15 00:06:58,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:06:58,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 00:06:58,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:06:58,868 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 00:06:58,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-15 00:06:59,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:06:59,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 5706 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-15 00:06:59,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 00:07:00,590 INFO L134 CoverageAnalysis]: Checked inductivity of 7890 backedges. 0 proven. 7890 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:07:00,590 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 00:07:01,863 INFO L134 CoverageAnalysis]: Checked inductivity of 7890 backedges. 0 proven. 7890 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:07:01,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [722171412] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 00:07:01,863 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 00:07:01,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 66 [2025-03-15 00:07:01,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777568074] [2025-03-15 00:07:01,864 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 00:07:01,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2025-03-15 00:07:01,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:07:01,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2025-03-15 00:07:01,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1122, Invalid=3168, Unknown=0, NotChecked=0, Total=4290 [2025-03-15 00:07:01,893 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 1203 out of 1232 [2025-03-15 00:07:01,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1363 places, 1902 transitions, 49110 flow. Second operand has 66 states, 66 states have (on average 1207.8484848484848) internal successors, (79718), 66 states have internal predecessors, (79718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:07:01,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:07:01,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1203 of 1232 [2025-03-15 00:07:01,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:07:30,450 INFO L124 PetriNetUnfolderBase]: 2690/13402 cut-off events. [2025-03-15 00:07:30,451 INFO L125 PetriNetUnfolderBase]: For 799432/799769 co-relation queries the response was YES. [2025-03-15 00:07:30,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 184681 conditions, 13402 events. 2690/13402 cut-off events. For 799432/799769 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 62004 event pairs, 8 based on Foata normal form. 0/13217 useless extension candidates. Maximal degree in co-relation 166354. Up to 7948 conditions per place. [2025-03-15 00:07:30,569 INFO L140 encePairwiseOnDemand]: 1226/1232 looper letters, 1263 selfloop transitions, 93 changer transitions 52/2574 dead transitions. [2025-03-15 00:07:30,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1455 places, 2574 transitions, 90284 flow [2025-03-15 00:07:30,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2025-03-15 00:07:30,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2025-03-15 00:07:30,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 112308 transitions. [2025-03-15 00:07:30,600 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9802052785923754 [2025-03-15 00:07:30,601 INFO L298 CegarLoopForPetriNet]: 1226 programPoint places, 229 predicate places. [2025-03-15 00:07:30,601 INFO L471 AbstractCegarLoop]: Abstraction has has 1455 places, 2574 transitions, 90284 flow [2025-03-15 00:07:30,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 1207.8484848484848) internal successors, (79718), 66 states have internal predecessors, (79718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:07:30,610 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:07:30,611 INFO L221 CegarLoopForPetriNet]: trace histogram [31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 00:07:30,629 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-15 00:07:30,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 00:07:30,812 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting t2Err4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-15 00:07:30,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:07:30,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1693130014, now seen corresponding path program 2 times [2025-03-15 00:07:30,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:07:30,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808655540] [2025-03-15 00:07:30,820 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 00:07:30,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:07:31,026 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 00:07:31,026 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:07:32,689 INFO L134 CoverageAnalysis]: Checked inductivity of 34906 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34906 trivial. 0 not checked. [2025-03-15 00:07:32,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:07:32,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808655540] [2025-03-15 00:07:32,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808655540] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:07:32,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:07:32,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:07:32,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691644001] [2025-03-15 00:07:32,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:07:32,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:07:32,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:07:32,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:07:32,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:07:32,702 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 1055 out of 1232 [2025-03-15 00:07:32,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1455 places, 2574 transitions, 90284 flow. Second operand has 6 states, 6 states have (on average 1069.8333333333333) internal successors, (6419), 6 states have internal predecessors, (6419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:07:32,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:07:32,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1055 of 1232 [2025-03-15 00:07:32,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:08:12,164 INFO L124 PetriNetUnfolderBase]: 2690/13394 cut-off events. [2025-03-15 00:08:12,165 INFO L125 PetriNetUnfolderBase]: For 840668/841019 co-relation queries the response was YES. [2025-03-15 00:08:12,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 191907 conditions, 13394 events. 2690/13394 cut-off events. For 840668/841019 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 61516 event pairs, 8 based on Foata normal form. 0/13217 useless extension candidates. Maximal degree in co-relation 172984. Up to 7940 conditions per place. [2025-03-15 00:08:12,310 INFO L140 encePairwiseOnDemand]: 1226/1232 looper letters, 1351 selfloop transitions, 5 changer transitions 52/2589 dead transitions. [2025-03-15 00:08:12,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1459 places, 2589 transitions, 94130 flow [2025-03-15 00:08:12,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:08:12,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:08:12,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6485 transitions. [2025-03-15 00:08:12,313 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8772997835497836 [2025-03-15 00:08:12,313 INFO L298 CegarLoopForPetriNet]: 1226 programPoint places, 233 predicate places. [2025-03-15 00:08:12,313 INFO L471 AbstractCegarLoop]: Abstraction has has 1459 places, 2589 transitions, 94130 flow [2025-03-15 00:08:12,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1069.8333333333333) internal successors, (6419), 6 states have internal predecessors, (6419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:08:12,314 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:08:12,315 INFO L221 CegarLoopForPetriNet]: trace histogram [31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 00:08:12,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-15 00:08:12,315 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting t2Err5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-15 00:08:12,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:08:12,323 INFO L85 PathProgramCache]: Analyzing trace with hash -451163899, now seen corresponding path program 1 times [2025-03-15 00:08:12,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:08:12,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488900975] [2025-03-15 00:08:12,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:08:12,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:08:12,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:08:35,292 INFO L134 CoverageAnalysis]: Checked inductivity of 34906 backedges. 0 proven. 34906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:08:35,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:08:35,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488900975] [2025-03-15 00:08:35,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488900975] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 00:08:35,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733264725] [2025-03-15 00:08:35,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:08:35,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 00:08:35,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:08:35,298 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 00:08:35,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-15 00:08:37,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:08:37,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 9592 conjuncts, 64 conjuncts are in the unsatisfiable core [2025-03-15 00:08:37,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 00:08:38,639 INFO L134 CoverageAnalysis]: Checked inductivity of 34906 backedges. 0 proven. 34906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:08:38,640 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 00:08:42,569 INFO L134 CoverageAnalysis]: Checked inductivity of 34906 backedges. 0 proven. 34906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:08:42,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1733264725] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 00:08:42,569 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 00:08:42,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 130 [2025-03-15 00:08:42,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63030314] [2025-03-15 00:08:42,570 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 00:08:42,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 130 states [2025-03-15 00:08:42,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:08:42,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2025-03-15 00:08:42,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=4290, Invalid=12480, Unknown=0, NotChecked=0, Total=16770 [2025-03-15 00:08:42,620 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 1203 out of 1232 [2025-03-15 00:08:42,670 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1459 places, 2589 transitions, 94130 flow. Second operand has 130 states, 130 states have (on average 1207.923076923077) internal successors, (157030), 130 states have internal predecessors, (157030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:08:42,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:08:42,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1203 of 1232 [2025-03-15 00:08:42,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:10:55,792 INFO L124 PetriNetUnfolderBase]: 5058/24684 cut-off events. [2025-03-15 00:10:55,793 INFO L125 PetriNetUnfolderBase]: For 1659236/1659609 co-relation queries the response was YES. [2025-03-15 00:10:55,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 371099 conditions, 24684 events. 5058/24684 cut-off events. For 1659236/1659609 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 114844 event pairs, 8 based on Foata normal form. 0/24411 useless extension candidates. Maximal degree in co-relation 351809. Up to 15236 conditions per place. [2025-03-15 00:10:56,123 INFO L140 encePairwiseOnDemand]: 1226/1232 looper letters, 2527 selfloop transitions, 189 changer transitions 52/3933 dead transitions. [2025-03-15 00:10:56,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1647 places, 3933 transitions, 181480 flow [2025-03-15 00:10:56,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 189 states. [2025-03-15 00:10:56,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2025-03-15 00:10:56,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 228228 transitions. [2025-03-15 00:10:56,196 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9801587301587301 [2025-03-15 00:10:56,197 INFO L298 CegarLoopForPetriNet]: 1226 programPoint places, 421 predicate places. [2025-03-15 00:10:56,197 INFO L471 AbstractCegarLoop]: Abstraction has has 1647 places, 3933 transitions, 181480 flow [2025-03-15 00:10:56,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 130 states, 130 states have (on average 1207.923076923077) internal successors, (157030), 130 states have internal predecessors, (157030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:10:56,219 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:10:56,221 INFO L221 CegarLoopForPetriNet]: trace histogram [63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 00:10:56,249 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-15 00:10:56,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2025-03-15 00:10:56,422 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting t2Err5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-15 00:10:56,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:10:56,436 INFO L85 PathProgramCache]: Analyzing trace with hash -2008142395, now seen corresponding path program 2 times [2025-03-15 00:10:56,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:10:56,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415210538] [2025-03-15 00:10:56,436 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 00:10:56,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:10:56,822 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 00:10:56,822 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:10:59,035 INFO L134 CoverageAnalysis]: Checked inductivity of 146538 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 146538 trivial. 0 not checked. [2025-03-15 00:10:59,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:10:59,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415210538] [2025-03-15 00:10:59,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415210538] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:10:59,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:10:59,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:10:59,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839922108] [2025-03-15 00:10:59,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:10:59,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:10:59,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:10:59,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:10:59,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:10:59,050 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 1056 out of 1232 [2025-03-15 00:10:59,053 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1647 places, 3933 transitions, 181480 flow. Second operand has 6 states, 6 states have (on average 1071.8333333333333) internal successors, (6431), 6 states have internal predecessors, (6431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:10:59,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:10:59,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1056 of 1232 [2025-03-15 00:10:59,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:13:44,620 INFO L124 PetriNetUnfolderBase]: 5054/24676 cut-off events. [2025-03-15 00:13:44,620 INFO L125 PetriNetUnfolderBase]: For 1738996/1739383 co-relation queries the response was YES. [2025-03-15 00:13:44,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 384750 conditions, 24676 events. 5054/24676 cut-off events. For 1738996/1739383 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 114391 event pairs, 8 based on Foata normal form. 0/24411 useless extension candidates. Maximal degree in co-relation 365026. Up to 15224 conditions per place. [2025-03-15 00:13:44,994 INFO L140 encePairwiseOnDemand]: 1226/1232 looper letters, 2549 selfloop transitions, 5 changer transitions 52/3948 dead transitions. [2025-03-15 00:13:44,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1651 places, 3948 transitions, 187784 flow [2025-03-15 00:13:44,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:13:44,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:13:44,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6489 transitions. [2025-03-15 00:13:44,998 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8778409090909091 [2025-03-15 00:13:44,998 INFO L298 CegarLoopForPetriNet]: 1226 programPoint places, 425 predicate places. [2025-03-15 00:13:44,998 INFO L471 AbstractCegarLoop]: Abstraction has has 1651 places, 3948 transitions, 187784 flow [2025-03-15 00:13:44,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1071.8333333333333) internal successors, (6431), 6 states have internal predecessors, (6431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:13:44,999 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:13:45,000 INFO L221 CegarLoopForPetriNet]: trace histogram [63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 00:13:45,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-15 00:13:45,001 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting t2Err6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-15 00:13:45,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:13:45,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1377471210, now seen corresponding path program 1 times [2025-03-15 00:13:45,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:13:45,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249932878] [2025-03-15 00:13:45,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:13:45,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:13:45,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:15:35,779 INFO L134 CoverageAnalysis]: Checked inductivity of 146538 backedges. 0 proven. 146538 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:15:35,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:15:35,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249932878] [2025-03-15 00:15:35,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249932878] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 00:15:35,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [47777718] [2025-03-15 00:15:35,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:15:35,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 00:15:35,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:15:35,782 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 00:15:35,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-15 00:15:39,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:15:39,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 17335 conjuncts, 128 conjuncts are in the unsatisfiable core [2025-03-15 00:15:39,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 00:15:42,140 INFO L134 CoverageAnalysis]: Checked inductivity of 146538 backedges. 0 proven. 146538 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:15:42,141 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 00:15:53,780 INFO L134 CoverageAnalysis]: Checked inductivity of 146538 backedges. 0 proven. 146538 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:15:53,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [47777718] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 00:15:53,780 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 00:15:53,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [129, 129, 129] total 258 [2025-03-15 00:15:53,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670626911] [2025-03-15 00:15:53,781 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 00:15:53,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 258 states [2025-03-15 00:15:53,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:15:53,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 258 interpolants. [2025-03-15 00:15:53,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16770, Invalid=49536, Unknown=0, NotChecked=0, Total=66306 [2025-03-15 00:15:53,880 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 1203 out of 1232 [2025-03-15 00:15:54,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1651 places, 3948 transitions, 187784 flow. Second operand has 258 states, 258 states have (on average 1207.9612403100775) internal successors, (311654), 258 states have internal predecessors, (311654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:15:54,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:15:54,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1203 of 1232 [2025-03-15 00:15:54,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2025-03-15 00:16:24,600 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-03-15 00:16:24,600 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-03-15 00:16:24,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2025-03-15 00:16:24,617 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err6ASSERT_VIOLATIONDATA_RACE (60 of 61 remaining) [2025-03-15 00:16:24,669 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-15 00:16:24,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2025-03-15 00:16:24,818 WARN L596 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (258states, 1203/1232 universal loopers) in iteration 36,while PetriNetUnfolder was constructing finite prefix that currently has 148652 conditions, 9873 events (1875/9872 cut-off events. For 687616/687918 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 42038 event pairs, 5 based on Foata normal form. 0/9796 useless extension candidates. Maximal degree in co-relation 146380. Up to 5781 conditions per place.). [2025-03-15 00:16:24,820 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (59 of 61 remaining) [2025-03-15 00:16:24,820 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (58 of 61 remaining) [2025-03-15 00:16:24,820 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (57 of 61 remaining) [2025-03-15 00:16:24,820 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (56 of 61 remaining) [2025-03-15 00:16:24,820 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (55 of 61 remaining) [2025-03-15 00:16:24,820 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (54 of 61 remaining) [2025-03-15 00:16:24,820 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (53 of 61 remaining) [2025-03-15 00:16:24,820 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (52 of 61 remaining) [2025-03-15 00:16:24,821 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (51 of 61 remaining) [2025-03-15 00:16:24,821 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONDATA_RACE (50 of 61 remaining) [2025-03-15 00:16:24,821 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err10ASSERT_VIOLATIONDATA_RACE (49 of 61 remaining) [2025-03-15 00:16:24,821 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err11ASSERT_VIOLATIONDATA_RACE (48 of 61 remaining) [2025-03-15 00:16:24,821 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err1ASSERT_VIOLATIONDATA_RACE (47 of 61 remaining) [2025-03-15 00:16:24,821 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err2ASSERT_VIOLATIONDATA_RACE (46 of 61 remaining) [2025-03-15 00:16:24,821 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err3ASSERT_VIOLATIONDATA_RACE (45 of 61 remaining) [2025-03-15 00:16:24,821 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err4ASSERT_VIOLATIONDATA_RACE (44 of 61 remaining) [2025-03-15 00:16:24,821 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err5ASSERT_VIOLATIONDATA_RACE (43 of 61 remaining) [2025-03-15 00:16:24,821 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err7ASSERT_VIOLATIONDATA_RACE (42 of 61 remaining) [2025-03-15 00:16:24,821 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err6ASSERT_VIOLATIONDATA_RACE (41 of 61 remaining) [2025-03-15 00:16:24,821 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err8ASSERT_VIOLATIONDATA_RACE (40 of 61 remaining) [2025-03-15 00:16:24,821 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err9ASSERT_VIOLATIONDATA_RACE (39 of 61 remaining) [2025-03-15 00:16:24,821 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONDATA_RACE (38 of 61 remaining) [2025-03-15 00:16:24,821 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err12ASSERT_VIOLATIONDATA_RACE (37 of 61 remaining) [2025-03-15 00:16:24,821 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err13ASSERT_VIOLATIONDATA_RACE (36 of 61 remaining) [2025-03-15 00:16:24,821 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err1ASSERT_VIOLATIONDATA_RACE (35 of 61 remaining) [2025-03-15 00:16:24,821 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err2ASSERT_VIOLATIONDATA_RACE (34 of 61 remaining) [2025-03-15 00:16:24,821 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err3ASSERT_VIOLATIONDATA_RACE (33 of 61 remaining) [2025-03-15 00:16:24,821 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err4ASSERT_VIOLATIONDATA_RACE (32 of 61 remaining) [2025-03-15 00:16:24,821 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err5ASSERT_VIOLATIONDATA_RACE (31 of 61 remaining) [2025-03-15 00:16:24,821 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err6ASSERT_VIOLATIONDATA_RACE (30 of 61 remaining) [2025-03-15 00:16:24,821 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err7ASSERT_VIOLATIONDATA_RACE (29 of 61 remaining) [2025-03-15 00:16:24,821 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err9ASSERT_VIOLATIONDATA_RACE (28 of 61 remaining) [2025-03-15 00:16:24,821 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err8ASSERT_VIOLATIONDATA_RACE (27 of 61 remaining) [2025-03-15 00:16:24,821 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err10ASSERT_VIOLATIONDATA_RACE (26 of 61 remaining) [2025-03-15 00:16:24,821 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err11ASSERT_VIOLATIONDATA_RACE (25 of 61 remaining) [2025-03-15 00:16:24,821 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONDATA_RACE (24 of 61 remaining) [2025-03-15 00:16:24,821 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err10ASSERT_VIOLATIONDATA_RACE (23 of 61 remaining) [2025-03-15 00:16:24,821 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err11ASSERT_VIOLATIONDATA_RACE (22 of 61 remaining) [2025-03-15 00:16:24,822 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err1ASSERT_VIOLATIONDATA_RACE (21 of 61 remaining) [2025-03-15 00:16:24,822 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err2ASSERT_VIOLATIONDATA_RACE (20 of 61 remaining) [2025-03-15 00:16:24,822 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err3ASSERT_VIOLATIONDATA_RACE (19 of 61 remaining) [2025-03-15 00:16:24,822 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err4ASSERT_VIOLATIONDATA_RACE (18 of 61 remaining) [2025-03-15 00:16:24,822 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err5ASSERT_VIOLATIONDATA_RACE (17 of 61 remaining) [2025-03-15 00:16:24,822 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err7ASSERT_VIOLATIONDATA_RACE (16 of 61 remaining) [2025-03-15 00:16:24,822 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err6ASSERT_VIOLATIONDATA_RACE (15 of 61 remaining) [2025-03-15 00:16:24,822 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err8ASSERT_VIOLATIONDATA_RACE (14 of 61 remaining) [2025-03-15 00:16:24,822 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err9ASSERT_VIOLATIONDATA_RACE (13 of 61 remaining) [2025-03-15 00:16:24,822 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONDATA_RACE (12 of 61 remaining) [2025-03-15 00:16:24,822 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err12ASSERT_VIOLATIONDATA_RACE (11 of 61 remaining) [2025-03-15 00:16:24,822 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err13ASSERT_VIOLATIONDATA_RACE (10 of 61 remaining) [2025-03-15 00:16:24,822 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err1ASSERT_VIOLATIONDATA_RACE (9 of 61 remaining) [2025-03-15 00:16:24,822 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err2ASSERT_VIOLATIONDATA_RACE (8 of 61 remaining) [2025-03-15 00:16:24,822 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err3ASSERT_VIOLATIONDATA_RACE (7 of 61 remaining) [2025-03-15 00:16:24,822 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err4ASSERT_VIOLATIONDATA_RACE (6 of 61 remaining) [2025-03-15 00:16:24,822 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err5ASSERT_VIOLATIONDATA_RACE (5 of 61 remaining) [2025-03-15 00:16:24,822 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err7ASSERT_VIOLATIONDATA_RACE (4 of 61 remaining) [2025-03-15 00:16:24,822 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err9ASSERT_VIOLATIONDATA_RACE (3 of 61 remaining) [2025-03-15 00:16:24,822 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err8ASSERT_VIOLATIONDATA_RACE (2 of 61 remaining) [2025-03-15 00:16:24,822 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err10ASSERT_VIOLATIONDATA_RACE (1 of 61 remaining) [2025-03-15 00:16:24,822 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err11ASSERT_VIOLATIONDATA_RACE (0 of 61 remaining) [2025-03-15 00:16:24,823 INFO L422 BasicCegarLoop]: Path program histogram: [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] [2025-03-15 00:16:24,827 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-15 00:16:24,827 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-15 00:16:24,830 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 12:16:24 BasicIcfg [2025-03-15 00:16:24,831 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-15 00:16:24,831 INFO L158 Benchmark]: Toolchain (without parser) took 768941.63ms. Allocated memory was 71.3MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 42.2MB in the beginning and 1.3GB in the end (delta: -1.3GB). Peak memory consumption was 2.3GB. Max. memory is 8.0GB. [2025-03-15 00:16:24,831 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 71.3MB. Free memory is still 35.8MB. There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 00:16:24,831 INFO L158 Benchmark]: CACSL2BoogieTranslator took 523.13ms. Allocated memory is still 71.3MB. Free memory was 42.0MB in the beginning and 25.5MB in the end (delta: 16.5MB). Peak memory consumption was 31.4MB. Max. memory is 8.0GB. [2025-03-15 00:16:24,832 INFO L158 Benchmark]: Boogie Procedure Inliner took 106.65ms. Allocated memory is still 71.3MB. Free memory was 25.5MB in the beginning and 32.6MB in the end (delta: -7.1MB). Peak memory consumption was 11.7MB. Max. memory is 8.0GB. [2025-03-15 00:16:24,832 INFO L158 Benchmark]: Boogie Preprocessor took 99.76ms. Allocated memory is still 71.3MB. Free memory was 32.6MB in the beginning and 24.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-03-15 00:16:24,832 INFO L158 Benchmark]: RCFGBuilder took 1409.30ms. Allocated memory was 71.3MB in the beginning and 96.5MB in the end (delta: 25.2MB). Free memory was 24.2MB in the beginning and 37.1MB in the end (delta: -12.9MB). Peak memory consumption was 33.3MB. Max. memory is 8.0GB. [2025-03-15 00:16:24,832 INFO L158 Benchmark]: TraceAbstraction took 766797.32ms. Allocated memory was 96.5MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 36.4MB in the beginning and 1.3GB in the end (delta: -1.3GB). Peak memory consumption was 2.3GB. Max. memory is 8.0GB. [2025-03-15 00:16:24,833 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 71.3MB. Free memory is still 35.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 523.13ms. Allocated memory is still 71.3MB. Free memory was 42.0MB in the beginning and 25.5MB in the end (delta: 16.5MB). Peak memory consumption was 31.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 106.65ms. Allocated memory is still 71.3MB. Free memory was 25.5MB in the beginning and 32.6MB in the end (delta: -7.1MB). Peak memory consumption was 11.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 99.76ms. Allocated memory is still 71.3MB. Free memory was 32.6MB in the beginning and 24.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * RCFGBuilder took 1409.30ms. Allocated memory was 71.3MB in the beginning and 96.5MB in the end (delta: 25.2MB). Free memory was 24.2MB in the beginning and 37.1MB in the end (delta: -12.9MB). Peak memory consumption was 33.3MB. Max. memory is 8.0GB. * TraceAbstraction took 766797.32ms. Allocated memory was 96.5MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 36.4MB in the beginning and 1.3GB in the end (delta: -1.3GB). Peak memory consumption was 2.3GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 996]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (258states, 1203/1232 universal loopers) in iteration 36,while PetriNetUnfolder was constructing finite prefix that currently has 148652 conditions, 9873 events (1875/9872 cut-off events. For 687616/687918 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 42038 event pairs, 5 based on Foata normal form. 0/9796 useless extension candidates. Maximal degree in co-relation 146380. Up to 5781 conditions per place.). - TimeoutResultAtElement [Line: 1045]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (258states, 1203/1232 universal loopers) in iteration 36,while PetriNetUnfolder was constructing finite prefix that currently has 148652 conditions, 9873 events (1875/9872 cut-off events. For 687616/687918 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 42038 event pairs, 5 based on Foata normal form. 0/9796 useless extension candidates. Maximal degree in co-relation 146380. Up to 5781 conditions per place.). - TimeoutResultAtElement [Line: 1046]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (258states, 1203/1232 universal loopers) in iteration 36,while PetriNetUnfolder was constructing finite prefix that currently has 148652 conditions, 9873 events (1875/9872 cut-off events. For 687616/687918 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 42038 event pairs, 5 based on Foata normal form. 0/9796 useless extension candidates. Maximal degree in co-relation 146380. Up to 5781 conditions per place.). - TimeoutResultAtElement [Line: 954]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (258states, 1203/1232 universal loopers) in iteration 36,while PetriNetUnfolder was constructing finite prefix that currently has 148652 conditions, 9873 events (1875/9872 cut-off events. For 687616/687918 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 42038 event pairs, 5 based on Foata normal form. 0/9796 useless extension candidates. Maximal degree in co-relation 146380. Up to 5781 conditions per place.). - TimeoutResultAtElement [Line: 955]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (258states, 1203/1232 universal loopers) in iteration 36,while PetriNetUnfolder was constructing finite prefix that currently has 148652 conditions, 9873 events (1875/9872 cut-off events. For 687616/687918 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 42038 event pairs, 5 based on Foata normal form. 0/9796 useless extension candidates. Maximal degree in co-relation 146380. Up to 5781 conditions per place.). - TimeoutResultAtElement [Line: 956]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (258states, 1203/1232 universal loopers) in iteration 36,while PetriNetUnfolder was constructing finite prefix that currently has 148652 conditions, 9873 events (1875/9872 cut-off events. For 687616/687918 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 42038 event pairs, 5 based on Foata normal form. 0/9796 useless extension candidates. Maximal degree in co-relation 146380. Up to 5781 conditions per place.). - TimeoutResultAtElement [Line: 960]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (258states, 1203/1232 universal loopers) in iteration 36,while PetriNetUnfolder was constructing finite prefix that currently has 148652 conditions, 9873 events (1875/9872 cut-off events. For 687616/687918 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 42038 event pairs, 5 based on Foata normal form. 0/9796 useless extension candidates. Maximal degree in co-relation 146380. Up to 5781 conditions per place.). - TimeoutResultAtElement [Line: 960]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (258states, 1203/1232 universal loopers) in iteration 36,while PetriNetUnfolder was constructing finite prefix that currently has 148652 conditions, 9873 events (1875/9872 cut-off events. For 687616/687918 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 42038 event pairs, 5 based on Foata normal form. 0/9796 useless extension candidates. Maximal degree in co-relation 146380. Up to 5781 conditions per place.). - TimeoutResultAtElement [Line: 1053]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (258states, 1203/1232 universal loopers) in iteration 36,while PetriNetUnfolder was constructing finite prefix that currently has 148652 conditions, 9873 events (1875/9872 cut-off events. For 687616/687918 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 42038 event pairs, 5 based on Foata normal form. 0/9796 useless extension candidates. Maximal degree in co-relation 146380. Up to 5781 conditions per place.). - TimeoutResultAtElement [Line: 1052]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (258states, 1203/1232 universal loopers) in iteration 36,while PetriNetUnfolder was constructing finite prefix that currently has 148652 conditions, 9873 events (1875/9872 cut-off events. For 687616/687918 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 42038 event pairs, 5 based on Foata normal form. 0/9796 useless extension candidates. Maximal degree in co-relation 146380. Up to 5781 conditions per place.). - TimeoutResultAtElement [Line: 1009]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (258states, 1203/1232 universal loopers) in iteration 36,while PetriNetUnfolder was constructing finite prefix that currently has 148652 conditions, 9873 events (1875/9872 cut-off events. For 687616/687918 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 42038 event pairs, 5 based on Foata normal form. 0/9796 useless extension candidates. Maximal degree in co-relation 146380. Up to 5781 conditions per place.). - TimeoutResultAtElement [Line: 1017]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (258states, 1203/1232 universal loopers) in iteration 36,while PetriNetUnfolder was constructing finite prefix that currently has 148652 conditions, 9873 events (1875/9872 cut-off events. For 687616/687918 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 42038 event pairs, 5 based on Foata normal form. 0/9796 useless extension candidates. Maximal degree in co-relation 146380. Up to 5781 conditions per place.). - TimeoutResultAtElement [Line: 1018]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (258states, 1203/1232 universal loopers) in iteration 36,while PetriNetUnfolder was constructing finite prefix that currently has 148652 conditions, 9873 events (1875/9872 cut-off events. For 687616/687918 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 42038 event pairs, 5 based on Foata normal form. 0/9796 useless extension candidates. Maximal degree in co-relation 146380. Up to 5781 conditions per place.). - TimeoutResultAtElement [Line: 980]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (258states, 1203/1232 universal loopers) in iteration 36,while PetriNetUnfolder was constructing finite prefix that currently has 148652 conditions, 9873 events (1875/9872 cut-off events. For 687616/687918 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 42038 event pairs, 5 based on Foata normal form. 0/9796 useless extension candidates. Maximal degree in co-relation 146380. Up to 5781 conditions per place.). - TimeoutResultAtElement [Line: 980]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (258states, 1203/1232 universal loopers) in iteration 36,while PetriNetUnfolder was constructing finite prefix that currently has 148652 conditions, 9873 events (1875/9872 cut-off events. For 687616/687918 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 42038 event pairs, 5 based on Foata normal form. 0/9796 useless extension candidates. Maximal degree in co-relation 146380. Up to 5781 conditions per place.). - TimeoutResultAtElement [Line: 981]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (258states, 1203/1232 universal loopers) in iteration 36,while PetriNetUnfolder was constructing finite prefix that currently has 148652 conditions, 9873 events (1875/9872 cut-off events. For 687616/687918 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 42038 event pairs, 5 based on Foata normal form. 0/9796 useless extension candidates. Maximal degree in co-relation 146380. Up to 5781 conditions per place.). - TimeoutResultAtElement [Line: 981]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (258states, 1203/1232 universal loopers) in iteration 36,while PetriNetUnfolder was constructing finite prefix that currently has 148652 conditions, 9873 events (1875/9872 cut-off events. For 687616/687918 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 42038 event pairs, 5 based on Foata normal form. 0/9796 useless extension candidates. Maximal degree in co-relation 146380. Up to 5781 conditions per place.). - TimeoutResultAtElement [Line: 982]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (258states, 1203/1232 universal loopers) in iteration 36,while PetriNetUnfolder was constructing finite prefix that currently has 148652 conditions, 9873 events (1875/9872 cut-off events. For 687616/687918 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 42038 event pairs, 5 based on Foata normal form. 0/9796 useless extension candidates. Maximal degree in co-relation 146380. Up to 5781 conditions per place.). - TimeoutResultAtElement [Line: 988]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (258states, 1203/1232 universal loopers) in iteration 36,while PetriNetUnfolder was constructing finite prefix that currently has 148652 conditions, 9873 events (1875/9872 cut-off events. For 687616/687918 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 42038 event pairs, 5 based on Foata normal form. 0/9796 useless extension candidates. Maximal degree in co-relation 146380. Up to 5781 conditions per place.). - TimeoutResultAtElement [Line: 984]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (258states, 1203/1232 universal loopers) in iteration 36,while PetriNetUnfolder was constructing finite prefix that currently has 148652 conditions, 9873 events (1875/9872 cut-off events. For 687616/687918 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 42038 event pairs, 5 based on Foata normal form. 0/9796 useless extension candidates. Maximal degree in co-relation 146380. Up to 5781 conditions per place.). - TimeoutResultAtElement [Line: 988]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (258states, 1203/1232 universal loopers) in iteration 36,while PetriNetUnfolder was constructing finite prefix that currently has 148652 conditions, 9873 events (1875/9872 cut-off events. For 687616/687918 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 42038 event pairs, 5 based on Foata normal form. 0/9796 useless extension candidates. Maximal degree in co-relation 146380. Up to 5781 conditions per place.). - TimeoutResultAtElement [Line: 1015]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (258states, 1203/1232 universal loopers) in iteration 36,while PetriNetUnfolder was constructing finite prefix that currently has 148652 conditions, 9873 events (1875/9872 cut-off events. For 687616/687918 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 42038 event pairs, 5 based on Foata normal form. 0/9796 useless extension candidates. Maximal degree in co-relation 146380. Up to 5781 conditions per place.). - TimeoutResultAtElement [Line: 1027]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (258states, 1203/1232 universal loopers) in iteration 36,while PetriNetUnfolder was constructing finite prefix that currently has 148652 conditions, 9873 events (1875/9872 cut-off events. For 687616/687918 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 42038 event pairs, 5 based on Foata normal form. 0/9796 useless extension candidates. Maximal degree in co-relation 146380. Up to 5781 conditions per place.). - TimeoutResultAtElement [Line: 1036]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (258states, 1203/1232 universal loopers) in iteration 36,while PetriNetUnfolder was constructing finite prefix that currently has 148652 conditions, 9873 events (1875/9872 cut-off events. For 687616/687918 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 42038 event pairs, 5 based on Foata normal form. 0/9796 useless extension candidates. Maximal degree in co-relation 146380. Up to 5781 conditions per place.). - TimeoutResultAtElement [Line: 1037]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (258states, 1203/1232 universal loopers) in iteration 36,while PetriNetUnfolder was constructing finite prefix that currently has 148652 conditions, 9873 events (1875/9872 cut-off events. For 687616/687918 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 42038 event pairs, 5 based on Foata normal form. 0/9796 useless extension candidates. Maximal degree in co-relation 146380. Up to 5781 conditions per place.). - TimeoutResultAtElement [Line: 960]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (258states, 1203/1232 universal loopers) in iteration 36,while PetriNetUnfolder was constructing finite prefix that currently has 148652 conditions, 9873 events (1875/9872 cut-off events. For 687616/687918 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 42038 event pairs, 5 based on Foata normal form. 0/9796 useless extension candidates. Maximal degree in co-relation 146380. Up to 5781 conditions per place.). - TimeoutResultAtElement [Line: 960]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (258states, 1203/1232 universal loopers) in iteration 36,while PetriNetUnfolder was constructing finite prefix that currently has 148652 conditions, 9873 events (1875/9872 cut-off events. For 687616/687918 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 42038 event pairs, 5 based on Foata normal form. 0/9796 useless extension candidates. Maximal degree in co-relation 146380. Up to 5781 conditions per place.). - TimeoutResultAtElement [Line: 995]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (258states, 1203/1232 universal loopers) in iteration 36,while PetriNetUnfolder was constructing finite prefix that currently has 148652 conditions, 9873 events (1875/9872 cut-off events. For 687616/687918 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 42038 event pairs, 5 based on Foata normal form. 0/9796 useless extension candidates. Maximal degree in co-relation 146380. Up to 5781 conditions per place.). - TimeoutResultAtElement [Line: 995]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (258states, 1203/1232 universal loopers) in iteration 36,while PetriNetUnfolder was constructing finite prefix that currently has 148652 conditions, 9873 events (1875/9872 cut-off events. For 687616/687918 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 42038 event pairs, 5 based on Foata normal form. 0/9796 useless extension candidates. Maximal degree in co-relation 146380. Up to 5781 conditions per place.). - TimeoutResultAtElement [Line: 996]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (258states, 1203/1232 universal loopers) in iteration 36,while PetriNetUnfolder was constructing finite prefix that currently has 148652 conditions, 9873 events (1875/9872 cut-off events. For 687616/687918 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 42038 event pairs, 5 based on Foata normal form. 0/9796 useless extension candidates. Maximal degree in co-relation 146380. Up to 5781 conditions per place.). - TimeoutResultAtElement [Line: 997]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (258states, 1203/1232 universal loopers) in iteration 36,while PetriNetUnfolder was constructing finite prefix that currently has 148652 conditions, 9873 events (1875/9872 cut-off events. For 687616/687918 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 42038 event pairs, 5 based on Foata normal form. 0/9796 useless extension candidates. Maximal degree in co-relation 146380. Up to 5781 conditions per place.). - TimeoutResultAtElement [Line: 1002]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (258states, 1203/1232 universal loopers) in iteration 36,while PetriNetUnfolder was constructing finite prefix that currently has 148652 conditions, 9873 events (1875/9872 cut-off events. For 687616/687918 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 42038 event pairs, 5 based on Foata normal form. 0/9796 useless extension candidates. Maximal degree in co-relation 146380. Up to 5781 conditions per place.). - TimeoutResultAtElement [Line: 999]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (258states, 1203/1232 universal loopers) in iteration 36,while PetriNetUnfolder was constructing finite prefix that currently has 148652 conditions, 9873 events (1875/9872 cut-off events. For 687616/687918 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 42038 event pairs, 5 based on Foata normal form. 0/9796 useless extension candidates. Maximal degree in co-relation 146380. Up to 5781 conditions per place.). - TimeoutResultAtElement [Line: 1002]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (258states, 1203/1232 universal loopers) in iteration 36,while PetriNetUnfolder was constructing finite prefix that currently has 148652 conditions, 9873 events (1875/9872 cut-off events. For 687616/687918 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 42038 event pairs, 5 based on Foata normal form. 0/9796 useless extension candidates. Maximal degree in co-relation 146380. Up to 5781 conditions per place.). - TimeoutResultAtElement [Line: 1032]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (258states, 1203/1232 universal loopers) in iteration 36,while PetriNetUnfolder was constructing finite prefix that currently has 148652 conditions, 9873 events (1875/9872 cut-off events. For 687616/687918 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 42038 event pairs, 5 based on Foata normal form. 0/9796 useless extension candidates. Maximal degree in co-relation 146380. Up to 5781 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 1513 locations, 61 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.3s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 766.6s, OverallIterations: 36, TraceHistogramMax: 63, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 548.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3418 SdHoareTripleChecker+Valid, 7.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3418 mSDsluCounter, 3142 SdHoareTripleChecker+Invalid, 5.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 206 mSDsCounter, 239 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10167 IncrementalHoareTripleChecker+Invalid, 10406 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 239 mSolverCounterUnsat, 2936 mSDtfsCounter, 10167 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36855 GetRequests, 35975 SyntacticMatches, 0 SemanticMatches, 880 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41426 ImplicationChecksByTransitivity, 22.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=187784occurred in iteration=35, InterpolantAutomatonStates: 499, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 2.2s SsaConstructionTime, 6.8s SatisfiabilityAnalysisTime, 200.4s InterpolantComputationTime, 75164 NumberOfCodeBlocks, 66239 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 89921 ConstructedInterpolants, 0 QuantifiedInterpolants, 146344 SizeOfPredicates, 240 NumberOfNonLiveVariables, 57250 ConjunctsInSsa, 267 ConjunctsInUnsatCore, 53 InterpolantComputations, 30 PerfectInterpolantSequences, 211676/785116 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown