/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/13-privatized_24-multiple-protecting_true.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 00:41:56,357 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 00:41:56,478 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:41:56,513 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 00:41:56,515 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 00:41:56,515 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 00:41:56,516 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 00:41:56,516 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 00:41:56,516 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 00:41:56,516 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 00:41:56,517 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 00:41:56,517 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 00:41:56,517 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 00:41:56,517 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 00:41:56,517 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 00:41:56,517 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 00:41:56,518 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 00:41:56,518 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 00:41:56,518 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 00:41:56,518 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 00:41:56,518 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 00:41:56,518 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 00:41:56,518 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 00:41:56,518 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 00:41:56,518 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 00:41:56,518 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 00:41:56,518 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 00:41:56,518 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 00:41:56,518 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 00:41:56,519 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 00:41:56,519 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 00:41:56,519 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 00:41:56,519 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:41:56,766 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 00:41:56,771 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 00:41:56,773 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 00:41:56,773 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 00:41:56,774 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 00:41:56,774 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_24-multiple-protecting_true.i [2025-03-15 00:41:57,933 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee45c21b1/8f26f3b11b784339af69e774cc8c4144/FLAGce82622d4 [2025-03-15 00:41:58,146 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 00:41:58,146 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_24-multiple-protecting_true.i [2025-03-15 00:41:58,158 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee45c21b1/8f26f3b11b784339af69e774cc8c4144/FLAGce82622d4 [2025-03-15 00:41:58,173 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee45c21b1/8f26f3b11b784339af69e774cc8c4144 [2025-03-15 00:41:58,175 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 00:41:58,176 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 00:41:58,177 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 00:41:58,177 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 00:41:58,180 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 00:41:58,180 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 12:41:58" (1/1) ... [2025-03-15 00:41:58,181 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b2cab7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:41:58, skipping insertion in model container [2025-03-15 00:41:58,181 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 12:41:58" (1/1) ... [2025-03-15 00:41:58,215 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 00:41:58,445 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 00:41:58,466 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 00:41:58,497 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 00:41:58,526 INFO L204 MainTranslator]: Completed translation [2025-03-15 00:41:58,527 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:41:58 WrapperNode [2025-03-15 00:41:58,527 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 00:41:58,528 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 00:41:58,528 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 00:41:58,528 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 00:41:58,533 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:41:58" (1/1) ... [2025-03-15 00:41:58,544 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:41:58" (1/1) ... [2025-03-15 00:41:58,563 INFO L138 Inliner]: procedures = 162, calls = 54, calls flagged for inlining = 7, calls inlined = 10, statements flattened = 117 [2025-03-15 00:41:58,564 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 00:41:58,565 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 00:41:58,565 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 00:41:58,565 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 00:41:58,569 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:41:58" (1/1) ... [2025-03-15 00:41:58,570 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:41:58" (1/1) ... [2025-03-15 00:41:58,572 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:41:58" (1/1) ... [2025-03-15 00:41:58,572 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:41:58" (1/1) ... [2025-03-15 00:41:58,582 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:41:58" (1/1) ... [2025-03-15 00:41:58,583 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:41:58" (1/1) ... [2025-03-15 00:41:58,585 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:41:58" (1/1) ... [2025-03-15 00:41:58,586 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:41:58" (1/1) ... [2025-03-15 00:41:58,587 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:41:58" (1/1) ... [2025-03-15 00:41:58,588 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 00:41:58,589 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 00:41:58,589 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 00:41:58,589 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 00:41:58,590 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:41:58" (1/1) ... [2025-03-15 00:41:58,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 00:41:58,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:41:58,642 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:41:58,645 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:41:58,662 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-15 00:41:58,662 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 00:41:58,662 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-15 00:41:58,662 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-15 00:41:58,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 00:41:58,662 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-15 00:41:58,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 00:41:58,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 00:41:58,663 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:41:58,746 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 00:41:58,748 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 00:41:58,980 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 00:41:58,980 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 00:41:59,027 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 00:41:59,027 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-15 00:41:59,027 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 12:41:59 BoogieIcfgContainer [2025-03-15 00:41:59,027 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 00:41:59,033 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 00:41:59,033 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 00:41:59,036 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 00:41:59,036 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 12:41:58" (1/3) ... [2025-03-15 00:41:59,036 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c5bad45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 12:41:59, skipping insertion in model container [2025-03-15 00:41:59,036 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:41:58" (2/3) ... [2025-03-15 00:41:59,037 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c5bad45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 12:41:59, skipping insertion in model container [2025-03-15 00:41:59,037 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 12:41:59" (3/3) ... [2025-03-15 00:41:59,038 INFO L128 eAbstractionObserver]: Analyzing ICFG 13-privatized_24-multiple-protecting_true.i [2025-03-15 00:41:59,049 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 00:41:59,051 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG 13-privatized_24-multiple-protecting_true.i that has 2 procedures, 196 locations, 1 initial locations, 0 loop locations, and 12 error locations. [2025-03-15 00:41:59,051 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 00:41:59,113 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-15 00:41:59,142 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 00:41:59,152 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;@4f1417ec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 00:41:59,153 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2025-03-15 00:41:59,180 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 00:41:59,180 INFO L124 PetriNetUnfolderBase]: 0/49 cut-off events. [2025-03-15 00:41:59,184 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 00:41:59,184 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:41:59,184 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] [2025-03-15 00:41:59,185 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-15 00:41:59,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:41:59,189 INFO L85 PathProgramCache]: Analyzing trace with hash -849867250, now seen corresponding path program 1 times [2025-03-15 00:41:59,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:41:59,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723447747] [2025-03-15 00:41:59,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:41:59,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:41:59,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:41:59,365 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:41:59,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:41:59,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723447747] [2025-03-15 00:41:59,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723447747] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:41:59,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:41:59,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:41:59,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028550284] [2025-03-15 00:41:59,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:41:59,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:41:59,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:41:59,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:41:59,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:41:59,395 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 203 [2025-03-15 00:41:59,400 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 203 transitions, 413 flow. Second operand has 3 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 0 states have call successors, (0), 0 states 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:41:59,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:41:59,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 203 [2025-03-15 00:41:59,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:41:59,977 INFO L124 PetriNetUnfolderBase]: 665/3341 cut-off events. [2025-03-15 00:41:59,977 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-15 00:41:59,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4762 conditions, 3341 events. 665/3341 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 27265 event pairs, 124 based on Foata normal form. 274/3264 useless extension candidates. Maximal degree in co-relation 4706. Up to 811 conditions per place. [2025-03-15 00:42:00,009 INFO L140 encePairwiseOnDemand]: 180/203 looper letters, 70 selfloop transitions, 10 changer transitions 6/221 dead transitions. [2025-03-15 00:42:00,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 221 transitions, 615 flow [2025-03-15 00:42:00,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:42:00,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:42:00,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 535 transitions. [2025-03-15 00:42:00,027 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8784893267651889 [2025-03-15 00:42:00,029 INFO L298 CegarLoopForPetriNet]: 199 programPoint places, -9 predicate places. [2025-03-15 00:42:00,029 INFO L471 AbstractCegarLoop]: Abstraction has has 190 places, 221 transitions, 615 flow [2025-03-15 00:42:00,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 0 states have call successors, (0), 0 states 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:42:00,032 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:42:00,032 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] [2025-03-15 00:42:00,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 00:42:00,032 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-15 00:42:00,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:42:00,033 INFO L85 PathProgramCache]: Analyzing trace with hash -433555147, now seen corresponding path program 1 times [2025-03-15 00:42:00,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:42:00,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322238026] [2025-03-15 00:42:00,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:42:00,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:42:00,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:42:00,131 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:42:00,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:42:00,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322238026] [2025-03-15 00:42:00,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322238026] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:42:00,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:42:00,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:42:00,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937637106] [2025-03-15 00:42:00,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:42:00,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:42:00,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:42:00,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:42:00,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:42:00,136 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 203 [2025-03-15 00:42:00,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 221 transitions, 615 flow. Second operand has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:42:00,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:42:00,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 203 [2025-03-15 00:42:00,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:42:00,689 INFO L124 PetriNetUnfolderBase]: 725/3628 cut-off events. [2025-03-15 00:42:00,689 INFO L125 PetriNetUnfolderBase]: For 619/816 co-relation queries the response was YES. [2025-03-15 00:42:00,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6639 conditions, 3628 events. 725/3628 cut-off events. For 619/816 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 30060 event pairs, 140 based on Foata normal form. 20/3305 useless extension candidates. Maximal degree in co-relation 6579. Up to 1410 conditions per place. [2025-03-15 00:42:00,705 INFO L140 encePairwiseOnDemand]: 196/203 looper letters, 111 selfloop transitions, 8 changer transitions 6/258 dead transitions. [2025-03-15 00:42:00,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 258 transitions, 1003 flow [2025-03-15 00:42:00,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:42:00,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:42:00,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 497 transitions. [2025-03-15 00:42:00,708 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8160919540229885 [2025-03-15 00:42:00,709 INFO L298 CegarLoopForPetriNet]: 199 programPoint places, -7 predicate places. [2025-03-15 00:42:00,709 INFO L471 AbstractCegarLoop]: Abstraction has has 192 places, 258 transitions, 1003 flow [2025-03-15 00:42:00,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:42:00,710 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:42:00,710 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] [2025-03-15 00:42:00,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-15 00:42:00,710 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-15 00:42:00,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:42:00,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1441653101, now seen corresponding path program 1 times [2025-03-15 00:42:00,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:42:00,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983776723] [2025-03-15 00:42:00,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:42:00,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:42:00,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:42:00,966 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:42:00,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:42:00,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983776723] [2025-03-15 00:42:00,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983776723] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:42:00,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:42:00,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:42:00,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349499617] [2025-03-15 00:42:00,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:42:00,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-15 00:42:00,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:42:00,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-15 00:42:00,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-15 00:42:00,969 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 203 [2025-03-15 00:42:00,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 258 transitions, 1003 flow. Second operand has 5 states, 5 states have (on average 156.4) internal successors, (782), 5 states have internal predecessors, (782), 0 states have call successors, (0), 0 states 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:42:00,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:42:00,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 203 [2025-03-15 00:42:00,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:42:01,198 INFO L124 PetriNetUnfolderBase]: 273/1705 cut-off events. [2025-03-15 00:42:01,199 INFO L125 PetriNetUnfolderBase]: For 891/1034 co-relation queries the response was YES. [2025-03-15 00:42:01,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3472 conditions, 1705 events. 273/1705 cut-off events. For 891/1034 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 12052 event pairs, 39 based on Foata normal form. 31/1600 useless extension candidates. Maximal degree in co-relation 3396. Up to 636 conditions per place. [2025-03-15 00:42:01,205 INFO L140 encePairwiseOnDemand]: 195/203 looper letters, 74 selfloop transitions, 14 changer transitions 10/251 dead transitions. [2025-03-15 00:42:01,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 251 transitions, 1149 flow [2025-03-15 00:42:01,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 00:42:01,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 00:42:01,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 827 transitions. [2025-03-15 00:42:01,208 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8147783251231527 [2025-03-15 00:42:01,208 INFO L298 CegarLoopForPetriNet]: 199 programPoint places, -5 predicate places. [2025-03-15 00:42:01,208 INFO L471 AbstractCegarLoop]: Abstraction has has 194 places, 251 transitions, 1149 flow [2025-03-15 00:42:01,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 156.4) internal successors, (782), 5 states have internal predecessors, (782), 0 states have call successors, (0), 0 states 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:42:01,209 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:42:01,209 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] [2025-03-15 00:42:01,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-15 00:42:01,209 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-15 00:42:01,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:42:01,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1036238888, now seen corresponding path program 1 times [2025-03-15 00:42:01,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:42:01,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845503097] [2025-03-15 00:42:01,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:42:01,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:42:01,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:42:01,259 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:42:01,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:42:01,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845503097] [2025-03-15 00:42:01,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845503097] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:42:01,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:42:01,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:42:01,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690626959] [2025-03-15 00:42:01,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:42:01,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:42:01,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:42:01,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:42:01,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:42:01,261 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 203 [2025-03-15 00:42:01,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 251 transitions, 1149 flow. Second operand has 3 states, 3 states have (on average 146.66666666666666) internal successors, (440), 3 states have internal predecessors, (440), 0 states have call successors, (0), 0 states 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:42:01,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:42:01,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 203 [2025-03-15 00:42:01,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:42:01,517 INFO L124 PetriNetUnfolderBase]: 286/1766 cut-off events. [2025-03-15 00:42:01,517 INFO L125 PetriNetUnfolderBase]: For 1698/1971 co-relation queries the response was YES. [2025-03-15 00:42:01,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4239 conditions, 1766 events. 286/1766 cut-off events. For 1698/1971 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 12591 event pairs, 48 based on Foata normal form. 3/1637 useless extension candidates. Maximal degree in co-relation 4159. Up to 643 conditions per place. [2025-03-15 00:42:01,527 INFO L140 encePairwiseOnDemand]: 198/203 looper letters, 113 selfloop transitions, 4 changer transitions 10/261 dead transitions. [2025-03-15 00:42:01,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 261 transitions, 1461 flow [2025-03-15 00:42:01,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:42:01,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:42:01,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 480 transitions. [2025-03-15 00:42:01,529 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7881773399014779 [2025-03-15 00:42:01,529 INFO L298 CegarLoopForPetriNet]: 199 programPoint places, -3 predicate places. [2025-03-15 00:42:01,529 INFO L471 AbstractCegarLoop]: Abstraction has has 196 places, 261 transitions, 1461 flow [2025-03-15 00:42:01,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 146.66666666666666) internal successors, (440), 3 states have internal predecessors, (440), 0 states have call successors, (0), 0 states 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:42:01,530 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:42:01,530 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] [2025-03-15 00:42:01,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-15 00:42:01,530 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-15 00:42:01,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:42:01,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1878906357, now seen corresponding path program 1 times [2025-03-15 00:42:01,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:42:01,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718028147] [2025-03-15 00:42:01,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:42:01,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:42:01,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:42:01,576 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:42:01,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:42:01,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718028147] [2025-03-15 00:42:01,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718028147] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:42:01,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:42:01,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:42:01,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612117195] [2025-03-15 00:42:01,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:42:01,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:42:01,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:42:01,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:42:01,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:42:01,578 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 203 [2025-03-15 00:42:01,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 261 transitions, 1461 flow. Second operand has 3 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 0 states 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:42:01,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:42:01,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 203 [2025-03-15 00:42:01,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:42:01,900 INFO L124 PetriNetUnfolderBase]: 538/2649 cut-off events. [2025-03-15 00:42:01,900 INFO L125 PetriNetUnfolderBase]: For 5510/5759 co-relation queries the response was YES. [2025-03-15 00:42:01,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7225 conditions, 2649 events. 538/2649 cut-off events. For 5510/5759 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 20314 event pairs, 112 based on Foata normal form. 2/2439 useless extension candidates. Maximal degree in co-relation 7130. Up to 924 conditions per place. [2025-03-15 00:42:01,916 INFO L140 encePairwiseOnDemand]: 194/203 looper letters, 114 selfloop transitions, 6 changer transitions 26/301 dead transitions. [2025-03-15 00:42:01,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 301 transitions, 2100 flow [2025-03-15 00:42:01,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:42:01,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:42:01,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 525 transitions. [2025-03-15 00:42:01,919 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8620689655172413 [2025-03-15 00:42:01,919 INFO L298 CegarLoopForPetriNet]: 199 programPoint places, -3 predicate places. [2025-03-15 00:42:01,919 INFO L471 AbstractCegarLoop]: Abstraction has has 196 places, 301 transitions, 2100 flow [2025-03-15 00:42:01,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 0 states 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:42:01,919 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:42:01,920 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] [2025-03-15 00:42:01,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-15 00:42:01,920 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-15 00:42:01,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:42:01,920 INFO L85 PathProgramCache]: Analyzing trace with hash -268824090, now seen corresponding path program 1 times [2025-03-15 00:42:01,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:42:01,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109381130] [2025-03-15 00:42:01,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:42:01,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:42:01,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:42:01,982 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:42:01,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:42:01,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109381130] [2025-03-15 00:42:01,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109381130] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:42:01,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:42:01,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:42:01,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387041795] [2025-03-15 00:42:01,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:42:01,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:42:01,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:42:01,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:42:01,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:42:01,984 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 203 [2025-03-15 00:42:01,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 301 transitions, 2100 flow. Second operand has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states 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:42:01,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:42:01,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 203 [2025-03-15 00:42:01,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:42:02,275 INFO L124 PetriNetUnfolderBase]: 572/2734 cut-off events. [2025-03-15 00:42:02,275 INFO L125 PetriNetUnfolderBase]: For 7993/8396 co-relation queries the response was YES. [2025-03-15 00:42:02,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8541 conditions, 2734 events. 572/2734 cut-off events. For 7993/8396 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 21227 event pairs, 107 based on Foata normal form. 6/2548 useless extension candidates. Maximal degree in co-relation 8441. Up to 979 conditions per place. [2025-03-15 00:42:02,287 INFO L140 encePairwiseOnDemand]: 198/203 looper letters, 143 selfloop transitions, 4 changer transitions 26/326 dead transitions. [2025-03-15 00:42:02,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 326 transitions, 2696 flow [2025-03-15 00:42:02,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:42:02,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:42:02,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 503 transitions. [2025-03-15 00:42:02,288 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.825944170771757 [2025-03-15 00:42:02,290 INFO L298 CegarLoopForPetriNet]: 199 programPoint places, -1 predicate places. [2025-03-15 00:42:02,290 INFO L471 AbstractCegarLoop]: Abstraction has has 198 places, 326 transitions, 2696 flow [2025-03-15 00:42:02,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states 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:42:02,291 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:42:02,291 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] [2025-03-15 00:42:02,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-15 00:42:02,292 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-15 00:42:02,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:42:02,293 INFO L85 PathProgramCache]: Analyzing trace with hash 2025854313, now seen corresponding path program 1 times [2025-03-15 00:42:02,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:42:02,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905987141] [2025-03-15 00:42:02,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:42:02,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:42:02,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:42:02,352 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:42:02,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:42:02,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905987141] [2025-03-15 00:42:02,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905987141] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:42:02,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:42:02,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:42:02,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542554405] [2025-03-15 00:42:02,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:42:02,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:42:02,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:42:02,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:42:02,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:42:02,354 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 203 [2025-03-15 00:42:02,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 326 transitions, 2696 flow. Second operand has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 states 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:42:02,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:42:02,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 203 [2025-03-15 00:42:02,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:42:02,710 INFO L124 PetriNetUnfolderBase]: 606/2817 cut-off events. [2025-03-15 00:42:02,710 INFO L125 PetriNetUnfolderBase]: For 11233/11946 co-relation queries the response was YES. [2025-03-15 00:42:02,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9890 conditions, 2817 events. 606/2817 cut-off events. For 11233/11946 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 21914 event pairs, 104 based on Foata normal form. 8/2654 useless extension candidates. Maximal degree in co-relation 9785. Up to 996 conditions per place. [2025-03-15 00:42:02,724 INFO L140 encePairwiseOnDemand]: 198/203 looper letters, 96 selfloop transitions, 3 changer transitions 107/351 dead transitions. [2025-03-15 00:42:02,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 351 transitions, 3388 flow [2025-03-15 00:42:02,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:42:02,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:42:02,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 503 transitions. [2025-03-15 00:42:02,726 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.825944170771757 [2025-03-15 00:42:02,726 INFO L298 CegarLoopForPetriNet]: 199 programPoint places, 1 predicate places. [2025-03-15 00:42:02,727 INFO L471 AbstractCegarLoop]: Abstraction has has 200 places, 351 transitions, 3388 flow [2025-03-15 00:42:02,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 states 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:42:02,727 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:42:02,727 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:42:02,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-15 00:42:02,727 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-15 00:42:02,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:42:02,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1798225911, now seen corresponding path program 1 times [2025-03-15 00:42:02,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:42:02,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150978180] [2025-03-15 00:42:02,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:42:02,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:42:02,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:42:02,981 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:42:02,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:42:02,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150978180] [2025-03-15 00:42:02,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150978180] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:42:02,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:42:02,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-15 00:42:02,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650946788] [2025-03-15 00:42:02,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:42:02,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:42:02,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:42:02,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:42:02,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:42:02,983 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 203 [2025-03-15 00:42:02,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 351 transitions, 3388 flow. Second operand has 6 states, 6 states have (on average 157.16666666666666) internal successors, (943), 6 states have internal predecessors, (943), 0 states have call successors, (0), 0 states 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:42:02,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:42:02,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 203 [2025-03-15 00:42:02,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:42:03,212 INFO L124 PetriNetUnfolderBase]: 232/1646 cut-off events. [2025-03-15 00:42:03,213 INFO L125 PetriNetUnfolderBase]: For 9885/10036 co-relation queries the response was YES. [2025-03-15 00:42:03,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5991 conditions, 1646 events. 232/1646 cut-off events. For 9885/10036 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 10726 event pairs, 41 based on Foata normal form. 130/1723 useless extension candidates. Maximal degree in co-relation 5869. Up to 559 conditions per place. [2025-03-15 00:42:03,217 INFO L140 encePairwiseOnDemand]: 183/203 looper letters, 0 selfloop transitions, 0 changer transitions 295/295 dead transitions. [2025-03-15 00:42:03,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 295 transitions, 3112 flow [2025-03-15 00:42:03,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 00:42:03,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 00:42:03,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 825 transitions. [2025-03-15 00:42:03,219 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.812807881773399 [2025-03-15 00:42:03,219 INFO L298 CegarLoopForPetriNet]: 199 programPoint places, -1 predicate places. [2025-03-15 00:42:03,219 INFO L471 AbstractCegarLoop]: Abstraction has has 198 places, 295 transitions, 3112 flow [2025-03-15 00:42:03,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 157.16666666666666) internal successors, (943), 6 states have internal predecessors, (943), 0 states have call successors, (0), 0 states 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:42:03,228 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/13-privatized_24-multiple-protecting_true.i_petrified1_AllErrorsAtOnce [2025-03-15 00:42:03,245 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (20 of 21 remaining) [2025-03-15 00:42:03,245 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (19 of 21 remaining) [2025-03-15 00:42:03,245 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (18 of 21 remaining) [2025-03-15 00:42:03,245 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (17 of 21 remaining) [2025-03-15 00:42:03,245 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 21 remaining) [2025-03-15 00:42:03,245 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (15 of 21 remaining) [2025-03-15 00:42:03,245 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (14 of 21 remaining) [2025-03-15 00:42:03,245 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (13 of 21 remaining) [2025-03-15 00:42:03,246 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (12 of 21 remaining) [2025-03-15 00:42:03,246 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr4ASSERT_VIOLATIONDATA_RACE (11 of 21 remaining) [2025-03-15 00:42:03,246 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr5ASSERT_VIOLATIONDATA_RACE (10 of 21 remaining) [2025-03-15 00:42:03,246 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr6ASSERT_VIOLATIONDATA_RACE (9 of 21 remaining) [2025-03-15 00:42:03,246 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr7ASSERT_VIOLATIONDATA_RACE (8 of 21 remaining) [2025-03-15 00:42:03,246 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 21 remaining) [2025-03-15 00:42:03,246 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 21 remaining) [2025-03-15 00:42:03,246 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 21 remaining) [2025-03-15 00:42:03,246 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 21 remaining) [2025-03-15 00:42:03,246 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr4ASSERT_VIOLATIONDATA_RACE (3 of 21 remaining) [2025-03-15 00:42:03,246 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr5ASSERT_VIOLATIONDATA_RACE (2 of 21 remaining) [2025-03-15 00:42:03,246 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr6ASSERT_VIOLATIONDATA_RACE (1 of 21 remaining) [2025-03-15 00:42:03,246 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr7ASSERT_VIOLATIONDATA_RACE (0 of 21 remaining) [2025-03-15 00:42:03,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-15 00:42:03,246 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:42:03,250 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-15 00:42:03,250 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-15 00:42:03,263 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 12:42:03 BasicIcfg [2025-03-15 00:42:03,263 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-15 00:42:03,264 INFO L158 Benchmark]: Toolchain (without parser) took 5087.55ms. Allocated memory was 71.3MB in the beginning and 209.7MB in the end (delta: 138.4MB). Free memory was 43.8MB in the beginning and 149.1MB in the end (delta: -105.3MB). Peak memory consumption was 153.5MB. Max. memory is 8.0GB. [2025-03-15 00:42:03,264 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 71.3MB. Free memory was 33.0MB in the beginning and 32.9MB in the end (delta: 42.0kB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 00:42:03,264 INFO L158 Benchmark]: CACSL2BoogieTranslator took 350.80ms. Allocated memory is still 71.3MB. Free memory was 43.6MB in the beginning and 23.4MB in the end (delta: 20.2MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-03-15 00:42:03,264 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.85ms. Allocated memory is still 71.3MB. Free memory was 23.4MB in the beginning and 21.6MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-15 00:42:03,264 INFO L158 Benchmark]: Boogie Preprocessor took 23.92ms. Allocated memory is still 71.3MB. Free memory was 21.6MB in the beginning and 20.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 00:42:03,264 INFO L158 Benchmark]: RCFGBuilder took 438.04ms. Allocated memory is still 71.3MB. Free memory was 20.3MB in the beginning and 23.4MB in the end (delta: -3.2MB). Peak memory consumption was 7.0MB. Max. memory is 8.0GB. [2025-03-15 00:42:03,264 INFO L158 Benchmark]: TraceAbstraction took 4230.36ms. Allocated memory was 71.3MB in the beginning and 209.7MB in the end (delta: 138.4MB). Free memory was 22.5MB in the beginning and 149.1MB in the end (delta: -126.6MB). Peak memory consumption was 133.9MB. Max. memory is 8.0GB. [2025-03-15 00:42:03,265 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 71.3MB. Free memory was 33.0MB in the beginning and 32.9MB in the end (delta: 42.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 350.80ms. Allocated memory is still 71.3MB. Free memory was 43.6MB in the beginning and 23.4MB in the end (delta: 20.2MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.85ms. Allocated memory is still 71.3MB. Free memory was 23.4MB in the beginning and 21.6MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.92ms. Allocated memory is still 71.3MB. Free memory was 21.6MB in the beginning and 20.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 438.04ms. Allocated memory is still 71.3MB. Free memory was 20.3MB in the beginning and 23.4MB in the end (delta: -3.2MB). Peak memory consumption was 7.0MB. Max. memory is 8.0GB. * TraceAbstraction took 4230.36ms. Allocated memory was 71.3MB in the beginning and 209.7MB in the end (delta: 138.4MB). Free memory was 22.5MB in the beginning and 149.1MB in the end (delta: -126.6MB). Peak memory consumption was 133.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 709]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 713]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 716]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 720]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 688]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 688]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 691]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 691]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 696]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 696]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 699]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 699]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 269 locations, 21 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.1s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 256 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 256 mSDsluCounter, 103 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 61 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 695 IncrementalHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 61 mSolverCounterUnsat, 102 mSDtfsCounter, 695 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3388occurred in iteration=7, InterpolantAutomatonStates: 28, 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 541 NumberOfCodeBlocks, 541 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 533 ConstructedInterpolants, 0 QuantifiedInterpolants, 928 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 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 - AllSpecificationsHoldResult: All specifications hold 12 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-15 00:42:03,282 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...