/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/goblint-regression/06-symbeq_02-funloop_norace.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 00:25:44,085 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 00:25:44,171 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:25:44,194 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 00:25:44,195 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 00:25:44,195 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 00:25:44,195 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 00:25:44,195 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 00:25:44,195 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 00:25:44,196 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 00:25:44,196 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 00:25:44,196 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 00:25:44,196 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 00:25:44,196 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 00:25:44,196 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 00:25:44,196 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 00:25:44,196 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 00:25:44,196 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 00:25:44,196 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 00:25:44,196 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 00:25:44,196 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 00:25:44,196 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 00:25:44,196 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 00:25:44,196 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 00:25:44,196 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 00:25:44,197 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 00:25:44,197 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 00:25:44,197 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 00:25:44,197 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 00:25:44,197 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 00:25:44,197 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 00:25:44,197 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 00:25:44,197 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:25:44,414 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 00:25:44,419 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 00:25:44,421 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 00:25:44,422 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 00:25:44,423 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 00:25:44,425 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/06-symbeq_02-funloop_norace.i [2025-03-15 00:25:46,244 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6af8fb927/25aab3a7e35f4160a9414c99d8c2be89/FLAG5af19acd6 [2025-03-15 00:25:46,503 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 00:25:46,504 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/06-symbeq_02-funloop_norace.i [2025-03-15 00:25:46,521 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6af8fb927/25aab3a7e35f4160a9414c99d8c2be89/FLAG5af19acd6 [2025-03-15 00:25:46,539 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6af8fb927/25aab3a7e35f4160a9414c99d8c2be89 [2025-03-15 00:25:46,541 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 00:25:46,542 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 00:25:46,543 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 00:25:46,543 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 00:25:46,547 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 00:25:46,548 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 12:25:46" (1/1) ... [2025-03-15 00:25:46,549 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bc96abe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:25:46, skipping insertion in model container [2025-03-15 00:25:46,549 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 12:25:46" (1/1) ... [2025-03-15 00:25:46,579 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 00:25:46,827 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 00:25:46,858 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 00:25:46,888 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 00:25:46,941 INFO L204 MainTranslator]: Completed translation [2025-03-15 00:25:46,942 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:25:46 WrapperNode [2025-03-15 00:25:46,942 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 00:25:46,944 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 00:25:46,944 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 00:25:46,944 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 00:25:46,948 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:25:46" (1/1) ... [2025-03-15 00:25:46,959 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:25:46" (1/1) ... [2025-03-15 00:25:46,982 INFO L138 Inliner]: procedures = 263, calls = 70, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 147 [2025-03-15 00:25:46,982 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 00:25:46,983 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 00:25:46,983 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 00:25:46,983 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 00:25:46,989 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:25:46" (1/1) ... [2025-03-15 00:25:46,989 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:25:46" (1/1) ... [2025-03-15 00:25:46,992 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:25:46" (1/1) ... [2025-03-15 00:25:46,992 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:25:46" (1/1) ... [2025-03-15 00:25:47,001 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:25:46" (1/1) ... [2025-03-15 00:25:47,002 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:25:46" (1/1) ... [2025-03-15 00:25:47,003 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:25:46" (1/1) ... [2025-03-15 00:25:47,004 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:25:46" (1/1) ... [2025-03-15 00:25:47,005 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:25:46" (1/1) ... [2025-03-15 00:25:47,006 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 00:25:47,012 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 00:25:47,012 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 00:25:47,012 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 00:25:47,013 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:25:46" (1/1) ... [2025-03-15 00:25:47,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 00:25:47,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:25:47,036 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:25:47,038 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:25:47,054 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-15 00:25:47,054 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-15 00:25:47,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-15 00:25:47,054 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-15 00:25:47,054 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 00:25:47,055 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-15 00:25:47,055 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-15 00:25:47,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 00:25:47,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 00:25:47,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 00:25:47,056 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:25:47,140 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 00:25:47,141 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 00:25:47,364 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 00:25:47,365 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 00:25:47,379 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 00:25:47,380 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-15 00:25:47,380 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 12:25:47 BoogieIcfgContainer [2025-03-15 00:25:47,380 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 00:25:47,382 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 00:25:47,382 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 00:25:47,386 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 00:25:47,386 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 12:25:46" (1/3) ... [2025-03-15 00:25:47,387 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@278660fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 12:25:47, skipping insertion in model container [2025-03-15 00:25:47,387 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:25:46" (2/3) ... [2025-03-15 00:25:47,387 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@278660fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 12:25:47, skipping insertion in model container [2025-03-15 00:25:47,387 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 12:25:47" (3/3) ... [2025-03-15 00:25:47,388 INFO L128 eAbstractionObserver]: Analyzing ICFG 06-symbeq_02-funloop_norace.i [2025-03-15 00:25:47,401 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 00:25:47,402 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG 06-symbeq_02-funloop_norace.i that has 2 procedures, 157 locations, 1 initial locations, 3 loop locations, and 4 error locations. [2025-03-15 00:25:47,402 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 00:25:47,468 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-15 00:25:47,505 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 00:25:47,518 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;@38bc4f98, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 00:25:47,519 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-15 00:25:47,569 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 00:25:47,570 INFO L124 PetriNetUnfolderBase]: 1/116 cut-off events. [2025-03-15 00:25:47,572 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 00:25:47,572 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:25:47,573 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] [2025-03-15 00:25:47,573 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:25:47,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:25:47,578 INFO L85 PathProgramCache]: Analyzing trace with hash 18307895, now seen corresponding path program 1 times [2025-03-15 00:25:47,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:25:47,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868427678] [2025-03-15 00:25:47,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:25:47,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:25:47,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:25:47,937 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:25:47,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:25:47,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868427678] [2025-03-15 00:25:47,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868427678] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:25:47,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:25:47,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 00:25:47,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281932026] [2025-03-15 00:25:47,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:25:47,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:25:47,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:25:47,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:25:47,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:25:47,964 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 159 [2025-03-15 00:25:47,968 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 159 transitions, 322 flow. Second operand has 3 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 0 states have call successors, (0), 0 states 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:25:47,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:25:47,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 159 [2025-03-15 00:25:47,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:25:48,055 INFO L124 PetriNetUnfolderBase]: 11/244 cut-off events. [2025-03-15 00:25:48,056 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-15 00:25:48,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 281 conditions, 244 events. 11/244 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 393 event pairs, 6 based on Foata normal form. 0/228 useless extension candidates. Maximal degree in co-relation 179. Up to 29 conditions per place. [2025-03-15 00:25:48,063 INFO L140 encePairwiseOnDemand]: 156/159 looper letters, 16 selfloop transitions, 2 changer transitions 0/162 dead transitions. [2025-03-15 00:25:48,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 162 transitions, 363 flow [2025-03-15 00:25:48,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:25:48,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:25:48,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 454 transitions. [2025-03-15 00:25:48,077 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9517819706498952 [2025-03-15 00:25:48,080 INFO L298 CegarLoopForPetriNet]: 160 programPoint places, 1 predicate places. [2025-03-15 00:25:48,080 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 162 transitions, 363 flow [2025-03-15 00:25:48,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 0 states have call successors, (0), 0 states 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:25:48,080 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:25:48,080 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] [2025-03-15 00:25:48,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 00:25:48,081 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:25:48,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:25:48,081 INFO L85 PathProgramCache]: Analyzing trace with hash 50563245, now seen corresponding path program 1 times [2025-03-15 00:25:48,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:25:48,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288057308] [2025-03-15 00:25:48,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:25:48,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:25:48,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:25:48,278 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:25:48,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:25:48,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288057308] [2025-03-15 00:25:48,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288057308] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 00:25:48,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [764008917] [2025-03-15 00:25:48,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:25:48,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 00:25:48,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:25:48,283 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:25:48,286 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:25:48,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:25:48,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-15 00:25:48,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 00:25:48,423 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:25:48,423 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 00:25:48,464 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:25:48,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [764008917] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 00:25:48,469 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 00:25:48,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-15 00:25:48,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564121167] [2025-03-15 00:25:48,469 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 00:25:48,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-15 00:25:48,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:25:48,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-15 00:25:48,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-15 00:25:48,475 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 159 [2025-03-15 00:25:48,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 162 transitions, 363 flow. Second operand has 10 states, 10 states have (on average 146.3) internal successors, (1463), 10 states have internal predecessors, (1463), 0 states have call successors, (0), 0 states 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:25:48,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:25:48,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 159 [2025-03-15 00:25:48,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:25:48,611 INFO L124 PetriNetUnfolderBase]: 11/251 cut-off events. [2025-03-15 00:25:48,611 INFO L125 PetriNetUnfolderBase]: For 16/22 co-relation queries the response was YES. [2025-03-15 00:25:48,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 334 conditions, 251 events. 11/251 cut-off events. For 16/22 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 388 event pairs, 6 based on Foata normal form. 0/235 useless extension candidates. Maximal degree in co-relation 198. Up to 34 conditions per place. [2025-03-15 00:25:48,613 INFO L140 encePairwiseOnDemand]: 153/159 looper letters, 17 selfloop transitions, 9 changer transitions 0/169 dead transitions. [2025-03-15 00:25:48,613 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 169 transitions, 439 flow [2025-03-15 00:25:48,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 00:25:48,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 00:25:48,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1324 transitions. [2025-03-15 00:25:48,618 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9252271139063591 [2025-03-15 00:25:48,618 INFO L298 CegarLoopForPetriNet]: 160 programPoint places, 9 predicate places. [2025-03-15 00:25:48,618 INFO L471 AbstractCegarLoop]: Abstraction has has 169 places, 169 transitions, 439 flow [2025-03-15 00:25:48,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 146.3) internal successors, (1463), 10 states have internal predecessors, (1463), 0 states have call successors, (0), 0 states 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:25:48,619 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:25:48,620 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-15 00:25:48,627 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:25:48,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 00:25:48,826 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:25:48,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:25:48,827 INFO L85 PathProgramCache]: Analyzing trace with hash -800441843, now seen corresponding path program 2 times [2025-03-15 00:25:48,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:25:48,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050527498] [2025-03-15 00:25:48,827 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 00:25:48,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:25:48,855 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 00:25:48,855 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:25:49,250 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-15 00:25:49,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:25:49,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050527498] [2025-03-15 00:25:49,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050527498] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:25:49,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:25:49,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:25:49,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053121661] [2025-03-15 00:25:49,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:25:49,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:25:49,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:25:49,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:25:49,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:25:49,253 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 159 [2025-03-15 00:25:49,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 169 transitions, 439 flow. Second operand has 6 states, 6 states have (on average 126.66666666666667) internal successors, (760), 6 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:25:49,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:25:49,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 159 [2025-03-15 00:25:49,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:25:49,581 INFO L124 PetriNetUnfolderBase]: 390/1435 cut-off events. [2025-03-15 00:25:49,581 INFO L125 PetriNetUnfolderBase]: For 313/325 co-relation queries the response was YES. [2025-03-15 00:25:49,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2485 conditions, 1435 events. 390/1435 cut-off events. For 313/325 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 8661 event pairs, 180 based on Foata normal form. 0/1302 useless extension candidates. Maximal degree in co-relation 2347. Up to 599 conditions per place. [2025-03-15 00:25:49,594 INFO L140 encePairwiseOnDemand]: 148/159 looper letters, 74 selfloop transitions, 22 changer transitions 0/231 dead transitions. [2025-03-15 00:25:49,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 231 transitions, 787 flow [2025-03-15 00:25:49,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:25:49,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:25:49,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 847 transitions. [2025-03-15 00:25:49,596 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8878406708595388 [2025-03-15 00:25:49,597 INFO L298 CegarLoopForPetriNet]: 160 programPoint places, 14 predicate places. [2025-03-15 00:25:49,597 INFO L471 AbstractCegarLoop]: Abstraction has has 174 places, 231 transitions, 787 flow [2025-03-15 00:25:49,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 126.66666666666667) internal successors, (760), 6 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:25:49,597 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:25:49,598 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-15 00:25:49,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-15 00:25:49,598 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:25:49,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:25:49,601 INFO L85 PathProgramCache]: Analyzing trace with hash -2000203992, now seen corresponding path program 1 times [2025-03-15 00:25:49,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:25:49,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970623343] [2025-03-15 00:25:49,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:25:49,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:25:49,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:25:49,750 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:25:49,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:25:49,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970623343] [2025-03-15 00:25:49,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970623343] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 00:25:49,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [635242953] [2025-03-15 00:25:49,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:25:49,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 00:25:49,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:25:49,754 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:25:49,755 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:25:49,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:25:49,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-15 00:25:49,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 00:25:49,885 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:25:49,885 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 00:25:49,980 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:25:49,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [635242953] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 00:25:49,980 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 00:25:49,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-03-15 00:25:49,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757611697] [2025-03-15 00:25:49,980 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 00:25:49,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-15 00:25:49,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:25:49,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-15 00:25:49,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-15 00:25:49,989 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 159 [2025-03-15 00:25:49,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 231 transitions, 787 flow. Second operand has 18 states, 18 states have (on average 146.38888888888889) internal successors, (2635), 18 states have internal predecessors, (2635), 0 states have call successors, (0), 0 states 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:25:49,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:25:49,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 159 [2025-03-15 00:25:49,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:25:50,325 INFO L124 PetriNetUnfolderBase]: 390/1455 cut-off events. [2025-03-15 00:25:50,325 INFO L125 PetriNetUnfolderBase]: For 632/652 co-relation queries the response was YES. [2025-03-15 00:25:50,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2701 conditions, 1455 events. 390/1455 cut-off events. For 632/652 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 8701 event pairs, 180 based on Foata normal form. 0/1322 useless extension candidates. Maximal degree in co-relation 2465. Up to 599 conditions per place. [2025-03-15 00:25:50,335 INFO L140 encePairwiseOnDemand]: 153/159 looper letters, 33 selfloop transitions, 21 changer transitions 0/251 dead transitions. [2025-03-15 00:25:50,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 251 transitions, 1007 flow [2025-03-15 00:25:50,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-15 00:25:50,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-15 00:25:50,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3074 transitions. [2025-03-15 00:25:50,340 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9206349206349206 [2025-03-15 00:25:50,341 INFO L298 CegarLoopForPetriNet]: 160 programPoint places, 34 predicate places. [2025-03-15 00:25:50,341 INFO L471 AbstractCegarLoop]: Abstraction has has 194 places, 251 transitions, 1007 flow [2025-03-15 00:25:50,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 146.38888888888889) internal successors, (2635), 18 states have internal predecessors, (2635), 0 states have call successors, (0), 0 states 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:25:50,343 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:25:50,343 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-15 00:25:50,349 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:25:50,543 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,SelfDestructingSolverStorable3 [2025-03-15 00:25:50,544 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:25:50,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:25:50,544 INFO L85 PathProgramCache]: Analyzing trace with hash -716699160, now seen corresponding path program 2 times [2025-03-15 00:25:50,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:25:50,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393398697] [2025-03-15 00:25:50,544 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 00:25:50,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:25:50,562 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 00:25:50,562 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:25:50,831 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-15 00:25:50,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:25:50,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393398697] [2025-03-15 00:25:50,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393398697] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:25:50,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:25:50,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:25:50,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305672659] [2025-03-15 00:25:50,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:25:50,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:25:50,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:25:50,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:25:50,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:25:50,833 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 159 [2025-03-15 00:25:50,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 251 transitions, 1007 flow. Second operand has 6 states, 6 states have (on average 126.66666666666667) internal successors, (760), 6 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:25:50,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:25:50,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 159 [2025-03-15 00:25:50,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:25:51,195 INFO L124 PetriNetUnfolderBase]: 589/1896 cut-off events. [2025-03-15 00:25:51,195 INFO L125 PetriNetUnfolderBase]: For 1120/1198 co-relation queries the response was YES. [2025-03-15 00:25:51,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4520 conditions, 1896 events. 589/1896 cut-off events. For 1120/1198 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 11733 event pairs, 191 based on Foata normal form. 0/1741 useless extension candidates. Maximal degree in co-relation 4282. Up to 793 conditions per place. [2025-03-15 00:25:51,204 INFO L140 encePairwiseOnDemand]: 148/159 looper letters, 147 selfloop transitions, 50 changer transitions 0/353 dead transitions. [2025-03-15 00:25:51,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 353 transitions, 1855 flow [2025-03-15 00:25:51,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:25:51,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:25:51,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 847 transitions. [2025-03-15 00:25:51,206 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8878406708595388 [2025-03-15 00:25:51,206 INFO L298 CegarLoopForPetriNet]: 160 programPoint places, 39 predicate places. [2025-03-15 00:25:51,206 INFO L471 AbstractCegarLoop]: Abstraction has has 199 places, 353 transitions, 1855 flow [2025-03-15 00:25:51,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 126.66666666666667) internal successors, (760), 6 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:25:51,207 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:25:51,207 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-15 00:25:51,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-15 00:25:51,207 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:25:51,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:25:51,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1826944472, now seen corresponding path program 1 times [2025-03-15 00:25:51,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:25:51,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542095068] [2025-03-15 00:25:51,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:25:51,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:25:51,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:25:51,472 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:25:51,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:25:51,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542095068] [2025-03-15 00:25:51,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542095068] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 00:25:51,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083580254] [2025-03-15 00:25:51,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:25:51,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 00:25:51,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:25:51,474 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:25:51,476 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:25:51,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:25:51,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-15 00:25:51,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 00:25:51,615 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:25:51,615 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 00:25:51,805 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:25:51,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1083580254] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 00:25:51,805 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 00:25:51,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-03-15 00:25:51,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054492467] [2025-03-15 00:25:51,807 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 00:25:51,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-15 00:25:51,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:25:51,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-15 00:25:51,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-03-15 00:25:51,813 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 159 [2025-03-15 00:25:51,816 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 353 transitions, 1855 flow. Second operand has 23 states, 23 states have (on average 146.52173913043478) internal successors, (3370), 23 states have internal predecessors, (3370), 0 states have call successors, (0), 0 states 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:25:51,816 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:25:51,816 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 159 [2025-03-15 00:25:51,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:25:52,234 INFO L124 PetriNetUnfolderBase]: 589/1911 cut-off events. [2025-03-15 00:25:52,234 INFO L125 PetriNetUnfolderBase]: For 1731/1817 co-relation queries the response was YES. [2025-03-15 00:25:52,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4766 conditions, 1911 events. 589/1911 cut-off events. For 1731/1817 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 11698 event pairs, 191 based on Foata normal form. 0/1756 useless extension candidates. Maximal degree in co-relation 4414. Up to 793 conditions per place. [2025-03-15 00:25:52,243 INFO L140 encePairwiseOnDemand]: 153/159 looper letters, 47 selfloop transitions, 30 changer transitions 0/368 dead transitions. [2025-03-15 00:25:52,243 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 368 transitions, 2123 flow [2025-03-15 00:25:52,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-15 00:25:52,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-15 00:25:52,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 4384 transitions. [2025-03-15 00:25:52,251 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.919077568134172 [2025-03-15 00:25:52,252 INFO L298 CegarLoopForPetriNet]: 160 programPoint places, 68 predicate places. [2025-03-15 00:25:52,252 INFO L471 AbstractCegarLoop]: Abstraction has has 228 places, 368 transitions, 2123 flow [2025-03-15 00:25:52,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 146.52173913043478) internal successors, (3370), 23 states have internal predecessors, (3370), 0 states have call successors, (0), 0 states 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:25:52,253 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:25:52,253 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:52,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-15 00:25:52,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 00:25:52,458 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:25:52,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:25:52,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1667208809, now seen corresponding path program 2 times [2025-03-15 00:25:52,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:25:52,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631030811] [2025-03-15 00:25:52,459 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 00:25:52,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:25:52,474 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 00:25:52,474 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:25:52,688 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-15 00:25:52,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:25:52,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631030811] [2025-03-15 00:25:52,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631030811] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:25:52,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:25:52,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:25:52,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648056822] [2025-03-15 00:25:52,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:25:52,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:25:52,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:25:52,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:25:52,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:25:52,689 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 159 [2025-03-15 00:25:52,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 368 transitions, 2123 flow. Second operand has 6 states, 6 states have (on average 125.83333333333333) internal successors, (755), 6 states have internal predecessors, (755), 0 states have call successors, (0), 0 states 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:25:52,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:25:52,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 159 [2025-03-15 00:25:52,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:25:53,097 INFO L124 PetriNetUnfolderBase]: 741/2275 cut-off events. [2025-03-15 00:25:53,097 INFO L125 PetriNetUnfolderBase]: For 2570/2752 co-relation queries the response was YES. [2025-03-15 00:25:53,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6996 conditions, 2275 events. 741/2275 cut-off events. For 2570/2752 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 14558 event pairs, 176 based on Foata normal form. 0/2104 useless extension candidates. Maximal degree in co-relation 6642. Up to 1153 conditions per place. [2025-03-15 00:25:53,106 INFO L140 encePairwiseOnDemand]: 144/159 looper letters, 211 selfloop transitions, 61 changer transitions 0/441 dead transitions. [2025-03-15 00:25:53,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 441 transitions, 3165 flow [2025-03-15 00:25:53,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:25:53,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:25:53,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 836 transitions. [2025-03-15 00:25:53,108 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8763102725366876 [2025-03-15 00:25:53,109 INFO L298 CegarLoopForPetriNet]: 160 programPoint places, 73 predicate places. [2025-03-15 00:25:53,109 INFO L471 AbstractCegarLoop]: Abstraction has has 233 places, 441 transitions, 3165 flow [2025-03-15 00:25:53,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 125.83333333333333) internal successors, (755), 6 states have internal predecessors, (755), 0 states have call successors, (0), 0 states 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:25:53,109 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:25:53,109 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:53,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-15 00:25:53,110 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:25:53,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:25:53,110 INFO L85 PathProgramCache]: Analyzing trace with hash -226856996, now seen corresponding path program 1 times [2025-03-15 00:25:53,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:25:53,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248088579] [2025-03-15 00:25:53,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:25:53,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:25:53,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:25:53,425 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-15 00:25:53,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:25:53,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248088579] [2025-03-15 00:25:53,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248088579] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:25:53,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:25:53,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:25:53,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299373247] [2025-03-15 00:25:53,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:25:53,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:25:53,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:25:53,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:25:53,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:25:53,427 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 159 [2025-03-15 00:25:53,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 441 transitions, 3165 flow. Second operand has 6 states, 6 states have (on average 125.83333333333333) internal successors, (755), 6 states have internal predecessors, (755), 0 states have call successors, (0), 0 states 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:25:53,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:25:53,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 159 [2025-03-15 00:25:53,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:25:53,868 INFO L124 PetriNetUnfolderBase]: 920/2699 cut-off events. [2025-03-15 00:25:53,868 INFO L125 PetriNetUnfolderBase]: For 3572/3726 co-relation queries the response was YES. [2025-03-15 00:25:53,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9899 conditions, 2699 events. 920/2699 cut-off events. For 3572/3726 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 17896 event pairs, 171 based on Foata normal form. 0/2512 useless extension candidates. Maximal degree in co-relation 9543. Up to 1404 conditions per place. [2025-03-15 00:25:53,885 INFO L140 encePairwiseOnDemand]: 144/159 looper letters, 273 selfloop transitions, 79 changer transitions 0/522 dead transitions. [2025-03-15 00:25:53,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 522 transitions, 4575 flow [2025-03-15 00:25:53,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:25:53,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:25:53,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 836 transitions. [2025-03-15 00:25:53,887 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8763102725366876 [2025-03-15 00:25:53,888 INFO L298 CegarLoopForPetriNet]: 160 programPoint places, 78 predicate places. [2025-03-15 00:25:53,889 INFO L471 AbstractCegarLoop]: Abstraction has has 238 places, 522 transitions, 4575 flow [2025-03-15 00:25:53,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 125.83333333333333) internal successors, (755), 6 states have internal predecessors, (755), 0 states have call successors, (0), 0 states 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:25:53,889 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:25:53,889 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:53,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-15 00:25:53,889 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:25:53,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:25:53,891 INFO L85 PathProgramCache]: Analyzing trace with hash 316280311, now seen corresponding path program 1 times [2025-03-15 00:25:53,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:25:53,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966562255] [2025-03-15 00:25:53,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:25:53,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:25:53,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:25:54,297 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-15 00:25:54,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:25:54,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966562255] [2025-03-15 00:25:54,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966562255] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:25:54,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:25:54,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-15 00:25:54,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398688404] [2025-03-15 00:25:54,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:25:54,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 00:25:54,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:25:54,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 00:25:54,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-15 00:25:54,299 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 159 [2025-03-15 00:25:54,299 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 522 transitions, 4575 flow. Second operand has 9 states, 9 states have (on average 50.22222222222222) internal successors, (452), 9 states have internal predecessors, (452), 0 states have call successors, (0), 0 states 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:25:54,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:25:54,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 159 [2025-03-15 00:25:54,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:25:55,753 INFO L124 PetriNetUnfolderBase]: 3278/7888 cut-off events. [2025-03-15 00:25:55,753 INFO L125 PetriNetUnfolderBase]: For 17106/17135 co-relation queries the response was YES. [2025-03-15 00:25:55,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35071 conditions, 7888 events. 3278/7888 cut-off events. For 17106/17135 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 57291 event pairs, 609 based on Foata normal form. 14/7412 useless extension candidates. Maximal degree in co-relation 34640. Up to 4199 conditions per place. [2025-03-15 00:25:55,799 INFO L140 encePairwiseOnDemand]: 144/159 looper letters, 1164 selfloop transitions, 39 changer transitions 3/1284 dead transitions. [2025-03-15 00:25:55,799 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 1284 transitions, 14691 flow [2025-03-15 00:25:55,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 00:25:55,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 00:25:55,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 672 transitions. [2025-03-15 00:25:55,801 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.469601677148847 [2025-03-15 00:25:55,802 INFO L298 CegarLoopForPetriNet]: 160 programPoint places, 86 predicate places. [2025-03-15 00:25:55,802 INFO L471 AbstractCegarLoop]: Abstraction has has 246 places, 1284 transitions, 14691 flow [2025-03-15 00:25:55,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 50.22222222222222) internal successors, (452), 9 states have internal predecessors, (452), 0 states have call successors, (0), 0 states 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:25:55,802 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:25:55,802 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:55,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-15 00:25:55,802 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:25:55,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:25:55,803 INFO L85 PathProgramCache]: Analyzing trace with hash 285785207, now seen corresponding path program 2 times [2025-03-15 00:25:55,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:25:55,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122958652] [2025-03-15 00:25:55,803 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 00:25:55,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:25:55,827 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 00:25:55,827 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:25:56,079 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-15 00:25:56,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:25:56,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122958652] [2025-03-15 00:25:56,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122958652] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:25:56,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:25:56,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-15 00:25:56,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084351073] [2025-03-15 00:25:56,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:25:56,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 00:25:56,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:25:56,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 00:25:56,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-15 00:25:56,081 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 159 [2025-03-15 00:25:56,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 1284 transitions, 14691 flow. Second operand has 9 states, 9 states have (on average 50.22222222222222) internal successors, (452), 9 states have internal predecessors, (452), 0 states have call successors, (0), 0 states 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:25:56,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:25:56,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 159 [2025-03-15 00:25:56,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:25:59,208 INFO L124 PetriNetUnfolderBase]: 6213/14732 cut-off events. [2025-03-15 00:25:59,208 INFO L125 PetriNetUnfolderBase]: For 39880/40029 co-relation queries the response was YES. [2025-03-15 00:25:59,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77769 conditions, 14732 events. 6213/14732 cut-off events. For 39880/40029 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 118704 event pairs, 705 based on Foata normal form. 28/13918 useless extension candidates. Maximal degree in co-relation 77263. Up to 7791 conditions per place. [2025-03-15 00:25:59,289 INFO L140 encePairwiseOnDemand]: 145/159 looper letters, 2459 selfloop transitions, 98 changer transitions 9/2644 dead transitions. [2025-03-15 00:25:59,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 2644 transitions, 36131 flow [2025-03-15 00:25:59,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 00:25:59,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 00:25:59,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 671 transitions. [2025-03-15 00:25:59,291 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.4689028651292802 [2025-03-15 00:25:59,295 INFO L298 CegarLoopForPetriNet]: 160 programPoint places, 94 predicate places. [2025-03-15 00:25:59,295 INFO L471 AbstractCegarLoop]: Abstraction has has 254 places, 2644 transitions, 36131 flow [2025-03-15 00:25:59,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 50.22222222222222) internal successors, (452), 9 states have internal predecessors, (452), 0 states have call successors, (0), 0 states 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:25:59,295 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:25:59,295 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:59,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-15 00:25:59,296 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:25:59,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:25:59,296 INFO L85 PathProgramCache]: Analyzing trace with hash 6419098, now seen corresponding path program 1 times [2025-03-15 00:25:59,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:25:59,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536558953] [2025-03-15 00:25:59,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:25:59,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:25:59,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:25:59,636 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-15 00:25:59,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:25:59,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536558953] [2025-03-15 00:25:59,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536558953] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:25:59,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:25:59,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-15 00:25:59,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692734180] [2025-03-15 00:25:59,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:25:59,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 00:25:59,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:25:59,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 00:25:59,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-15 00:25:59,637 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 159 [2025-03-15 00:25:59,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 2644 transitions, 36131 flow. Second operand has 9 states, 9 states have (on average 50.22222222222222) internal successors, (452), 9 states have internal predecessors, (452), 0 states have call successors, (0), 0 states 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:25:59,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:25:59,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 159 [2025-03-15 00:25:59,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:26:05,398 INFO L124 PetriNetUnfolderBase]: 7062/16750 cut-off events. [2025-03-15 00:26:05,398 INFO L125 PetriNetUnfolderBase]: For 55552/55840 co-relation queries the response was YES. [2025-03-15 00:26:05,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102069 conditions, 16750 events. 7062/16750 cut-off events. For 55552/55840 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 137531 event pairs, 751 based on Foata normal form. 51/15866 useless extension candidates. Maximal degree in co-relation 101488. Up to 8968 conditions per place. [2025-03-15 00:26:05,497 INFO L140 encePairwiseOnDemand]: 145/159 looper letters, 2984 selfloop transitions, 77 changer transitions 9/3148 dead transitions. [2025-03-15 00:26:05,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 3148 transitions, 49479 flow [2025-03-15 00:26:05,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 00:26:05,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 00:26:05,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 693 transitions. [2025-03-15 00:26:05,499 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.48427672955974843 [2025-03-15 00:26:05,499 INFO L298 CegarLoopForPetriNet]: 160 programPoint places, 102 predicate places. [2025-03-15 00:26:05,500 INFO L471 AbstractCegarLoop]: Abstraction has has 262 places, 3148 transitions, 49479 flow [2025-03-15 00:26:05,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 50.22222222222222) internal successors, (452), 9 states have internal predecessors, (452), 0 states have call successors, (0), 0 states 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:26:05,500 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:26:05,500 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:05,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-15 00:26:05,500 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:26:05,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:26:05,501 INFO L85 PathProgramCache]: Analyzing trace with hash -666626790, now seen corresponding path program 2 times [2025-03-15 00:26:05,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:26:05,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899050701] [2025-03-15 00:26:05,501 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 00:26:05,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:26:05,518 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 00:26:05,518 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:26:05,741 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-15 00:26:05,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:26:05,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899050701] [2025-03-15 00:26:05,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899050701] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:26:05,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:26:05,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-15 00:26:05,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128325083] [2025-03-15 00:26:05,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:26:05,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 00:26:05,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:26:05,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 00:26:05,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-15 00:26:05,743 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 159 [2025-03-15 00:26:05,743 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 3148 transitions, 49479 flow. Second operand has 9 states, 9 states have (on average 50.22222222222222) internal successors, (452), 9 states have internal predecessors, (452), 0 states have call successors, (0), 0 states 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:26:05,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:26:05,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 159 [2025-03-15 00:26:05,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:26:12,494 INFO L124 PetriNetUnfolderBase]: 7062/16768 cut-off events. [2025-03-15 00:26:12,495 INFO L125 PetriNetUnfolderBase]: For 67711/68151 co-relation queries the response was YES. [2025-03-15 00:26:12,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115573 conditions, 16768 events. 7062/16768 cut-off events. For 67711/68151 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 137843 event pairs, 763 based on Foata normal form. 72/15906 useless extension candidates. Maximal degree in co-relation 114917. Up to 8978 conditions per place. [2025-03-15 00:26:12,595 INFO L140 encePairwiseOnDemand]: 144/159 looper letters, 2996 selfloop transitions, 78 changer transitions 9/3161 dead transitions. [2025-03-15 00:26:12,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 3161 transitions, 55853 flow [2025-03-15 00:26:12,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 00:26:12,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 00:26:12,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 691 transitions. [2025-03-15 00:26:12,597 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.48287910552061497 [2025-03-15 00:26:12,597 INFO L298 CegarLoopForPetriNet]: 160 programPoint places, 110 predicate places. [2025-03-15 00:26:12,597 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 3161 transitions, 55853 flow [2025-03-15 00:26:12,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 50.22222222222222) internal successors, (452), 9 states have internal predecessors, (452), 0 states have call successors, (0), 0 states 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:26:12,598 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:26:12,598 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:12,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-15 00:26:12,598 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:26:12,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:26:12,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1372988068, now seen corresponding path program 3 times [2025-03-15 00:26:12,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:26:12,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459020637] [2025-03-15 00:26:12,599 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-15 00:26:12,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:26:12,618 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-15 00:26:12,618 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:26:12,779 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-15 00:26:12,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:26:12,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459020637] [2025-03-15 00:26:12,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459020637] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:26:12,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:26:12,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-15 00:26:12,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912401172] [2025-03-15 00:26:12,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:26:12,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 00:26:12,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:26:12,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 00:26:12,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-15 00:26:12,781 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 159 [2025-03-15 00:26:12,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 3161 transitions, 55853 flow. Second operand has 9 states, 9 states have (on average 50.22222222222222) internal successors, (452), 9 states have internal predecessors, (452), 0 states have call successors, (0), 0 states 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:26:12,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:26:12,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 159 [2025-03-15 00:26:12,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:26:18,877 INFO L124 PetriNetUnfolderBase]: 6376/15192 cut-off events. [2025-03-15 00:26:18,877 INFO L125 PetriNetUnfolderBase]: For 74361/74907 co-relation queries the response was YES. [2025-03-15 00:26:18,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116599 conditions, 15192 events. 6376/15192 cut-off events. For 74361/74907 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 122865 event pairs, 711 based on Foata normal form. 88/14440 useless extension candidates. Maximal degree in co-relation 115868. Up to 8037 conditions per place. [2025-03-15 00:26:18,971 INFO L140 encePairwiseOnDemand]: 143/159 looper letters, 2619 selfloop transitions, 55 changer transitions 9/2761 dead transitions. [2025-03-15 00:26:18,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 2761 transitions, 53771 flow [2025-03-15 00:26:18,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 00:26:18,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 00:26:18,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 668 transitions. [2025-03-15 00:26:18,973 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.46680642907058 [2025-03-15 00:26:18,973 INFO L298 CegarLoopForPetriNet]: 160 programPoint places, 118 predicate places. [2025-03-15 00:26:18,973 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 2761 transitions, 53771 flow [2025-03-15 00:26:18,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 50.22222222222222) internal successors, (452), 9 states have internal predecessors, (452), 0 states have call successors, (0), 0 states 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:26:18,973 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:26:18,974 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:18,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-15 00:26:18,974 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:26:18,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:26:18,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1759375202, now seen corresponding path program 4 times [2025-03-15 00:26:18,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:26:18,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169537158] [2025-03-15 00:26:18,974 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-15 00:26:18,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:26:19,002 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-15 00:26:19,005 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:26:19,399 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-15 00:26:19,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:26:19,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169537158] [2025-03-15 00:26:19,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169537158] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:26:19,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:26:19,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-15 00:26:19,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320710694] [2025-03-15 00:26:19,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:26:19,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-15 00:26:19,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:26:19,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-15 00:26:19,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-15 00:26:19,401 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 159 [2025-03-15 00:26:19,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 2761 transitions, 53771 flow. Second operand has 10 states, 10 states have (on average 49.2) internal successors, (492), 10 states have internal predecessors, (492), 0 states have call successors, (0), 0 states 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:26:19,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:26:19,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 159 [2025-03-15 00:26:19,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:26:26,289 INFO L124 PetriNetUnfolderBase]: 7312/17404 cut-off events. [2025-03-15 00:26:26,289 INFO L125 PetriNetUnfolderBase]: For 102616/103486 co-relation queries the response was YES. [2025-03-15 00:26:26,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147662 conditions, 17404 events. 7312/17404 cut-off events. For 102616/103486 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 143861 event pairs, 745 based on Foata normal form. 53/16518 useless extension candidates. Maximal degree in co-relation 146856. Up to 9272 conditions per place. [2025-03-15 00:26:26,403 INFO L140 encePairwiseOnDemand]: 144/159 looper letters, 3158 selfloop transitions, 79 changer transitions 9/3324 dead transitions. [2025-03-15 00:26:26,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 3324 transitions, 71563 flow [2025-03-15 00:26:26,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-15 00:26:26,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-15 00:26:26,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 748 transitions. [2025-03-15 00:26:26,404 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.47044025157232705 [2025-03-15 00:26:26,405 INFO L298 CegarLoopForPetriNet]: 160 programPoint places, 127 predicate places. [2025-03-15 00:26:26,405 INFO L471 AbstractCegarLoop]: Abstraction has has 287 places, 3324 transitions, 71563 flow [2025-03-15 00:26:26,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 49.2) internal successors, (492), 10 states have internal predecessors, (492), 0 states have call successors, (0), 0 states 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:26:26,405 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:26:26,405 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:26,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-15 00:26:26,405 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:26:26,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:26:26,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1304311522, now seen corresponding path program 5 times [2025-03-15 00:26:26,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:26:26,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101979177] [2025-03-15 00:26:26,406 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-15 00:26:26,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:26:26,423 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-15 00:26:26,424 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:26:26,885 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2025-03-15 00:26:26,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:26:26,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101979177] [2025-03-15 00:26:26,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101979177] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 00:26:26,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [87282851] [2025-03-15 00:26:26,885 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-15 00:26:26,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 00:26:26,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:26:26,887 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:26:26,889 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:26:27,005 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-15 00:26:27,005 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:26:27,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-15 00:26:27,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 00:26:27,246 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 13 treesize of output 9 [2025-03-15 00:26:27,296 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-15 00:26:27,296 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-15 00:26:27,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [87282851] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:26:27,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-15 00:26:27,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2025-03-15 00:26:27,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008740690] [2025-03-15 00:26:27,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:26:27,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-15 00:26:27,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:26:27,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-15 00:26:27,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2025-03-15 00:26:27,298 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 159 [2025-03-15 00:26:27,299 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 3324 transitions, 71563 flow. Second operand has 10 states, 10 states have (on average 49.2) internal successors, (492), 10 states have internal predecessors, (492), 0 states have call successors, (0), 0 states 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:26:27,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:26:27,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 159 [2025-03-15 00:26:27,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:26:35,479 INFO L124 PetriNetUnfolderBase]: 8025/19122 cut-off events. [2025-03-15 00:26:35,479 INFO L125 PetriNetUnfolderBase]: For 134966/136014 co-relation queries the response was YES. [2025-03-15 00:26:35,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177548 conditions, 19122 events. 8025/19122 cut-off events. For 134966/136014 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 161207 event pairs, 803 based on Foata normal form. 69/18165 useless extension candidates. Maximal degree in co-relation 176667. Up to 10309 conditions per place. [2025-03-15 00:26:35,629 INFO L140 encePairwiseOnDemand]: 143/159 looper letters, 3596 selfloop transitions, 82 changer transitions 9/3765 dead transitions. [2025-03-15 00:26:35,630 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 3765 transitions, 88863 flow [2025-03-15 00:26:35,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-15 00:26:35,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-15 00:26:35,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 766 transitions. [2025-03-15 00:26:35,631 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.4817610062893082 [2025-03-15 00:26:35,631 INFO L298 CegarLoopForPetriNet]: 160 programPoint places, 136 predicate places. [2025-03-15 00:26:35,631 INFO L471 AbstractCegarLoop]: Abstraction has has 296 places, 3765 transitions, 88863 flow [2025-03-15 00:26:35,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 49.2) internal successors, (492), 10 states have internal predecessors, (492), 0 states have call successors, (0), 0 states 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:26:35,631 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:26:35,632 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:35,638 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:26:35,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-15 00:26:35,836 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:26:35,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:26:35,837 INFO L85 PathProgramCache]: Analyzing trace with hash -2126821074, now seen corresponding path program 6 times [2025-03-15 00:26:35,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:26:35,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288608753] [2025-03-15 00:26:35,837 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-15 00:26:35,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:26:35,851 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-15 00:26:35,851 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:26:35,989 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-15 00:26:35,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:26:35,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288608753] [2025-03-15 00:26:35,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288608753] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:26:35,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:26:35,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-15 00:26:35,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131589589] [2025-03-15 00:26:35,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:26:35,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 00:26:35,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:26:35,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 00:26:35,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-15 00:26:35,991 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 159 [2025-03-15 00:26:35,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 3765 transitions, 88863 flow. Second operand has 9 states, 9 states have (on average 50.22222222222222) internal successors, (452), 9 states have internal predecessors, (452), 0 states have call successors, (0), 0 states 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:26:35,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:26:35,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 159 [2025-03-15 00:26:35,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:26:44,648 INFO L124 PetriNetUnfolderBase]: 7389/17654 cut-off events. [2025-03-15 00:26:44,648 INFO L125 PetriNetUnfolderBase]: For 145967/147184 co-relation queries the response was YES. [2025-03-15 00:26:44,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177942 conditions, 17654 events. 7389/17654 cut-off events. For 145967/147184 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 146512 event pairs, 751 based on Foata normal form. 100/16818 useless extension candidates. Maximal degree in co-relation 176986. Up to 9411 conditions per place. [2025-03-15 00:26:44,789 INFO L140 encePairwiseOnDemand]: 143/159 looper letters, 3246 selfloop transitions, 57 changer transitions 9/3390 dead transitions. [2025-03-15 00:26:44,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 3390 transitions, 86235 flow [2025-03-15 00:26:44,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 00:26:44,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 00:26:44,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 705 transitions. [2025-03-15 00:26:44,791 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.49266247379454925 [2025-03-15 00:26:44,791 INFO L298 CegarLoopForPetriNet]: 160 programPoint places, 144 predicate places. [2025-03-15 00:26:44,791 INFO L471 AbstractCegarLoop]: Abstraction has has 304 places, 3390 transitions, 86235 flow [2025-03-15 00:26:44,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 50.22222222222222) internal successors, (452), 9 states have internal predecessors, (452), 0 states have call successors, (0), 0 states 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:26:44,791 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:26:44,792 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:44,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-15 00:26:44,792 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:26:44,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:26:44,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1649874654, now seen corresponding path program 7 times [2025-03-15 00:26:44,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:26:44,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909138851] [2025-03-15 00:26:44,793 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-15 00:26:44,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:26:44,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:26:45,006 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-15 00:26:45,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:26:45,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909138851] [2025-03-15 00:26:45,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909138851] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:26:45,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:26:45,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-15 00:26:45,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858541928] [2025-03-15 00:26:45,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:26:45,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 00:26:45,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:26:45,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 00:26:45,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-15 00:26:45,008 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 159 [2025-03-15 00:26:45,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 3390 transitions, 86235 flow. Second operand has 9 states, 9 states have (on average 50.22222222222222) internal successors, (452), 9 states have internal predecessors, (452), 0 states have call successors, (0), 0 states 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:26:45,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:26:45,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 159 [2025-03-15 00:26:45,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:26:54,300 INFO L124 PetriNetUnfolderBase]: 7389/17672 cut-off events. [2025-03-15 00:26:54,300 INFO L125 PetriNetUnfolderBase]: For 168882/170235 co-relation queries the response was YES. [2025-03-15 00:26:54,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192260 conditions, 17672 events. 7389/17672 cut-off events. For 168882/170235 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 146735 event pairs, 763 based on Foata normal form. 83/16820 useless extension candidates. Maximal degree in co-relation 191229. Up to 9421 conditions per place. [2025-03-15 00:26:54,443 INFO L140 encePairwiseOnDemand]: 144/159 looper letters, 3231 selfloop transitions, 85 changer transitions 9/3403 dead transitions. [2025-03-15 00:26:54,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 3403 transitions, 93223 flow [2025-03-15 00:26:54,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 00:26:54,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 00:26:54,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 705 transitions. [2025-03-15 00:26:54,445 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.49266247379454925 [2025-03-15 00:26:54,445 INFO L298 CegarLoopForPetriNet]: 160 programPoint places, 152 predicate places. [2025-03-15 00:26:54,445 INFO L471 AbstractCegarLoop]: Abstraction has has 312 places, 3403 transitions, 93223 flow [2025-03-15 00:26:54,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 50.22222222222222) internal successors, (452), 9 states have internal predecessors, (452), 0 states have call successors, (0), 0 states 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:26:54,445 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:26:54,446 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:54,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-15 00:26:54,446 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:26:54,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:26:54,446 INFO L85 PathProgramCache]: Analyzing trace with hash 810621796, now seen corresponding path program 8 times [2025-03-15 00:26:54,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:26:54,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406897889] [2025-03-15 00:26:54,446 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 00:26:54,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:26:54,462 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 00:26:54,462 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:26:54,590 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-15 00:26:54,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:26:54,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406897889] [2025-03-15 00:26:54,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406897889] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:26:54,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:26:54,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-15 00:26:54,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008216731] [2025-03-15 00:26:54,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:26:54,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 00:26:54,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:26:54,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 00:26:54,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-15 00:26:54,591 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 159 [2025-03-15 00:26:54,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 3403 transitions, 93223 flow. Second operand has 9 states, 9 states have (on average 50.22222222222222) internal successors, (452), 9 states have internal predecessors, (452), 0 states have call successors, (0), 0 states 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:26:54,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:26:54,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 159 [2025-03-15 00:26:54,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:27:03,908 INFO L124 PetriNetUnfolderBase]: 7419/17778 cut-off events. [2025-03-15 00:27:03,909 INFO L125 PetriNetUnfolderBase]: For 196633/198034 co-relation queries the response was YES. [2025-03-15 00:27:03,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 207673 conditions, 17778 events. 7419/17778 cut-off events. For 196633/198034 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 148096 event pairs, 763 based on Foata normal form. 106/16949 useless extension candidates. Maximal degree in co-relation 206567. Up to 9480 conditions per place. [2025-03-15 00:27:04,062 INFO L140 encePairwiseOnDemand]: 143/159 looper letters, 3286 selfloop transitions, 62 changer transitions 9/3435 dead transitions. [2025-03-15 00:27:04,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 3435 transitions, 100833 flow [2025-03-15 00:27:04,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 00:27:04,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 00:27:04,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 703 transitions. [2025-03-15 00:27:04,063 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.4912648497554158 [2025-03-15 00:27:04,063 INFO L298 CegarLoopForPetriNet]: 160 programPoint places, 160 predicate places. [2025-03-15 00:27:04,063 INFO L471 AbstractCegarLoop]: Abstraction has has 320 places, 3435 transitions, 100833 flow [2025-03-15 00:27:04,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 50.22222222222222) internal successors, (452), 9 states have internal predecessors, (452), 0 states have call successors, (0), 0 states 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:27:04,064 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:27:04,064 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:04,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-15 00:27:04,064 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:27:04,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:27:04,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1595146664, now seen corresponding path program 9 times [2025-03-15 00:27:04,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:27:04,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839201406] [2025-03-15 00:27:04,065 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-15 00:27:04,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:27:04,078 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-15 00:27:04,078 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:27:04,215 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-15 00:27:04,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:27:04,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839201406] [2025-03-15 00:27:04,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839201406] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:27:04,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:27:04,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-15 00:27:04,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376211422] [2025-03-15 00:27:04,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:27:04,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 00:27:04,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:27:04,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 00:27:04,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-15 00:27:04,217 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 159 [2025-03-15 00:27:04,217 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 3435 transitions, 100833 flow. Second operand has 9 states, 9 states have (on average 50.22222222222222) internal successors, (452), 9 states have internal predecessors, (452), 0 states have call successors, (0), 0 states 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:27:04,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:27:04,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 159 [2025-03-15 00:27:04,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:27:13,948 INFO L124 PetriNetUnfolderBase]: 7417/17783 cut-off events. [2025-03-15 00:27:13,949 INFO L125 PetriNetUnfolderBase]: For 224608/226209 co-relation queries the response was YES. [2025-03-15 00:27:13,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 222054 conditions, 17783 events. 7417/17783 cut-off events. For 224608/226209 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 148143 event pairs, 757 based on Foata normal form. 109/16954 useless extension candidates. Maximal degree in co-relation 220873. Up to 9489 conditions per place. [2025-03-15 00:27:14,098 INFO L140 encePairwiseOnDemand]: 144/159 looper letters, 3257 selfloop transitions, 104 changer transitions 9/3448 dead transitions. [2025-03-15 00:27:14,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 3448 transitions, 107963 flow [2025-03-15 00:27:14,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 00:27:14,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 00:27:14,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 690 transitions. [2025-03-15 00:27:14,099 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.48218029350104824 [2025-03-15 00:27:14,100 INFO L298 CegarLoopForPetriNet]: 160 programPoint places, 168 predicate places. [2025-03-15 00:27:14,100 INFO L471 AbstractCegarLoop]: Abstraction has has 328 places, 3448 transitions, 107963 flow [2025-03-15 00:27:14,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 50.22222222222222) internal successors, (452), 9 states have internal predecessors, (452), 0 states have call successors, (0), 0 states 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:27:14,100 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:27:14,100 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:14,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-15 00:27:14,100 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:27:14,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:27:14,101 INFO L85 PathProgramCache]: Analyzing trace with hash 2047882472, now seen corresponding path program 10 times [2025-03-15 00:27:14,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:27:14,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082779682] [2025-03-15 00:27:14,101 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-15 00:27:14,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:27:14,117 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-15 00:27:14,118 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:27:14,395 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-15 00:27:14,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:27:14,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082779682] [2025-03-15 00:27:14,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082779682] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:27:14,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:27:14,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-15 00:27:14,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834216493] [2025-03-15 00:27:14,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:27:14,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-15 00:27:14,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:27:14,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-15 00:27:14,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-15 00:27:14,397 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 159 [2025-03-15 00:27:14,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 3448 transitions, 107963 flow. Second operand has 10 states, 10 states have (on average 49.2) internal successors, (492), 10 states have internal predecessors, (492), 0 states have call successors, (0), 0 states 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:27:14,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:27:14,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 159 [2025-03-15 00:27:14,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:27:24,182 INFO L124 PetriNetUnfolderBase]: 6708/16167 cut-off events. [2025-03-15 00:27:24,182 INFO L125 PetriNetUnfolderBase]: For 231031/232517 co-relation queries the response was YES. [2025-03-15 00:27:24,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 214692 conditions, 16167 events. 6708/16167 cut-off events. For 231031/232517 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 132297 event pairs, 711 based on Foata normal form. 134/15462 useless extension candidates. Maximal degree in co-relation 213436. Up to 8531 conditions per place. [2025-03-15 00:27:24,336 INFO L140 encePairwiseOnDemand]: 142/159 looper letters, 2862 selfloop transitions, 74 changer transitions 9/3023 dead transitions. [2025-03-15 00:27:24,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 3023 transitions, 100009 flow [2025-03-15 00:27:24,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-15 00:27:24,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-15 00:27:24,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 720 transitions. [2025-03-15 00:27:24,337 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.4528301886792453 [2025-03-15 00:27:24,338 INFO L298 CegarLoopForPetriNet]: 160 programPoint places, 177 predicate places. [2025-03-15 00:27:24,338 INFO L471 AbstractCegarLoop]: Abstraction has has 337 places, 3023 transitions, 100009 flow [2025-03-15 00:27:24,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 49.2) internal successors, (492), 10 states have internal predecessors, (492), 0 states have call successors, (0), 0 states 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:27:24,338 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:27:24,338 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:24,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-15 00:27:24,338 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:27:24,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:27:24,339 INFO L85 PathProgramCache]: Analyzing trace with hash -287883230, now seen corresponding path program 11 times [2025-03-15 00:27:24,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:27:24,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167210382] [2025-03-15 00:27:24,339 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-15 00:27:24,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:27:24,355 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-15 00:27:24,355 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:27:24,947 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2025-03-15 00:27:24,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:27:24,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167210382] [2025-03-15 00:27:24,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167210382] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 00:27:24,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1250146637] [2025-03-15 00:27:24,947 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-15 00:27:24,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 00:27:24,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:27:24,950 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:27:24,950 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:27:25,071 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-15 00:27:25,071 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:27:25,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-15 00:27:25,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 00:27:25,273 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 13 treesize of output 9 [2025-03-15 00:27:25,323 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-15 00:27:25,323 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-15 00:27:25,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1250146637] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:27:25,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-15 00:27:25,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2025-03-15 00:27:25,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503842597] [2025-03-15 00:27:25,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:27:25,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-15 00:27:25,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:27:25,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-15 00:27:25,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2025-03-15 00:27:25,325 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 159 [2025-03-15 00:27:25,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 3023 transitions, 100009 flow. Second operand has 10 states, 10 states have (on average 49.2) internal successors, (492), 10 states have internal predecessors, (492), 0 states have call successors, (0), 0 states 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:27:25,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:27:25,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 159 [2025-03-15 00:27:25,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:27:37,108 INFO L124 PetriNetUnfolderBase]: 9259/22186 cut-off events. [2025-03-15 00:27:37,108 INFO L125 PetriNetUnfolderBase]: For 367475/370189 co-relation queries the response was YES. [2025-03-15 00:27:37,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 312008 conditions, 22186 events. 9259/22186 cut-off events. For 367475/370189 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 193386 event pairs, 843 based on Foata normal form. 60/21121 useless extension candidates. Maximal degree in co-relation 310677. Up to 11911 conditions per place. [2025-03-15 00:27:37,392 INFO L140 encePairwiseOnDemand]: 143/159 looper letters, 4369 selfloop transitions, 86 changer transitions 9/4542 dead transitions. [2025-03-15 00:27:37,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 4542 transitions, 160839 flow [2025-03-15 00:27:37,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-15 00:27:37,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-15 00:27:37,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 786 transitions. [2025-03-15 00:27:37,394 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.49433962264150944 [2025-03-15 00:27:37,394 INFO L298 CegarLoopForPetriNet]: 160 programPoint places, 186 predicate places. [2025-03-15 00:27:37,395 INFO L471 AbstractCegarLoop]: Abstraction has has 346 places, 4542 transitions, 160839 flow [2025-03-15 00:27:37,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 49.2) internal successors, (492), 10 states have internal predecessors, (492), 0 states have call successors, (0), 0 states 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:27:37,395 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:27:37,395 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:37,403 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:27:37,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 00:27:37,596 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:27:37,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:27:37,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1110392782, now seen corresponding path program 12 times [2025-03-15 00:27:37,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:27:37,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738408864] [2025-03-15 00:27:37,597 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-15 00:27:37,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:27:37,611 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-15 00:27:37,611 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:27:37,743 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-15 00:27:37,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:27:37,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738408864] [2025-03-15 00:27:37,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738408864] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:27:37,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:27:37,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-15 00:27:37,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989152185] [2025-03-15 00:27:37,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:27:37,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 00:27:37,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:27:37,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 00:27:37,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-15 00:27:37,744 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 159 [2025-03-15 00:27:37,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 4542 transitions, 160839 flow. Second operand has 9 states, 9 states have (on average 50.22222222222222) internal successors, (452), 9 states have internal predecessors, (452), 0 states have call successors, (0), 0 states 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:27:37,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:27:37,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 159 [2025-03-15 00:27:37,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:27:56,502 INFO L124 PetriNetUnfolderBase]: 9289/22292 cut-off events. [2025-03-15 00:27:56,503 INFO L125 PetriNetUnfolderBase]: For 415174/418237 co-relation queries the response was YES. [2025-03-15 00:27:56,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 331315 conditions, 22292 events. 9289/22292 cut-off events. For 415174/418237 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 194690 event pairs, 843 based on Foata normal form. 119/21286 useless extension candidates. Maximal degree in co-relation 329909. Up to 11969 conditions per place. [2025-03-15 00:27:56,754 INFO L140 encePairwiseOnDemand]: 143/159 looper letters, 4425 selfloop transitions, 62 changer transitions 9/4574 dead transitions. [2025-03-15 00:27:56,754 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 354 places, 4574 transitions, 170983 flow [2025-03-15 00:27:56,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 00:27:56,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 00:27:56,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 744 transitions. [2025-03-15 00:27:56,756 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.519916142557652 [2025-03-15 00:27:56,756 INFO L298 CegarLoopForPetriNet]: 160 programPoint places, 194 predicate places. [2025-03-15 00:27:56,756 INFO L471 AbstractCegarLoop]: Abstraction has has 354 places, 4574 transitions, 170983 flow [2025-03-15 00:27:56,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 50.22222222222222) internal successors, (452), 9 states have internal predecessors, (452), 0 states have call successors, (0), 0 states 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:27:56,756 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:27:56,756 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:56,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-15 00:27:56,756 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:27:56,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:27:56,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1337829208, now seen corresponding path program 13 times [2025-03-15 00:27:56,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:27:56,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974321093] [2025-03-15 00:27:56,757 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-15 00:27:56,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:27:56,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:27:56,933 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-15 00:27:56,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:27:56,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974321093] [2025-03-15 00:27:56,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974321093] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:27:56,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:27:56,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-15 00:27:56,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424837974] [2025-03-15 00:27:56,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:27:56,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 00:27:56,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:27:56,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 00:27:56,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-15 00:27:56,934 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 159 [2025-03-15 00:27:56,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 354 places, 4574 transitions, 170983 flow. Second operand has 9 states, 9 states have (on average 50.22222222222222) internal successors, (452), 9 states have internal predecessors, (452), 0 states have call successors, (0), 0 states 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:27:56,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:27:56,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 159 [2025-03-15 00:27:56,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:28:16,517 INFO L124 PetriNetUnfolderBase]: 9287/22297 cut-off events. [2025-03-15 00:28:16,517 INFO L125 PetriNetUnfolderBase]: For 462516/465963 co-relation queries the response was YES. [2025-03-15 00:28:16,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 349282 conditions, 22297 events. 9287/22297 cut-off events. For 462516/465963 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 194831 event pairs, 837 based on Foata normal form. 110/21279 useless extension candidates. Maximal degree in co-relation 347801. Up to 11978 conditions per place. [2025-03-15 00:28:16,759 INFO L140 encePairwiseOnDemand]: 144/159 looper letters, 4378 selfloop transitions, 122 changer transitions 9/4587 dead transitions. [2025-03-15 00:28:16,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 4587 transitions, 180495 flow [2025-03-15 00:28:16,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 00:28:16,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 00:28:16,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 729 transitions. [2025-03-15 00:28:16,760 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5094339622641509 [2025-03-15 00:28:16,761 INFO L298 CegarLoopForPetriNet]: 160 programPoint places, 202 predicate places. [2025-03-15 00:28:16,761 INFO L471 AbstractCegarLoop]: Abstraction has has 362 places, 4587 transitions, 180495 flow [2025-03-15 00:28:16,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 50.22222222222222) internal successors, (452), 9 states have internal predecessors, (452), 0 states have call successors, (0), 0 states 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:28:16,761 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:28:16,761 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:16,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-15 00:28:16,761 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:28:16,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:28:16,762 INFO L85 PathProgramCache]: Analyzing trace with hash -885093400, now seen corresponding path program 14 times [2025-03-15 00:28:16,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:28:16,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208488754] [2025-03-15 00:28:16,762 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 00:28:16,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:28:16,777 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 00:28:16,777 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:28:16,898 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-15 00:28:16,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:28:16,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208488754] [2025-03-15 00:28:16,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208488754] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:28:16,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:28:16,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-15 00:28:16,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756852190] [2025-03-15 00:28:16,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:28:16,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 00:28:16,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:28:16,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 00:28:16,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-15 00:28:16,899 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 159 [2025-03-15 00:28:16,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 4587 transitions, 180495 flow. Second operand has 9 states, 9 states have (on average 50.22222222222222) internal successors, (452), 9 states have internal predecessors, (452), 0 states have call successors, (0), 0 states 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:28:16,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:28:16,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 159 [2025-03-15 00:28:16,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:28:34,152 INFO L124 PetriNetUnfolderBase]: 8653/20843 cut-off events. [2025-03-15 00:28:34,152 INFO L125 PetriNetUnfolderBase]: For 475961/479341 co-relation queries the response was YES. [2025-03-15 00:28:34,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 343462 conditions, 20843 events. 8653/20843 cut-off events. For 475961/479341 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 179430 event pairs, 791 based on Foata normal form. 136/19944 useless extension candidates. Maximal degree in co-relation 341906. Up to 11082 conditions per place. [2025-03-15 00:28:34,401 INFO L140 encePairwiseOnDemand]: 143/159 looper letters, 4059 selfloop transitions, 66 changer transitions 9/4212 dead transitions. [2025-03-15 00:28:34,401 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 4212 transitions, 173511 flow [2025-03-15 00:28:34,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 00:28:34,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 00:28:34,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 727 transitions. [2025-03-15 00:28:34,402 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5080363382250175 [2025-03-15 00:28:34,402 INFO L298 CegarLoopForPetriNet]: 160 programPoint places, 210 predicate places. [2025-03-15 00:28:34,403 INFO L471 AbstractCegarLoop]: Abstraction has has 370 places, 4212 transitions, 173511 flow [2025-03-15 00:28:34,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 50.22222222222222) internal successors, (452), 9 states have internal predecessors, (452), 0 states have call successors, (0), 0 states 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:28:34,403 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:28:34,403 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:34,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-15 00:28:34,403 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:28:34,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:28:34,404 INFO L85 PathProgramCache]: Analyzing trace with hash -397383778, now seen corresponding path program 15 times [2025-03-15 00:28:34,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:28:34,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136542873] [2025-03-15 00:28:34,404 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-15 00:28:34,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:28:34,418 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-15 00:28:34,418 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:28:34,559 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-15 00:28:34,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:28:34,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136542873] [2025-03-15 00:28:34,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136542873] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:28:34,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:28:34,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-15 00:28:34,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925908220] [2025-03-15 00:28:34,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:28:34,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 00:28:34,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:28:34,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 00:28:34,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-15 00:28:34,560 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 159 [2025-03-15 00:28:34,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 4212 transitions, 173511 flow. Second operand has 9 states, 9 states have (on average 50.22222222222222) internal successors, (452), 9 states have internal predecessors, (452), 0 states have call successors, (0), 0 states 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:28:34,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:28:34,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 159 [2025-03-15 00:28:34,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:28:52,124 INFO L124 PetriNetUnfolderBase]: 8679/20920 cut-off events. [2025-03-15 00:28:52,124 INFO L125 PetriNetUnfolderBase]: For 527065/530832 co-relation queries the response was YES. [2025-03-15 00:28:52,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 361540 conditions, 20920 events. 8679/20920 cut-off events. For 527065/530832 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 180236 event pairs, 791 based on Foata normal form. 99/19985 useless extension candidates. Maximal degree in co-relation 359909. Up to 11141 conditions per place. [2025-03-15 00:28:52,384 INFO L140 encePairwiseOnDemand]: 145/159 looper letters, 4021 selfloop transitions, 132 changer transitions 9/4240 dead transitions. [2025-03-15 00:28:52,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 4240 transitions, 183003 flow [2025-03-15 00:28:52,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 00:28:52,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 00:28:52,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 712 transitions. [2025-03-15 00:28:52,385 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.4975541579315164 [2025-03-15 00:28:52,385 INFO L298 CegarLoopForPetriNet]: 160 programPoint places, 218 predicate places. [2025-03-15 00:28:52,385 INFO L471 AbstractCegarLoop]: Abstraction has has 378 places, 4240 transitions, 183003 flow [2025-03-15 00:28:52,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 50.22222222222222) internal successors, (452), 9 states have internal predecessors, (452), 0 states have call successors, (0), 0 states 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:28:52,386 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:28:52,386 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:52,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-15 00:28:52,386 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:28:52,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:28:52,387 INFO L85 PathProgramCache]: Analyzing trace with hash 57679902, now seen corresponding path program 16 times [2025-03-15 00:28:52,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:28:52,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689420192] [2025-03-15 00:28:52,387 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-15 00:28:52,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:28:52,403 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-15 00:28:52,403 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:28:52,949 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-15 00:28:52,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:28:52,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689420192] [2025-03-15 00:28:52,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689420192] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:28:52,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:28:52,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-15 00:28:52,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374514929] [2025-03-15 00:28:52,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:28:52,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-15 00:28:52,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:28:52,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-15 00:28:52,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-15 00:28:52,951 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 159 [2025-03-15 00:28:52,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 4240 transitions, 183003 flow. Second operand has 10 states, 10 states have (on average 49.2) internal successors, (492), 10 states have internal predecessors, (492), 0 states have call successors, (0), 0 states 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:28:52,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:28:52,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 159 [2025-03-15 00:28:52,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:29:10,083 INFO L124 PetriNetUnfolderBase]: 8679/20938 cut-off events. [2025-03-15 00:29:10,084 INFO L125 PetriNetUnfolderBase]: For 576729/580583 co-relation queries the response was YES. [2025-03-15 00:29:10,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 378596 conditions, 20938 events. 8679/20938 cut-off events. For 576729/580583 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 180520 event pairs, 803 based on Foata normal form. 111/20016 useless extension candidates. Maximal degree in co-relation 376890. Up to 11151 conditions per place. [2025-03-15 00:29:10,375 INFO L140 encePairwiseOnDemand]: 143/159 looper letters, 4071 selfloop transitions, 95 changer transitions 9/4253 dead transitions. [2025-03-15 00:29:10,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 387 places, 4253 transitions, 191925 flow [2025-03-15 00:29:10,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-15 00:29:10,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-15 00:29:10,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 770 transitions. [2025-03-15 00:29:10,376 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.48427672955974843 [2025-03-15 00:29:10,376 INFO L298 CegarLoopForPetriNet]: 160 programPoint places, 227 predicate places. [2025-03-15 00:29:10,376 INFO L471 AbstractCegarLoop]: Abstraction has has 387 places, 4253 transitions, 191925 flow [2025-03-15 00:29:10,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 49.2) internal successors, (492), 10 states have internal predecessors, (492), 0 states have call successors, (0), 0 states 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:29:10,376 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:29:10,376 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:10,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-15 00:29:10,377 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:29:10,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:29:10,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1776790944, now seen corresponding path program 17 times [2025-03-15 00:29:10,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:29:10,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519406464] [2025-03-15 00:29:10,377 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-15 00:29:10,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:29:10,391 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-15 00:29:10,391 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:29:10,814 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2025-03-15 00:29:10,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:29:10,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519406464] [2025-03-15 00:29:10,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519406464] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 00:29:10,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1000677780] [2025-03-15 00:29:10,815 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-15 00:29:10,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 00:29:10,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:29:10,818 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:29:10,818 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:29:10,950 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-15 00:29:10,951 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:29:10,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-15 00:29:10,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 00:29:11,162 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 13 treesize of output 9 [2025-03-15 00:29:11,179 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-15 00:29:11,180 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-15 00:29:11,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1000677780] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:29:11,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-15 00:29:11,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2025-03-15 00:29:11,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354400123] [2025-03-15 00:29:11,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:29:11,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-15 00:29:11,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:29:11,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-15 00:29:11,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2025-03-15 00:29:11,181 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 159 [2025-03-15 00:29:11,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 387 places, 4253 transitions, 191925 flow. Second operand has 10 states, 10 states have (on average 49.2) internal successors, (492), 10 states have internal predecessors, (492), 0 states have call successors, (0), 0 states 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:29:11,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:29:11,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 159 [2025-03-15 00:29:11,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:29:30,877 INFO L124 PetriNetUnfolderBase]: 8620/20825 cut-off events. [2025-03-15 00:29:30,877 INFO L125 PetriNetUnfolderBase]: For 625196/629331 co-relation queries the response was YES. [2025-03-15 00:29:30,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 393299 conditions, 20825 events. 8620/20825 cut-off events. For 625196/629331 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 180112 event pairs, 782 based on Foata normal form. 124/19913 useless extension candidates. Maximal degree in co-relation 391518. Up to 11121 conditions per place. [2025-03-15 00:29:31,168 INFO L140 encePairwiseOnDemand]: 142/159 looper letters, 3927 selfloop transitions, 134 changer transitions 10/4149 dead transitions. [2025-03-15 00:29:31,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 4149 transitions, 195195 flow [2025-03-15 00:29:31,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-15 00:29:31,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-15 00:29:31,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 934 transitions. [2025-03-15 00:29:31,169 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.45186260280599905 [2025-03-15 00:29:31,170 INFO L298 CegarLoopForPetriNet]: 160 programPoint places, 239 predicate places. [2025-03-15 00:29:31,170 INFO L471 AbstractCegarLoop]: Abstraction has has 399 places, 4149 transitions, 195195 flow [2025-03-15 00:29:31,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 49.2) internal successors, (492), 10 states have internal predecessors, (492), 0 states have call successors, (0), 0 states 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:29:31,170 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:29:31,170 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:31,177 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:29:31,370 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,SelfDestructingSolverStorable26 [2025-03-15 00:29:31,371 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:29:31,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:29:31,372 INFO L85 PathProgramCache]: Analyzing trace with hash 489765416, now seen corresponding path program 18 times [2025-03-15 00:29:31,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:29:31,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107407737] [2025-03-15 00:29:31,372 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-15 00:29:31,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:29:31,384 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-15 00:29:31,385 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:29:31,515 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-15 00:29:31,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:29:31,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107407737] [2025-03-15 00:29:31,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107407737] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:29:31,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:29:31,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-15 00:29:31,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395228207] [2025-03-15 00:29:31,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:29:31,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 00:29:31,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:29:31,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 00:29:31,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-15 00:29:31,517 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 159 [2025-03-15 00:29:31,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 399 places, 4149 transitions, 195195 flow. Second operand has 9 states, 9 states have (on average 50.22222222222222) internal successors, (452), 9 states have internal predecessors, (452), 0 states have call successors, (0), 0 states 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:29:31,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:29:31,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 159 [2025-03-15 00:29:31,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:29:52,961 INFO L124 PetriNetUnfolderBase]: 9329/22500 cut-off events. [2025-03-15 00:29:52,963 INFO L125 PetriNetUnfolderBase]: For 742016/746758 co-relation queries the response was YES. [2025-03-15 00:29:53,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 442596 conditions, 22500 events. 9329/22500 cut-off events. For 742016/746758 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 197461 event pairs, 828 based on Foata normal form. 107/21476 useless extension candidates. Maximal degree in co-relation 440740. Up to 12115 conditions per place. [2025-03-15 00:29:53,299 INFO L140 encePairwiseOnDemand]: 144/159 looper letters, 4402 selfloop transitions, 100 changer transitions 10/4590 dead transitions. [2025-03-15 00:29:53,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 407 places, 4590 transitions, 225611 flow [2025-03-15 00:29:53,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 00:29:53,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 00:29:53,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 726 transitions. [2025-03-15 00:29:53,300 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5073375262054507 [2025-03-15 00:29:53,301 INFO L298 CegarLoopForPetriNet]: 160 programPoint places, 247 predicate places. [2025-03-15 00:29:53,301 INFO L471 AbstractCegarLoop]: Abstraction has has 407 places, 4590 transitions, 225611 flow [2025-03-15 00:29:53,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 50.22222222222222) internal successors, (452), 9 states have internal predecessors, (452), 0 states have call successors, (0), 0 states 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:29:53,301 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:29:53,301 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:53,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-15 00:29:53,301 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:29:53,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:29:53,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1379807050, now seen corresponding path program 19 times [2025-03-15 00:29:53,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:29:53,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084885873] [2025-03-15 00:29:53,302 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-15 00:29:53,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:29:53,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:29:53,476 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-15 00:29:53,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:29:53,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084885873] [2025-03-15 00:29:53,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084885873] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:29:53,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:29:53,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-15 00:29:53,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059038219] [2025-03-15 00:29:53,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:29:53,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 00:29:53,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:29:53,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 00:29:53,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-15 00:29:53,478 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 159 [2025-03-15 00:29:53,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 407 places, 4590 transitions, 225611 flow. Second operand has 9 states, 9 states have (on average 50.22222222222222) internal successors, (452), 9 states have internal predecessors, (452), 0 states have call successors, (0), 0 states 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:29:53,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:29:53,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 159 [2025-03-15 00:29:53,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:30:17,436 INFO L124 PetriNetUnfolderBase]: 9361/22620 cut-off events. [2025-03-15 00:30:17,436 INFO L125 PetriNetUnfolderBase]: For 812732/817484 co-relation queries the response was YES. [2025-03-15 00:30:17,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 462881 conditions, 22620 events. 9361/22620 cut-off events. For 812732/817484 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 198964 event pairs, 834 based on Foata normal form. 142/21634 useless extension candidates. Maximal degree in co-relation 460950. Up to 12177 conditions per place. [2025-03-15 00:30:17,805 INFO L140 encePairwiseOnDemand]: 143/159 looper letters, 4457 selfloop transitions, 77 changer transitions 10/4622 dead transitions. [2025-03-15 00:30:17,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 415 places, 4622 transitions, 236299 flow [2025-03-15 00:30:17,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 00:30:17,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 00:30:17,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 724 transitions. [2025-03-15 00:30:17,806 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5059399021663172 [2025-03-15 00:30:17,807 INFO L298 CegarLoopForPetriNet]: 160 programPoint places, 255 predicate places. [2025-03-15 00:30:17,807 INFO L471 AbstractCegarLoop]: Abstraction has has 415 places, 4622 transitions, 236299 flow [2025-03-15 00:30:17,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 50.22222222222222) internal successors, (452), 9 states have internal predecessors, (452), 0 states have call successors, (0), 0 states 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:30:17,807 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:30:17,807 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:17,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-15 00:30:17,807 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:30:17,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:30:17,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1402117080, now seen corresponding path program 20 times [2025-03-15 00:30:17,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:30:17,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037819468] [2025-03-15 00:30:17,808 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 00:30:17,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:30:17,821 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 00:30:17,821 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:30:18,104 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-15 00:30:18,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:30:18,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037819468] [2025-03-15 00:30:18,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037819468] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:30:18,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:30:18,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-15 00:30:18,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261622956] [2025-03-15 00:30:18,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:30:18,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 00:30:18,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:30:18,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 00:30:18,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-15 00:30:18,106 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 159 [2025-03-15 00:30:18,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 415 places, 4622 transitions, 236299 flow. Second operand has 9 states, 9 states have (on average 50.22222222222222) internal successors, (452), 9 states have internal predecessors, (452), 0 states have call successors, (0), 0 states 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:30:18,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:30:18,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 159 [2025-03-15 00:30:18,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:30:41,251 INFO L124 PetriNetUnfolderBase]: 9361/22639 cut-off events. [2025-03-15 00:30:41,252 INFO L125 PetriNetUnfolderBase]: For 880707/885736 co-relation queries the response was YES. [2025-03-15 00:30:41,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 481295 conditions, 22639 events. 9361/22639 cut-off events. For 880707/885736 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 199174 event pairs, 834 based on Foata normal form. 130/21641 useless extension candidates. Maximal degree in co-relation 479289. Up to 12187 conditions per place. [2025-03-15 00:30:41,593 INFO L140 encePairwiseOnDemand]: 144/159 looper letters, 4410 selfloop transitions, 137 changer transitions 10/4635 dead transitions. [2025-03-15 00:30:41,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 423 places, 4635 transitions, 246089 flow [2025-03-15 00:30:41,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 00:30:41,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 00:30:41,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 709 transitions. [2025-03-15 00:30:41,595 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.4954577218728162 [2025-03-15 00:30:41,595 INFO L298 CegarLoopForPetriNet]: 160 programPoint places, 263 predicate places. [2025-03-15 00:30:41,595 INFO L471 AbstractCegarLoop]: Abstraction has has 423 places, 4635 transitions, 246089 flow [2025-03-15 00:30:41,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 50.22222222222222) internal successors, (452), 9 states have internal predecessors, (452), 0 states have call successors, (0), 0 states 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:30:41,596 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:30:41,596 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:41,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-15 00:30:41,596 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:30:41,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:30:41,597 INFO L85 PathProgramCache]: Analyzing trace with hash 665938276, now seen corresponding path program 21 times [2025-03-15 00:30:41,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:30:41,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766624114] [2025-03-15 00:30:41,597 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-15 00:30:41,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:30:41,608 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-15 00:30:41,609 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:30:41,727 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-15 00:30:41,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:30:41,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766624114] [2025-03-15 00:30:41,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766624114] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:30:41,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:30:41,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-15 00:30:41,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216273032] [2025-03-15 00:30:41,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:30:41,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 00:30:41,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:30:41,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 00:30:41,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-15 00:30:41,728 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 159 [2025-03-15 00:30:41,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 423 places, 4635 transitions, 246089 flow. Second operand has 9 states, 9 states have (on average 50.22222222222222) internal successors, (452), 9 states have internal predecessors, (452), 0 states have call successors, (0), 0 states 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:30:41,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:30:41,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 159 [2025-03-15 00:30:41,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:31:03,700 INFO L124 PetriNetUnfolderBase]: 8723/21157 cut-off events. [2025-03-15 00:31:03,700 INFO L125 PetriNetUnfolderBase]: For 882393/887763 co-relation queries the response was YES. [2025-03-15 00:31:03,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 467823 conditions, 21157 events. 8723/21157 cut-off events. For 882393/887763 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 184130 event pairs, 776 based on Foata normal form. 156/20272 useless extension candidates. Maximal degree in co-relation 465742. Up to 11293 conditions per place. [2025-03-15 00:31:04,019 INFO L140 encePairwiseOnDemand]: 143/159 looper letters, 4091 selfloop transitions, 81 changer transitions 10/4260 dead transitions. [2025-03-15 00:31:04,019 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 431 places, 4260 transitions, 233951 flow [2025-03-15 00:31:04,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 00:31:04,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 00:31:04,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 707 transitions. [2025-03-15 00:31:04,020 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.49406009783368277 [2025-03-15 00:31:04,021 INFO L298 CegarLoopForPetriNet]: 160 programPoint places, 271 predicate places. [2025-03-15 00:31:04,021 INFO L471 AbstractCegarLoop]: Abstraction has has 431 places, 4260 transitions, 233951 flow [2025-03-15 00:31:04,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 50.22222222222222) internal successors, (452), 9 states have internal predecessors, (452), 0 states have call successors, (0), 0 states 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:31:04,021 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:31:04,021 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:04,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-15 00:31:04,021 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:31:04,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:31:04,022 INFO L85 PathProgramCache]: Analyzing trace with hash -607934680, now seen corresponding path program 22 times [2025-03-15 00:31:04,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:31:04,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617048235] [2025-03-15 00:31:04,022 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-15 00:31:04,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:31:04,036 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-15 00:31:04,036 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:31:04,374 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-15 00:31:04,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:31:04,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617048235] [2025-03-15 00:31:04,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617048235] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:31:04,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:31:04,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-15 00:31:04,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564755179] [2025-03-15 00:31:04,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:31:04,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-15 00:31:04,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:31:04,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-15 00:31:04,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-15 00:31:04,376 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 159 [2025-03-15 00:31:04,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 431 places, 4260 transitions, 233951 flow. Second operand has 10 states, 10 states have (on average 49.2) internal successors, (492), 10 states have internal predecessors, (492), 0 states have call successors, (0), 0 states 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:31:04,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:31:04,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 159 [2025-03-15 00:31:04,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:31:26,540 INFO L124 PetriNetUnfolderBase]: 8751/21248 cut-off events. [2025-03-15 00:31:26,540 INFO L125 PetriNetUnfolderBase]: For 954778/960378 co-relation queries the response was YES. [2025-03-15 00:31:26,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 486744 conditions, 21248 events. 8751/21248 cut-off events. For 954778/960378 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 184963 event pairs, 782 based on Foata normal form. 160/20371 useless extension candidates. Maximal degree in co-relation 484588. Up to 11322 conditions per place. [2025-03-15 00:31:26,865 INFO L140 encePairwiseOnDemand]: 144/159 looper letters, 4037 selfloop transitions, 163 changer transitions 10/4288 dead transitions. [2025-03-15 00:31:26,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 440 places, 4288 transitions, 243931 flow [2025-03-15 00:31:26,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-15 00:31:26,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-15 00:31:26,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 734 transitions. [2025-03-15 00:31:26,867 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.46163522012578617 [2025-03-15 00:31:26,867 INFO L298 CegarLoopForPetriNet]: 160 programPoint places, 280 predicate places. [2025-03-15 00:31:26,867 INFO L471 AbstractCegarLoop]: Abstraction has has 440 places, 4288 transitions, 243931 flow [2025-03-15 00:31:26,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 49.2) internal successors, (492), 10 states have internal predecessors, (492), 0 states have call successors, (0), 0 states 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:31:26,867 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:31:26,867 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:26,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-15 00:31:26,868 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:31:26,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:31:26,868 INFO L85 PathProgramCache]: Analyzing trace with hash 290362092, now seen corresponding path program 23 times [2025-03-15 00:31:26,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:31:26,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580604520] [2025-03-15 00:31:26,868 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-15 00:31:26,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:31:26,883 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-15 00:31:26,883 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:31:27,139 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2025-03-15 00:31:27,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:31:27,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580604520] [2025-03-15 00:31:27,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580604520] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 00:31:27,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [301948074] [2025-03-15 00:31:27,140 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-15 00:31:27,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 00:31:27,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:31:27,142 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:31:27,142 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:31:27,275 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-15 00:31:27,276 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:31:27,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-15 00:31:27,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 00:31:27,431 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 13 treesize of output 9 [2025-03-15 00:31:27,472 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-15 00:31:27,472 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-15 00:31:27,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [301948074] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:31:27,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-15 00:31:27,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2025-03-15 00:31:27,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416052116] [2025-03-15 00:31:27,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:31:27,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-15 00:31:27,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:31:27,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-15 00:31:27,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2025-03-15 00:31:27,473 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 159 [2025-03-15 00:31:27,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 440 places, 4288 transitions, 243931 flow. Second operand has 10 states, 10 states have (on average 49.2) internal successors, (492), 10 states have internal predecessors, (492), 0 states have call successors, (0), 0 states 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:31:27,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:31:27,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 159 [2025-03-15 00:31:27,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:31:48,362 INFO L124 PetriNetUnfolderBase]: 8751/21266 cut-off events. [2025-03-15 00:31:48,362 INFO L125 PetriNetUnfolderBase]: For 1019133/1024189 co-relation queries the response was YES. [2025-03-15 00:31:48,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 504169 conditions, 21266 events. 8751/21266 cut-off events. For 1019133/1024189 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 185207 event pairs, 794 based on Foata normal form. 170/20400 useless extension candidates. Maximal degree in co-relation 501938. Up to 11335 conditions per place. [2025-03-15 00:31:48,706 INFO L140 encePairwiseOnDemand]: 143/159 looper letters, 4077 selfloop transitions, 136 changer transitions 10/4301 dead transitions. [2025-03-15 00:31:48,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 449 places, 4301 transitions, 253131 flow [2025-03-15 00:31:48,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-15 00:31:48,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-15 00:31:48,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 750 transitions. [2025-03-15 00:31:48,708 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.4716981132075472 [2025-03-15 00:31:48,708 INFO L298 CegarLoopForPetriNet]: 160 programPoint places, 289 predicate places. [2025-03-15 00:31:48,708 INFO L471 AbstractCegarLoop]: Abstraction has has 449 places, 4301 transitions, 253131 flow [2025-03-15 00:31:48,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 49.2) internal successors, (492), 10 states have internal predecessors, (492), 0 states have call successors, (0), 0 states 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:31:48,708 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:31:48,709 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:48,717 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:31:48,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 00:31:48,909 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:31:48,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:31:48,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1579210374, now seen corresponding path program 24 times [2025-03-15 00:31:48,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:31:48,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933403691] [2025-03-15 00:31:48,911 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-15 00:31:48,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:31:48,924 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-15 00:31:48,924 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:31:49,082 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-15 00:31:49,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:31:49,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933403691] [2025-03-15 00:31:49,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933403691] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:31:49,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:31:49,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-15 00:31:49,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376059525] [2025-03-15 00:31:49,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:31:49,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 00:31:49,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:31:49,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 00:31:49,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-15 00:31:49,084 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 159 [2025-03-15 00:31:49,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 449 places, 4301 transitions, 253131 flow. Second operand has 9 states, 9 states have (on average 50.22222222222222) internal successors, (452), 9 states have internal predecessors, (452), 0 states have call successors, (0), 0 states 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:31:49,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:31:49,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 159 [2025-03-15 00:31:49,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:32:09,601 INFO L124 PetriNetUnfolderBase]: 7990/19528 cut-off events. [2025-03-15 00:32:09,601 INFO L125 PetriNetUnfolderBase]: For 1006948/1012129 co-relation queries the response was YES. [2025-03-15 00:32:09,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 478681 conditions, 19528 events. 7990/19528 cut-off events. For 1006948/1012129 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 167894 event pairs, 742 based on Foata normal form. 174/18766 useless extension candidates. Maximal degree in co-relation 476375. Up to 10339 conditions per place. [2025-03-15 00:32:09,921 INFO L140 encePairwiseOnDemand]: 143/159 looper letters, 3652 selfloop transitions, 111 changer transitions 10/3851 dead transitions. [2025-03-15 00:32:09,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 457 places, 3851 transitions, 233437 flow [2025-03-15 00:32:09,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 00:32:09,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 00:32:09,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 683 transitions. [2025-03-15 00:32:09,923 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.4772886093640811 [2025-03-15 00:32:09,923 INFO L298 CegarLoopForPetriNet]: 160 programPoint places, 297 predicate places. [2025-03-15 00:32:09,923 INFO L471 AbstractCegarLoop]: Abstraction has has 457 places, 3851 transitions, 233437 flow [2025-03-15 00:32:09,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 50.22222222222222) internal successors, (452), 9 states have internal predecessors, (452), 0 states have call successors, (0), 0 states 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:32:09,923 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:32:09,923 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:09,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-15 00:32:09,924 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:32:09,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:32:09,924 INFO L85 PathProgramCache]: Analyzing trace with hash -40163288, now seen corresponding path program 25 times [2025-03-15 00:32:09,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:32:09,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725048503] [2025-03-15 00:32:09,924 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-15 00:32:09,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:32:09,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:32:10,274 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-15 00:32:10,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:32:10,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725048503] [2025-03-15 00:32:10,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725048503] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:32:10,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:32:10,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-15 00:32:10,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812453224] [2025-03-15 00:32:10,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:32:10,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 00:32:10,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:32:10,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 00:32:10,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-15 00:32:10,275 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 159 [2025-03-15 00:32:10,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 457 places, 3851 transitions, 233437 flow. Second operand has 9 states, 9 states have (on average 50.22222222222222) internal successors, (452), 9 states have internal predecessors, (452), 0 states have call successors, (0), 0 states 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:32:10,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:32:10,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 159 [2025-03-15 00:32:10,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:32:35,815 INFO L124 PetriNetUnfolderBase]: 10403/25220 cut-off events. [2025-03-15 00:32:35,815 INFO L125 PetriNetUnfolderBase]: For 1430437/1438676 co-relation queries the response was YES. [2025-03-15 00:32:35,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 636288 conditions, 25220 events. 10403/25220 cut-off events. For 1430437/1438676 co-relation queries the response was YES. Maximal size of possible extension queue 375. Compared 227614 event pairs, 874 based on Foata normal form. 74/24074 useless extension candidates. Maximal degree in co-relation 633907. Up to 13586 conditions per place. [2025-03-15 00:32:36,239 INFO L140 encePairwiseOnDemand]: 144/159 looper letters, 5131 selfloop transitions, 88 changer transitions 10/5307 dead transitions. [2025-03-15 00:32:36,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 465 places, 5307 transitions, 334599 flow [2025-03-15 00:32:36,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 00:32:36,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 00:32:36,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 748 transitions. [2025-03-15 00:32:36,240 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.522711390635919 [2025-03-15 00:32:36,240 INFO L298 CegarLoopForPetriNet]: 160 programPoint places, 305 predicate places. [2025-03-15 00:32:36,240 INFO L471 AbstractCegarLoop]: Abstraction has has 465 places, 5307 transitions, 334599 flow [2025-03-15 00:32:36,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 50.22222222222222) internal successors, (452), 9 states have internal predecessors, (452), 0 states have call successors, (0), 0 states 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:32:36,241 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:32:36,241 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:36,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-15 00:32:36,241 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:32:36,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:32:36,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1373270248, now seen corresponding path program 26 times [2025-03-15 00:32:36,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:32:36,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129688069] [2025-03-15 00:32:36,242 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 00:32:36,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:32:36,252 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 00:32:36,252 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:32:36,361 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-15 00:32:36,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:32:36,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129688069] [2025-03-15 00:32:36,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129688069] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:32:36,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:32:36,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-15 00:32:36,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110816942] [2025-03-15 00:32:36,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:32:36,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 00:32:36,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:32:36,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 00:32:36,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-15 00:32:36,363 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 159 [2025-03-15 00:32:36,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 465 places, 5307 transitions, 334599 flow. Second operand has 9 states, 9 states have (on average 50.22222222222222) internal successors, (452), 9 states have internal predecessors, (452), 0 states have call successors, (0), 0 states 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:32:36,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:32:36,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 159 [2025-03-15 00:32:36,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:33:16,413 INFO L124 PetriNetUnfolderBase]: 10433/25326 cut-off events. [2025-03-15 00:33:16,413 INFO L125 PetriNetUnfolderBase]: For 1531869/1540312 co-relation queries the response was YES. [2025-03-15 00:33:16,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 659207 conditions, 25326 events. 10433/25326 cut-off events. For 1531869/1540312 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 229033 event pairs, 874 based on Foata normal form. 123/24229 useless extension candidates. Maximal degree in co-relation 656751. Up to 13648 conditions per place. [2025-03-15 00:33:16,998 INFO L140 encePairwiseOnDemand]: 143/159 looper letters, 5186 selfloop transitions, 65 changer transitions 10/5339 dead transitions. [2025-03-15 00:33:16,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 473 places, 5339 transitions, 347169 flow [2025-03-15 00:33:16,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 00:33:16,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 00:33:17,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 746 transitions. [2025-03-15 00:33:17,001 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5213137665967854 [2025-03-15 00:33:17,002 INFO L298 CegarLoopForPetriNet]: 160 programPoint places, 313 predicate places. [2025-03-15 00:33:17,002 INFO L471 AbstractCegarLoop]: Abstraction has has 473 places, 5339 transitions, 347169 flow [2025-03-15 00:33:17,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 50.22222222222222) internal successors, (452), 9 states have internal predecessors, (452), 0 states have call successors, (0), 0 states 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:33:17,002 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:33:17,002 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:17,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-15 00:33:17,003 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:33:17,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:33:17,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1932045784, now seen corresponding path program 27 times [2025-03-15 00:33:17,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:33:17,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040619707] [2025-03-15 00:33:17,003 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-15 00:33:17,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:33:17,015 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-15 00:33:17,015 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:33:17,132 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-15 00:33:17,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:33:17,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040619707] [2025-03-15 00:33:17,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040619707] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:33:17,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:33:17,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-15 00:33:17,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324597508] [2025-03-15 00:33:17,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:33:17,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 00:33:17,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:33:17,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 00:33:17,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-15 00:33:17,134 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 159 [2025-03-15 00:33:17,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 473 places, 5339 transitions, 347169 flow. Second operand has 9 states, 9 states have (on average 50.22222222222222) internal successors, (452), 9 states have internal predecessors, (452), 0 states have call successors, (0), 0 states 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:33:17,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:33:17,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 159 [2025-03-15 00:33:17,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:34:02,291 INFO L124 PetriNetUnfolderBase]: 10433/25345 cut-off events. [2025-03-15 00:34:02,292 INFO L125 PetriNetUnfolderBase]: For 1631940/1640885 co-relation queries the response was YES. [2025-03-15 00:34:02,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 679842 conditions, 25345 events. 10433/25345 cut-off events. For 1631940/1640885 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 229342 event pairs, 874 based on Foata normal form. 114/24239 useless extension candidates. Maximal degree in co-relation 677311. Up to 13659 conditions per place. [2025-03-15 00:34:02,921 INFO L140 encePairwiseOnDemand]: 144/159 looper letters, 5139 selfloop transitions, 125 changer transitions 10/5352 dead transitions. [2025-03-15 00:34:02,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 481 places, 5352 transitions, 358575 flow [2025-03-15 00:34:02,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 00:34:02,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 00:34:02,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 731 transitions. [2025-03-15 00:34:02,922 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5108315863032844 [2025-03-15 00:34:02,922 INFO L298 CegarLoopForPetriNet]: 160 programPoint places, 321 predicate places. [2025-03-15 00:34:02,922 INFO L471 AbstractCegarLoop]: Abstraction has has 481 places, 5352 transitions, 358575 flow [2025-03-15 00:34:02,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 50.22222222222222) internal successors, (452), 9 states have internal predecessors, (452), 0 states have call successors, (0), 0 states 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:34:02,923 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:34:02,923 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:02,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-15 00:34:02,923 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:34:02,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:34:02,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1147970866, now seen corresponding path program 28 times [2025-03-15 00:34:02,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:34:02,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029888859] [2025-03-15 00:34:02,924 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-15 00:34:02,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:34:02,941 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-15 00:34:02,941 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:34:03,162 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-15 00:34:03,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:34:03,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029888859] [2025-03-15 00:34:03,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029888859] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:34:03,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:34:03,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-15 00:34:03,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063230142] [2025-03-15 00:34:03,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:34:03,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-15 00:34:03,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:34:03,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-15 00:34:03,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-15 00:34:03,164 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 159 [2025-03-15 00:34:03,164 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 481 places, 5352 transitions, 358575 flow. Second operand has 10 states, 10 states have (on average 49.2) internal successors, (492), 10 states have internal predecessors, (492), 0 states have call successors, (0), 0 states 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:34:03,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:34:03,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 159 [2025-03-15 00:34:03,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:34:46,364 INFO L124 PetriNetUnfolderBase]: 9797/23877 cut-off events. [2025-03-15 00:34:46,365 INFO L125 PetriNetUnfolderBase]: For 1622294/1631219 co-relation queries the response was YES. [2025-03-15 00:34:46,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 660868 conditions, 23877 events. 9797/23877 cut-off events. For 1622294/1631219 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 213135 event pairs, 822 based on Foata normal form. 140/22887 useless extension candidates. Maximal degree in co-relation 658262. Up to 12765 conditions per place. [2025-03-15 00:34:46,782 INFO L140 encePairwiseOnDemand]: 142/159 looper letters, 4819 selfloop transitions, 70 changer transitions 10/4977 dead transitions. [2025-03-15 00:34:46,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 490 places, 4977 transitions, 342621 flow [2025-03-15 00:34:46,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-15 00:34:46,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-15 00:34:46,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 769 transitions. [2025-03-15 00:34:46,783 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.48364779874213837 [2025-03-15 00:34:46,784 INFO L298 CegarLoopForPetriNet]: 160 programPoint places, 330 predicate places. [2025-03-15 00:34:46,784 INFO L471 AbstractCegarLoop]: Abstraction has has 490 places, 4977 transitions, 342621 flow [2025-03-15 00:34:46,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 49.2) internal successors, (492), 10 states have internal predecessors, (492), 0 states have call successors, (0), 0 states 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:34:46,784 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:34:46,784 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:46,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-15 00:34:46,784 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:34:46,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:34:46,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1137863384, now seen corresponding path program 29 times [2025-03-15 00:34:46,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:34:46,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341267453] [2025-03-15 00:34:46,785 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-15 00:34:46,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:34:46,800 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-15 00:34:46,801 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:34:47,261 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2025-03-15 00:34:47,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:34:47,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341267453] [2025-03-15 00:34:47,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341267453] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 00:34:47,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599103667] [2025-03-15 00:34:47,261 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-15 00:34:47,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 00:34:47,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:34:47,265 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:34:47,266 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:34:47,408 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-15 00:34:47,408 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:34:47,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-15 00:34:47,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 00:34:47,560 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 13 treesize of output 9 [2025-03-15 00:34:47,614 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-15 00:34:47,614 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-15 00:34:47,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599103667] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:34:47,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-15 00:34:47,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2025-03-15 00:34:47,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831246355] [2025-03-15 00:34:47,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:34:47,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-15 00:34:47,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:34:47,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-15 00:34:47,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2025-03-15 00:34:47,616 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 159 [2025-03-15 00:34:47,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 490 places, 4977 transitions, 342621 flow. Second operand has 10 states, 10 states have (on average 49.2) internal successors, (492), 10 states have internal predecessors, (492), 0 states have call successors, (0), 0 states 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:34:47,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:34:47,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 159 [2025-03-15 00:34:47,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:35:22,155 INFO L124 PetriNetUnfolderBase]: 9821/23940 cut-off events. [2025-03-15 00:35:22,156 INFO L125 PetriNetUnfolderBase]: For 1724466/1734269 co-relation queries the response was YES. [2025-03-15 00:35:22,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 682122 conditions, 23940 events. 9821/23940 cut-off events. For 1724466/1734269 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 213842 event pairs, 816 based on Foata normal form. 103/22911 useless extension candidates. Maximal degree in co-relation 679441. Up to 12792 conditions per place. [2025-03-15 00:35:22,632 INFO L140 encePairwiseOnDemand]: 144/159 looper letters, 4781 selfloop transitions, 136 changer transitions 10/5005 dead transitions. [2025-03-15 00:35:22,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 499 places, 5005 transitions, 354427 flow [2025-03-15 00:35:22,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-15 00:35:22,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-15 00:35:22,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 754 transitions. [2025-03-15 00:35:22,633 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.4742138364779874 [2025-03-15 00:35:22,633 INFO L298 CegarLoopForPetriNet]: 160 programPoint places, 339 predicate places. [2025-03-15 00:35:22,633 INFO L471 AbstractCegarLoop]: Abstraction has has 499 places, 5005 transitions, 354427 flow [2025-03-15 00:35:22,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 49.2) internal successors, (492), 10 states have internal predecessors, (492), 0 states have call successors, (0), 0 states 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:35:22,634 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:35:22,634 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:22,641 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:35:22,834 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,SelfDestructingSolverStorable38 [2025-03-15 00:35:22,834 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:35:22,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:35:22,835 INFO L85 PathProgramCache]: Analyzing trace with hash -239566612, now seen corresponding path program 30 times [2025-03-15 00:35:22,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:35:22,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829927275] [2025-03-15 00:35:22,835 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-15 00:35:22,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:35:22,849 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-15 00:35:22,849 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:35:22,980 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-15 00:35:22,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:35:22,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829927275] [2025-03-15 00:35:22,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829927275] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:35:22,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:35:22,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-15 00:35:22,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628681842] [2025-03-15 00:35:22,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:35:22,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 00:35:22,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:35:22,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 00:35:22,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-15 00:35:22,982 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 159 [2025-03-15 00:35:22,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 499 places, 5005 transitions, 354427 flow. Second operand has 9 states, 9 states have (on average 50.22222222222222) internal successors, (452), 9 states have internal predecessors, (452), 0 states have call successors, (0), 0 states 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:35:22,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:35:22,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 159 [2025-03-15 00:35:22,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:36:04,054 INFO L124 PetriNetUnfolderBase]: 9823/23972 cut-off events. [2025-03-15 00:36:04,054 INFO L125 PetriNetUnfolderBase]: For 1818683/1828282 co-relation queries the response was YES. [2025-03-15 00:36:04,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 701910 conditions, 23972 events. 9823/23972 cut-off events. For 1818683/1828282 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 214362 event pairs, 834 based on Foata normal form. 115/22959 useless extension candidates. Maximal degree in co-relation 699154. Up to 12805 conditions per place. [2025-03-15 00:36:04,514 INFO L140 encePairwiseOnDemand]: 144/159 looper letters, 4833 selfloop transitions, 97 changer transitions 10/5018 dead transitions. [2025-03-15 00:36:04,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 507 places, 5018 transitions, 365243 flow [2025-03-15 00:36:04,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 00:36:04,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 00:36:04,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 732 transitions. [2025-03-15 00:36:04,515 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5115303983228512 [2025-03-15 00:36:04,516 INFO L298 CegarLoopForPetriNet]: 160 programPoint places, 347 predicate places. [2025-03-15 00:36:04,516 INFO L471 AbstractCegarLoop]: Abstraction has has 507 places, 5018 transitions, 365243 flow [2025-03-15 00:36:04,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 50.22222222222222) internal successors, (452), 9 states have internal predecessors, (452), 0 states have call successors, (0), 0 states 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:36:04,516 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:36:04,516 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:04,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-15 00:36:04,516 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:36:04,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:36:04,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1173866924, now seen corresponding path program 31 times [2025-03-15 00:36:04,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:36:04,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436493703] [2025-03-15 00:36:04,517 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-15 00:36:04,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:36:04,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:36:04,688 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-15 00:36:04,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:36:04,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436493703] [2025-03-15 00:36:04,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436493703] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:36:04,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:36:04,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-15 00:36:04,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274926972] [2025-03-15 00:36:04,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:36:04,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 00:36:04,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:36:04,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 00:36:04,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-15 00:36:04,689 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 159 [2025-03-15 00:36:04,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 507 places, 5018 transitions, 365243 flow. Second operand has 9 states, 9 states have (on average 50.22222222222222) internal successors, (452), 9 states have internal predecessors, (452), 0 states have call successors, (0), 0 states 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:36:04,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:36:04,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 159 [2025-03-15 00:36:04,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:36:39,408 INFO L124 PetriNetUnfolderBase]: 9162/22450 cut-off events. [2025-03-15 00:36:39,408 INFO L125 PetriNetUnfolderBase]: For 1794731/1804764 co-relation queries the response was YES. [2025-03-15 00:36:39,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 676656 conditions, 22450 events. 9162/22450 cut-off events. For 1794731/1804764 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 198334 event pairs, 782 based on Foata normal form. 122/21536 useless extension candidates. Maximal degree in co-relation 673825. Up to 11890 conditions per place. [2025-03-15 00:36:39,810 INFO L140 encePairwiseOnDemand]: 143/159 looper letters, 4457 selfloop transitions, 73 changer transitions 10/4618 dead transitions. [2025-03-15 00:36:39,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 515 places, 4618 transitions, 344475 flow [2025-03-15 00:36:39,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 00:36:39,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 00:36:39,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 711 transitions. [2025-03-15 00:36:39,812 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.4968553459119497 [2025-03-15 00:36:39,812 INFO L298 CegarLoopForPetriNet]: 160 programPoint places, 355 predicate places. [2025-03-15 00:36:39,812 INFO L471 AbstractCegarLoop]: Abstraction has has 515 places, 4618 transitions, 344475 flow [2025-03-15 00:36:39,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 50.22222222222222) internal successors, (452), 9 states have internal predecessors, (452), 0 states have call successors, (0), 0 states 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:36:39,812 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:36:39,813 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:39,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-15 00:36:39,813 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:36:39,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:36:39,813 INFO L85 PathProgramCache]: Analyzing trace with hash -817811934, now seen corresponding path program 32 times [2025-03-15 00:36:39,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:36:39,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812629333] [2025-03-15 00:36:39,814 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 00:36:39,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:36:39,825 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 00:36:39,826 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:36:39,950 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-15 00:36:39,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:36:39,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812629333] [2025-03-15 00:36:39,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812629333] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:36:39,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:36:39,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-15 00:36:39,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539571082] [2025-03-15 00:36:39,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:36:39,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 00:36:39,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:36:39,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 00:36:39,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-15 00:36:39,952 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 159 [2025-03-15 00:36:39,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 515 places, 4618 transitions, 344475 flow. Second operand has 9 states, 9 states have (on average 50.22222222222222) internal successors, (452), 9 states have internal predecessors, (452), 0 states have call successors, (0), 0 states 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:36:39,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:36:39,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 159 [2025-03-15 00:36:39,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:37:14,779 INFO L124 PetriNetUnfolderBase]: 9873/24139 cut-off events. [2025-03-15 00:37:14,779 INFO L125 PetriNetUnfolderBase]: For 2055947/2067505 co-relation queries the response was YES. [2025-03-15 00:37:14,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 745517 conditions, 24139 events. 9873/24139 cut-off events. For 2055947/2067505 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 216476 event pairs, 834 based on Foata normal form. 107/23118 useless extension candidates. Maximal degree in co-relation 742611. Up to 12926 conditions per place. [2025-03-15 00:37:15,242 INFO L140 encePairwiseOnDemand]: 144/159 looper letters, 4874 selfloop transitions, 97 changer transitions 10/5059 dead transitions. [2025-03-15 00:37:15,243 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 523 places, 5059 transitions, 388177 flow [2025-03-15 00:37:15,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 00:37:15,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 00:37:15,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 728 transitions. [2025-03-15 00:37:15,244 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5087351502445842 [2025-03-15 00:37:15,244 INFO L298 CegarLoopForPetriNet]: 160 programPoint places, 363 predicate places. [2025-03-15 00:37:15,244 INFO L471 AbstractCegarLoop]: Abstraction has has 523 places, 5059 transitions, 388177 flow [2025-03-15 00:37:15,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 50.22222222222222) internal successors, (452), 9 states have internal predecessors, (452), 0 states have call successors, (0), 0 states 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:37:15,244 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:37:15,245 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:15,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-15 00:37:15,245 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:37:15,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:37:15,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1640321486, now seen corresponding path program 33 times [2025-03-15 00:37:15,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:37:15,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332916607] [2025-03-15 00:37:15,246 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-15 00:37:15,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:37:15,259 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-15 00:37:15,259 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:37:15,378 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-15 00:37:15,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:37:15,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332916607] [2025-03-15 00:37:15,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332916607] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:37:15,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:37:15,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-15 00:37:15,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846280855] [2025-03-15 00:37:15,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:37:15,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 00:37:15,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:37:15,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 00:37:15,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-15 00:37:15,380 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 159 [2025-03-15 00:37:15,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 523 places, 5059 transitions, 388177 flow. Second operand has 9 states, 9 states have (on average 50.22222222222222) internal successors, (452), 9 states have internal predecessors, (452), 0 states have call successors, (0), 0 states 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:37:15,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:37:15,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 159 [2025-03-15 00:37:15,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:37:50,255 INFO L124 PetriNetUnfolderBase]: 9901/24231 cut-off events. [2025-03-15 00:37:50,255 INFO L125 PetriNetUnfolderBase]: For 2178604/2190656 co-relation queries the response was YES. [2025-03-15 00:37:50,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 768086 conditions, 24231 events. 9901/24231 cut-off events. For 2178604/2190656 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 217719 event pairs, 828 based on Foata normal form. 142/23242 useless extension candidates. Maximal degree in co-relation 765105. Up to 12983 conditions per place. [2025-03-15 00:37:50,905 INFO L140 encePairwiseOnDemand]: 143/159 looper letters, 4929 selfloop transitions, 74 changer transitions 10/5091 dead transitions. [2025-03-15 00:37:50,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 531 places, 5091 transitions, 400699 flow [2025-03-15 00:37:50,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 00:37:50,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 00:37:50,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 726 transitions. [2025-03-15 00:37:50,908 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5073375262054507 [2025-03-15 00:37:50,908 INFO L298 CegarLoopForPetriNet]: 160 programPoint places, 371 predicate places. [2025-03-15 00:37:50,908 INFO L471 AbstractCegarLoop]: Abstraction has has 531 places, 5091 transitions, 400699 flow [2025-03-15 00:37:50,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 50.22222222222222) internal successors, (452), 9 states have internal predecessors, (452), 0 states have call successors, (0), 0 states 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:37:50,908 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:37:50,908 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:50,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-15 00:37:50,909 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:37:50,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:37:50,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1867757912, now seen corresponding path program 34 times [2025-03-15 00:37:50,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:37:50,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587571540] [2025-03-15 00:37:50,909 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-15 00:37:50,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:37:50,924 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-15 00:37:50,924 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:37:51,317 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-15 00:37:51,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:37:51,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587571540] [2025-03-15 00:37:51,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587571540] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:37:51,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:37:51,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-15 00:37:51,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659571130] [2025-03-15 00:37:51,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:37:51,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-15 00:37:51,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:37:51,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-15 00:37:51,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-15 00:37:51,319 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 159 [2025-03-15 00:37:51,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 531 places, 5091 transitions, 400699 flow. Second operand has 10 states, 10 states have (on average 49.2) internal successors, (492), 10 states have internal predecessors, (492), 0 states have call successors, (0), 0 states 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:37:51,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:37:51,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 159 [2025-03-15 00:37:51,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:38:30,392 INFO L124 PetriNetUnfolderBase]: 9901/24250 cut-off events. [2025-03-15 00:38:30,393 INFO L125 PetriNetUnfolderBase]: For 2296099/2308682 co-relation queries the response was YES. [2025-03-15 00:38:30,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 788014 conditions, 24250 events. 9901/24250 cut-off events. For 2296099/2308682 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 218100 event pairs, 828 based on Foata normal form. 133/23252 useless extension candidates. Maximal degree in co-relation 784958. Up to 12994 conditions per place. [2025-03-15 00:38:30,880 INFO L140 encePairwiseOnDemand]: 143/159 looper letters, 4881 selfloop transitions, 135 changer transitions 10/5104 dead transitions. [2025-03-15 00:38:30,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 540 places, 5104 transitions, 411791 flow [2025-03-15 00:38:30,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-15 00:38:30,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-15 00:38:30,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 751 transitions. [2025-03-15 00:38:30,881 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.47232704402515724 [2025-03-15 00:38:30,882 INFO L298 CegarLoopForPetriNet]: 160 programPoint places, 380 predicate places. [2025-03-15 00:38:30,882 INFO L471 AbstractCegarLoop]: Abstraction has has 540 places, 5104 transitions, 411791 flow [2025-03-15 00:38:30,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 49.2) internal successors, (492), 10 states have internal predecessors, (492), 0 states have call successors, (0), 0 states 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:38:30,882 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:38:30,882 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:30,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-15 00:38:30,882 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:38:30,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:38:30,883 INFO L85 PathProgramCache]: Analyzing trace with hash -403060810, now seen corresponding path program 35 times [2025-03-15 00:38:30,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:38:30,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941256028] [2025-03-15 00:38:30,883 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-15 00:38:30,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:38:30,896 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-15 00:38:30,896 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:38:31,490 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2025-03-15 00:38:31,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:38:31,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941256028] [2025-03-15 00:38:31,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941256028] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 00:38:31,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [365003613] [2025-03-15 00:38:31,490 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-15 00:38:31,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 00:38:31,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:38:31,492 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:38:31,494 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:38:31,646 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-15 00:38:31,646 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:38:31,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-15 00:38:31,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 00:38:31,812 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 13 treesize of output 9 [2025-03-15 00:38:31,827 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-15 00:38:31,827 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-15 00:38:31,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [365003613] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:38:31,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-15 00:38:31,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2025-03-15 00:38:31,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640495833] [2025-03-15 00:38:31,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:38:31,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-15 00:38:31,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:38:31,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-15 00:38:31,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2025-03-15 00:38:31,829 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 159 [2025-03-15 00:38:31,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 540 places, 5104 transitions, 411791 flow. Second operand has 10 states, 10 states have (on average 49.2) internal successors, (492), 10 states have internal predecessors, (492), 0 states have call successors, (0), 0 states 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:38:31,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:38:31,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 159 [2025-03-15 00:38:31,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:39:08,053 INFO L124 PetriNetUnfolderBase]: 9908/24296 cut-off events. [2025-03-15 00:39:08,053 INFO L125 PetriNetUnfolderBase]: For 2407943/2420911 co-relation queries the response was YES. [2025-03-15 00:39:08,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 809272 conditions, 24296 events. 9908/24296 cut-off events. For 2407943/2420911 co-relation queries the response was YES. Maximal size of possible extension queue 423. Compared 218887 event pairs, 813 based on Foata normal form. 161/23323 useless extension candidates. Maximal degree in co-relation 806141. Up to 12953 conditions per place. [2025-03-15 00:39:08,598 INFO L140 encePairwiseOnDemand]: 142/159 looper letters, 4818 selfloop transitions, 133 changer transitions 12/5041 dead transitions. [2025-03-15 00:39:08,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 552 places, 5041 transitions, 416443 flow [2025-03-15 00:39:08,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-15 00:39:08,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-15 00:39:08,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 943 transitions. [2025-03-15 00:39:08,600 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.4562167392356072 [2025-03-15 00:39:08,600 INFO L298 CegarLoopForPetriNet]: 160 programPoint places, 392 predicate places. [2025-03-15 00:39:08,600 INFO L471 AbstractCegarLoop]: Abstraction has has 552 places, 5041 transitions, 416443 flow [2025-03-15 00:39:08,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 49.2) internal successors, (492), 10 states have internal predecessors, (492), 0 states have call successors, (0), 0 states 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:39:08,601 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:39:08,601 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:08,608 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:39:08,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 00:39:08,805 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 00:39:08,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:39:08,806 INFO L85 PathProgramCache]: Analyzing trace with hash -927312482, now seen corresponding path program 36 times [2025-03-15 00:39:08,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:39:08,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013611735] [2025-03-15 00:39:08,806 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-15 00:39:08,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:39:08,818 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-15 00:39:08,818 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:39:08,941 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-15 00:39:08,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:39:08,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013611735] [2025-03-15 00:39:08,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013611735] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:39:08,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:39:08,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-15 00:39:08,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059498892] [2025-03-15 00:39:08,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:39:08,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 00:39:08,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:39:08,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 00:39:08,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-15 00:39:08,943 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 159 [2025-03-15 00:39:08,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 552 places, 5041 transitions, 416443 flow. Second operand has 9 states, 9 states have (on average 50.22222222222222) internal successors, (452), 9 states have internal predecessors, (452), 0 states have call successors, (0), 0 states 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:39:08,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:39:08,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 159 [2025-03-15 00:39:08,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2025-03-15 00:39:32,959 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:39:32,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 00:39:32,986 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONDATA_RACE (6 of 7 remaining) [2025-03-15 00:39:32,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-03-15 00:39:32,987 WARN L596 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (9states, 40/159 universal loopers) in iteration 46,while PetriNetUnfolder was constructing finite prefix that currently has 461168 conditions, 13234 events (5089/13233 cut-off events. For 1409664/1423387 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 123080 event pairs, 165 based on Foata normal form. 143/13216 useless extension candidates. Maximal degree in co-relation 457962. Up to 6923 conditions per place.). [2025-03-15 00:39:32,990 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2025-03-15 00:39:32,990 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2025-03-15 00:39:32,990 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-03-15 00:39:32,990 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2025-03-15 00:39:32,990 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2025-03-15 00:39:32,990 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2025-03-15 00:39:32,990 INFO L422 BasicCegarLoop]: Path program histogram: [36, 2, 2, 2, 2, 1, 1] [2025-03-15 00:39:33,002 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-15 00:39:33,002 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-15 00:39:33,012 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 12:39:33 BasicIcfg [2025-03-15 00:39:33,012 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-15 00:39:33,013 INFO L158 Benchmark]: Toolchain (without parser) took 826471.32ms. Allocated memory was 71.3MB in the beginning and 3.1GB in the end (delta: 3.0GB). Free memory was 41.9MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 3.1GB. Max. memory is 8.0GB. [2025-03-15 00:39:33,013 INFO L158 Benchmark]: CDTParser took 1.16ms. Allocated memory is still 71.3MB. Free memory is still 33.6MB. There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 00:39:33,013 INFO L158 Benchmark]: CACSL2BoogieTranslator took 400.03ms. Allocated memory is still 71.3MB. Free memory was 41.8MB in the beginning and 36.7MB in the end (delta: 5.0MB). Peak memory consumption was 30.2MB. Max. memory is 8.0GB. [2025-03-15 00:39:33,013 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.50ms. Allocated memory is still 71.3MB. Free memory was 36.7MB in the beginning and 34.0MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 00:39:33,014 INFO L158 Benchmark]: Boogie Preprocessor took 23.75ms. Allocated memory is still 71.3MB. Free memory was 34.0MB in the beginning and 32.3MB in the end (delta: 1.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-15 00:39:33,014 INFO L158 Benchmark]: RCFGBuilder took 368.29ms. Allocated memory was 71.3MB in the beginning and 88.1MB in the end (delta: 16.8MB). Free memory was 31.9MB in the beginning and 52.3MB in the end (delta: -20.3MB). Peak memory consumption was 20.6MB. Max. memory is 8.0GB. [2025-03-15 00:39:33,014 INFO L158 Benchmark]: TraceAbstraction took 825630.37ms. Allocated memory was 88.1MB in the beginning and 3.1GB in the end (delta: 3.0GB). Free memory was 51.0MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 3.1GB. Max. memory is 8.0GB. [2025-03-15 00:39:33,015 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.16ms. Allocated memory is still 71.3MB. Free memory is still 33.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 400.03ms. Allocated memory is still 71.3MB. Free memory was 41.8MB in the beginning and 36.7MB in the end (delta: 5.0MB). Peak memory consumption was 30.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 38.50ms. Allocated memory is still 71.3MB. Free memory was 36.7MB in the beginning and 34.0MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 23.75ms. Allocated memory is still 71.3MB. Free memory was 34.0MB in the beginning and 32.3MB in the end (delta: 1.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 368.29ms. Allocated memory was 71.3MB in the beginning and 88.1MB in the end (delta: 16.8MB). Free memory was 31.9MB in the beginning and 52.3MB in the end (delta: -20.3MB). Peak memory consumption was 20.6MB. Max. memory is 8.0GB. * TraceAbstraction took 825630.37ms. Allocated memory was 88.1MB in the beginning and 3.1GB in the end (delta: 3.0GB). Free memory was 51.0MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 3.1GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 923]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (9states, 40/159 universal loopers) in iteration 46,while PetriNetUnfolder was constructing finite prefix that currently has 461168 conditions, 13234 events (5089/13233 cut-off events. For 1409664/1423387 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 123080 event pairs, 165 based on Foata normal form. 143/13216 useless extension candidates. Maximal degree in co-relation 457962. Up to 6923 conditions per place.). - TimeoutResultAtElement [Line: 923]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (9states, 40/159 universal loopers) in iteration 46,while PetriNetUnfolder was constructing finite prefix that currently has 461168 conditions, 13234 events (5089/13233 cut-off events. For 1409664/1423387 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 123080 event pairs, 165 based on Foata normal form. 143/13216 useless extension candidates. Maximal degree in co-relation 457962. Up to 6923 conditions per place.). - TimeoutResultAtElement [Line: 923]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (9states, 40/159 universal loopers) in iteration 46,while PetriNetUnfolder was constructing finite prefix that currently has 461168 conditions, 13234 events (5089/13233 cut-off events. For 1409664/1423387 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 123080 event pairs, 165 based on Foata normal form. 143/13216 useless extension candidates. Maximal degree in co-relation 457962. Up to 6923 conditions per place.). - TimeoutResultAtElement [Line: 937]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (9states, 40/159 universal loopers) in iteration 46,while PetriNetUnfolder was constructing finite prefix that currently has 461168 conditions, 13234 events (5089/13233 cut-off events. For 1409664/1423387 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 123080 event pairs, 165 based on Foata normal form. 143/13216 useless extension candidates. Maximal degree in co-relation 457962. Up to 6923 conditions per place.). - TimeoutResultAtElement [Line: 923]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (9states, 40/159 universal loopers) in iteration 46,while PetriNetUnfolder was constructing finite prefix that currently has 461168 conditions, 13234 events (5089/13233 cut-off events. For 1409664/1423387 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 123080 event pairs, 165 based on Foata normal form. 143/13216 useless extension candidates. Maximal degree in co-relation 457962. Up to 6923 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 196 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.1s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 825.5s, OverallIterations: 46, TraceHistogramMax: 10, PathProgramHistogramMax: 36, EmptinessCheckTime: 0.0s, AutomataDifference: 808.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12122 SdHoareTripleChecker+Valid, 15.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12122 mSDsluCounter, 29592 SdHoareTripleChecker+Invalid, 11.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 22532 mSDsCounter, 105 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 28077 IncrementalHoareTripleChecker+Invalid, 28182 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 105 mSolverCounterUnsat, 7060 mSDtfsCounter, 28077 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2292 GetRequests, 1648 SyntacticMatches, 11 SemanticMatches, 633 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1387 ImplicationChecksByTransitivity, 4.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=416443occurred in iteration=45, InterpolantAutomatonStates: 438, 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: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 13.3s InterpolantComputationTime, 8278 NumberOfCodeBlocks, 7228 NumberOfCodeBlocksAsserted, 181 NumberOfCheckSat, 8553 ConstructedInterpolants, 0 QuantifiedInterpolants, 21562 SizeOfPredicates, 82 NumberOfNonLiveVariables, 2895 ConjunctsInSsa, 190 ConjunctsInUnsatCore, 58 InterpolantComputations, 43 PerfectInterpolantSequences, 10772/11333 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