/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.positions.where.we.compute.the.hoare.annotation All --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true --cacsl2boogietranslator.check.unreachability.of.reach_error.function false -i ../../../trunk/examples/svcomp/pthread-atomic/time_var_mutex.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 00:04:28,008 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 00:04:28,085 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:04:28,110 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 00:04:28,111 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 00:04:28,111 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 00:04:28,112 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 00:04:28,112 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 00:04:28,112 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 00:04:28,112 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 00:04:28,112 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 00:04:28,113 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 00:04:28,113 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 00:04:28,113 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 00:04:28,113 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 00:04:28,113 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 00:04:28,113 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 00:04:28,113 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 00:04:28,113 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 00:04:28,113 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 00:04:28,113 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 00:04:28,114 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 00:04:28,114 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 00:04:28,114 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 00:04:28,114 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 00:04:28,114 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 00:04:28,114 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 00:04:28,114 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 00:04:28,114 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 00:04:28,114 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 00:04:28,115 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 00:04:28,115 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 00:04:28,115 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:04:28,343 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 00:04:28,351 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 00:04:28,353 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 00:04:28,354 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 00:04:28,355 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 00:04:28,356 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-atomic/time_var_mutex.i [2025-03-15 00:04:29,538 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a8646fed/210a7067478643c08393c0ab91e35cfe/FLAGbe36f5d07 [2025-03-15 00:04:29,777 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 00:04:29,778 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/time_var_mutex.i [2025-03-15 00:04:29,794 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a8646fed/210a7067478643c08393c0ab91e35cfe/FLAGbe36f5d07 [2025-03-15 00:04:29,811 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a8646fed/210a7067478643c08393c0ab91e35cfe [2025-03-15 00:04:29,814 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 00:04:29,815 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 00:04:29,816 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 00:04:29,816 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 00:04:29,820 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 00:04:29,821 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 12:04:29" (1/1) ... [2025-03-15 00:04:29,821 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1285e2a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:04:29, skipping insertion in model container [2025-03-15 00:04:29,822 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 12:04:29" (1/1) ... [2025-03-15 00:04:29,850 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 00:04:30,049 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 00:04:30,066 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 00:04:30,098 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 00:04:30,133 INFO L204 MainTranslator]: Completed translation [2025-03-15 00:04:30,134 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:04:30 WrapperNode [2025-03-15 00:04:30,135 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 00:04:30,136 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 00:04:30,136 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 00:04:30,136 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 00:04:30,141 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:04:30" (1/1) ... [2025-03-15 00:04:30,152 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:04:30" (1/1) ... [2025-03-15 00:04:30,171 INFO L138 Inliner]: procedures = 169, calls = 29, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 119 [2025-03-15 00:04:30,171 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 00:04:30,173 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 00:04:30,173 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 00:04:30,174 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 00:04:30,179 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:04:30" (1/1) ... [2025-03-15 00:04:30,179 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:04:30" (1/1) ... [2025-03-15 00:04:30,181 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:04:30" (1/1) ... [2025-03-15 00:04:30,181 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:04:30" (1/1) ... [2025-03-15 00:04:30,193 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:04:30" (1/1) ... [2025-03-15 00:04:30,194 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:04:30" (1/1) ... [2025-03-15 00:04:30,200 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:04:30" (1/1) ... [2025-03-15 00:04:30,201 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:04:30" (1/1) ... [2025-03-15 00:04:30,201 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:04:30" (1/1) ... [2025-03-15 00:04:30,206 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 00:04:30,207 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 00:04:30,207 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 00:04:30,207 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 00:04:30,207 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:04:30" (1/1) ... [2025-03-15 00:04:30,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 00:04:30,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:04:30,253 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:04:30,256 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:04:30,275 INFO L130 BoogieDeclarations]: Found specification of procedure allocator [2025-03-15 00:04:30,276 INFO L138 BoogieDeclarations]: Found implementation of procedure allocator [2025-03-15 00:04:30,276 INFO L130 BoogieDeclarations]: Found specification of procedure de_allocator [2025-03-15 00:04:30,276 INFO L138 BoogieDeclarations]: Found implementation of procedure de_allocator [2025-03-15 00:04:30,276 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-15 00:04:30,277 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 00:04:30,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 00:04:30,277 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-15 00:04:30,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 00:04:30,277 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 00:04:30,278 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:04:30,390 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 00:04:30,393 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 00:04:30,576 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 00:04:30,576 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 00:04:30,605 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 00:04:30,605 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-15 00:04:30,605 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 12:04:30 BoogieIcfgContainer [2025-03-15 00:04:30,605 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 00:04:30,608 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 00:04:30,608 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 00:04:30,612 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 00:04:30,612 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 12:04:29" (1/3) ... [2025-03-15 00:04:30,612 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2095c915 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 12:04:30, skipping insertion in model container [2025-03-15 00:04:30,612 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:04:30" (2/3) ... [2025-03-15 00:04:30,613 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2095c915 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 12:04:30, skipping insertion in model container [2025-03-15 00:04:30,613 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 12:04:30" (3/3) ... [2025-03-15 00:04:30,615 INFO L128 eAbstractionObserver]: Analyzing ICFG time_var_mutex.i [2025-03-15 00:04:30,626 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 00:04:30,628 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG time_var_mutex.i that has 3 procedures, 131 locations, 1 initial locations, 0 loop locations, and 10 error locations. [2025-03-15 00:04:30,629 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 00:04:30,697 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-15 00:04:30,734 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 00:04:30,746 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;@59a76e75, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 00:04:30,746 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2025-03-15 00:04:30,772 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 00:04:30,772 INFO L124 PetriNetUnfolderBase]: 0/28 cut-off events. [2025-03-15 00:04:30,775 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 00:04:30,775 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:04:30,777 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] [2025-03-15 00:04:30,777 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [allocatorErr0ASSERT_VIOLATIONDATA_RACE, allocatorErr3ASSERT_VIOLATIONDATA_RACE, allocatorErr1ASSERT_VIOLATIONDATA_RACE, allocatorErr4ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2025-03-15 00:04:30,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:04:30,782 INFO L85 PathProgramCache]: Analyzing trace with hash -2134265730, now seen corresponding path program 1 times [2025-03-15 00:04:30,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:04:30,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14668808] [2025-03-15 00:04:30,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:04:30,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:04:30,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:04:30,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:04:30,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:04:30,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14668808] [2025-03-15 00:04:30,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14668808] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:04:30,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:04:30,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:04:30,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918652106] [2025-03-15 00:04:30,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:04:30,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:04:30,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:04:30,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:04:30,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:04:30,989 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 137 [2025-03-15 00:04:30,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 137 transitions, 288 flow. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:04:30,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:04:30,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 137 [2025-03-15 00:04:30,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:04:31,131 INFO L124 PetriNetUnfolderBase]: 35/353 cut-off events. [2025-03-15 00:04:31,132 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2025-03-15 00:04:31,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 477 conditions, 353 events. 35/353 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1602 event pairs, 20 based on Foata normal form. 34/340 useless extension candidates. Maximal degree in co-relation 383. Up to 54 conditions per place. [2025-03-15 00:04:31,139 INFO L140 encePairwiseOnDemand]: 128/137 looper letters, 19 selfloop transitions, 2 changer transitions 7/130 dead transitions. [2025-03-15 00:04:31,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 130 transitions, 327 flow [2025-03-15 00:04:31,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:04:31,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:04:31,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 367 transitions. [2025-03-15 00:04:31,153 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8929440389294404 [2025-03-15 00:04:31,156 INFO L298 CegarLoopForPetriNet]: 137 programPoint places, -6 predicate places. [2025-03-15 00:04:31,156 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 130 transitions, 327 flow [2025-03-15 00:04:31,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:04:31,156 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:04:31,157 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] [2025-03-15 00:04:31,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 00:04:31,157 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [allocatorErr0ASSERT_VIOLATIONDATA_RACE, allocatorErr3ASSERT_VIOLATIONDATA_RACE, allocatorErr1ASSERT_VIOLATIONDATA_RACE, allocatorErr4ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2025-03-15 00:04:31,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:04:31,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1965011323, now seen corresponding path program 1 times [2025-03-15 00:04:31,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:04:31,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119428135] [2025-03-15 00:04:31,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:04:31,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:04:31,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:04:31,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:04:31,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:04:31,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119428135] [2025-03-15 00:04:31,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119428135] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:04:31,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:04:31,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:04:31,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942467786] [2025-03-15 00:04:31,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:04:31,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:04:31,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:04:31,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:04:31,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:04:31,258 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 137 [2025-03-15 00:04:31,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 130 transitions, 327 flow. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:04:31,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:04:31,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 137 [2025-03-15 00:04:31,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:04:31,380 INFO L124 PetriNetUnfolderBase]: 91/705 cut-off events. [2025-03-15 00:04:31,380 INFO L125 PetriNetUnfolderBase]: For 194/207 co-relation queries the response was YES. [2025-03-15 00:04:31,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1074 conditions, 705 events. 91/705 cut-off events. For 194/207 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 4315 event pairs, 30 based on Foata normal form. 3/588 useless extension candidates. Maximal degree in co-relation 877. Up to 100 conditions per place. [2025-03-15 00:04:31,389 INFO L140 encePairwiseOnDemand]: 131/137 looper letters, 29 selfloop transitions, 4 changer transitions 8/141 dead transitions. [2025-03-15 00:04:31,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 141 transitions, 446 flow [2025-03-15 00:04:31,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:04:31,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:04:31,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 364 transitions. [2025-03-15 00:04:31,393 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8856447688564477 [2025-03-15 00:04:31,394 INFO L298 CegarLoopForPetriNet]: 137 programPoint places, -5 predicate places. [2025-03-15 00:04:31,394 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 141 transitions, 446 flow [2025-03-15 00:04:31,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:04:31,394 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:04:31,397 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] [2025-03-15 00:04:31,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-15 00:04:31,397 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting allocatorErr3ASSERT_VIOLATIONDATA_RACE === [allocatorErr0ASSERT_VIOLATIONDATA_RACE, allocatorErr3ASSERT_VIOLATIONDATA_RACE, allocatorErr1ASSERT_VIOLATIONDATA_RACE, allocatorErr4ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2025-03-15 00:04:31,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:04:31,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1745680844, now seen corresponding path program 1 times [2025-03-15 00:04:31,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:04:31,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751942520] [2025-03-15 00:04:31,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:04:31,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:04:31,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:04:31,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:04:31,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:04:31,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751942520] [2025-03-15 00:04:31,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751942520] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:04:31,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:04:31,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 00:04:31,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216810969] [2025-03-15 00:04:31,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:04:31,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:04:31,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:04:31,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:04:31,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:04:31,512 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 137 [2025-03-15 00:04:31,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 141 transitions, 446 flow. Second operand has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:04:31,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:04:31,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 137 [2025-03-15 00:04:31,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:04:31,598 INFO L124 PetriNetUnfolderBase]: 87/571 cut-off events. [2025-03-15 00:04:31,598 INFO L125 PetriNetUnfolderBase]: For 362/377 co-relation queries the response was YES. [2025-03-15 00:04:31,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1028 conditions, 571 events. 87/571 cut-off events. For 362/377 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 3067 event pairs, 24 based on Foata normal form. 4/487 useless extension candidates. Maximal degree in co-relation 869. Up to 83 conditions per place. [2025-03-15 00:04:31,603 INFO L140 encePairwiseOnDemand]: 134/137 looper letters, 25 selfloop transitions, 2 changer transitions 7/141 dead transitions. [2025-03-15 00:04:31,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 141 transitions, 505 flow [2025-03-15 00:04:31,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:04:31,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:04:31,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 363 transitions. [2025-03-15 00:04:31,605 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8832116788321168 [2025-03-15 00:04:31,606 INFO L298 CegarLoopForPetriNet]: 137 programPoint places, -3 predicate places. [2025-03-15 00:04:31,606 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 141 transitions, 505 flow [2025-03-15 00:04:31,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:04:31,606 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:04:31,606 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:04:31,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-15 00:04:31,606 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting allocatorErr1ASSERT_VIOLATIONDATA_RACE === [allocatorErr0ASSERT_VIOLATIONDATA_RACE, allocatorErr3ASSERT_VIOLATIONDATA_RACE, allocatorErr1ASSERT_VIOLATIONDATA_RACE, allocatorErr4ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2025-03-15 00:04:31,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:04:31,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1644969517, now seen corresponding path program 1 times [2025-03-15 00:04:31,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:04:31,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773089372] [2025-03-15 00:04:31,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:04:31,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:04:31,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:04:31,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:04:31,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:04:31,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773089372] [2025-03-15 00:04:31,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773089372] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:04:31,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:04:31,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:04:31,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280060471] [2025-03-15 00:04:31,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:04:31,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:04:31,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:04:31,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:04:31,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:04:31,676 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 137 [2025-03-15 00:04:31,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 141 transitions, 505 flow. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:04:31,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:04:31,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 137 [2025-03-15 00:04:31,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:04:31,787 INFO L124 PetriNetUnfolderBase]: 99/647 cut-off events. [2025-03-15 00:04:31,787 INFO L125 PetriNetUnfolderBase]: For 645/682 co-relation queries the response was YES. [2025-03-15 00:04:31,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1311 conditions, 647 events. 99/647 cut-off events. For 645/682 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3753 event pairs, 27 based on Foata normal form. 6/562 useless extension candidates. Maximal degree in co-relation 1130. Up to 153 conditions per place. [2025-03-15 00:04:31,792 INFO L140 encePairwiseOnDemand]: 132/137 looper letters, 42 selfloop transitions, 4 changer transitions 7/150 dead transitions. [2025-03-15 00:04:31,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 150 transitions, 654 flow [2025-03-15 00:04:31,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:04:31,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:04:31,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 356 transitions. [2025-03-15 00:04:31,793 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8661800486618005 [2025-03-15 00:04:31,793 INFO L298 CegarLoopForPetriNet]: 137 programPoint places, -1 predicate places. [2025-03-15 00:04:31,794 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 150 transitions, 654 flow [2025-03-15 00:04:31,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:04:31,794 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:04:31,794 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] [2025-03-15 00:04:31,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-15 00:04:31,794 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting de_allocatorErr1ASSERT_VIOLATIONDATA_RACE === [allocatorErr0ASSERT_VIOLATIONDATA_RACE, allocatorErr3ASSERT_VIOLATIONDATA_RACE, allocatorErr1ASSERT_VIOLATIONDATA_RACE, allocatorErr4ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2025-03-15 00:04:31,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:04:31,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1775715117, now seen corresponding path program 1 times [2025-03-15 00:04:31,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:04:31,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39298135] [2025-03-15 00:04:31,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:04:31,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:04:31,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:04:31,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:04:31,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:04:31,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39298135] [2025-03-15 00:04:31,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39298135] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:04:31,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:04:31,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:04:31,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169285224] [2025-03-15 00:04:31,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:04:31,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:04:31,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:04:31,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:04:31,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:04:31,850 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 137 [2025-03-15 00:04:31,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 150 transitions, 654 flow. Second operand has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:04:31,850 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:04:31,850 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 137 [2025-03-15 00:04:31,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:04:32,039 INFO L124 PetriNetUnfolderBase]: 324/1123 cut-off events. [2025-03-15 00:04:32,040 INFO L125 PetriNetUnfolderBase]: For 2734/2889 co-relation queries the response was YES. [2025-03-15 00:04:32,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2874 conditions, 1123 events. 324/1123 cut-off events. For 2734/2889 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 7338 event pairs, 124 based on Foata normal form. 26/966 useless extension candidates. Maximal degree in co-relation 2528. Up to 511 conditions per place. [2025-03-15 00:04:32,048 INFO L140 encePairwiseOnDemand]: 131/137 looper letters, 52 selfloop transitions, 5 changer transitions 7/166 dead transitions. [2025-03-15 00:04:32,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 166 transitions, 874 flow [2025-03-15 00:04:32,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:04:32,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:04:32,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 356 transitions. [2025-03-15 00:04:32,050 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8661800486618005 [2025-03-15 00:04:32,052 INFO L298 CegarLoopForPetriNet]: 137 programPoint places, 1 predicate places. [2025-03-15 00:04:32,052 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 166 transitions, 874 flow [2025-03-15 00:04:32,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:04:32,052 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:04:32,053 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] [2025-03-15 00:04:32,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-15 00:04:32,053 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting de_allocatorErr2ASSERT_VIOLATIONDATA_RACE === [allocatorErr0ASSERT_VIOLATIONDATA_RACE, allocatorErr3ASSERT_VIOLATIONDATA_RACE, allocatorErr1ASSERT_VIOLATIONDATA_RACE, allocatorErr4ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2025-03-15 00:04:32,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:04:32,053 INFO L85 PathProgramCache]: Analyzing trace with hash 783549393, now seen corresponding path program 1 times [2025-03-15 00:04:32,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:04:32,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596638793] [2025-03-15 00:04:32,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:04:32,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:04:32,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:04:32,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:04:32,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:04:32,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596638793] [2025-03-15 00:04:32,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596638793] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:04:32,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:04:32,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:04:32,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432148797] [2025-03-15 00:04:32,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:04:32,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:04:32,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:04:32,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:04:32,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:04:32,114 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 137 [2025-03-15 00:04:32,115 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 166 transitions, 874 flow. Second operand has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:04:32,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:04:32,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 137 [2025-03-15 00:04:32,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:04:32,274 INFO L124 PetriNetUnfolderBase]: 328/1283 cut-off events. [2025-03-15 00:04:32,274 INFO L125 PetriNetUnfolderBase]: For 4189/4424 co-relation queries the response was YES. [2025-03-15 00:04:32,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3820 conditions, 1283 events. 328/1283 cut-off events. For 4189/4424 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 9196 event pairs, 80 based on Foata normal form. 21/1146 useless extension candidates. Maximal degree in co-relation 3450. Up to 534 conditions per place. [2025-03-15 00:04:32,281 INFO L140 encePairwiseOnDemand]: 129/137 looper letters, 62 selfloop transitions, 6 changer transitions 27/200 dead transitions. [2025-03-15 00:04:32,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 200 transitions, 1381 flow [2025-03-15 00:04:32,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:04:32,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:04:32,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 366 transitions. [2025-03-15 00:04:32,285 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8905109489051095 [2025-03-15 00:04:32,286 INFO L298 CegarLoopForPetriNet]: 137 programPoint places, 3 predicate places. [2025-03-15 00:04:32,286 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 200 transitions, 1381 flow [2025-03-15 00:04:32,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:04:32,287 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:04:32,287 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] [2025-03-15 00:04:32,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-15 00:04:32,287 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting allocatorErr2ASSERT_VIOLATIONDATA_RACE === [allocatorErr0ASSERT_VIOLATIONDATA_RACE, allocatorErr3ASSERT_VIOLATIONDATA_RACE, allocatorErr1ASSERT_VIOLATIONDATA_RACE, allocatorErr4ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2025-03-15 00:04:32,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:04:32,288 INFO L85 PathProgramCache]: Analyzing trace with hash -2498024, now seen corresponding path program 1 times [2025-03-15 00:04:32,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:04:32,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513180816] [2025-03-15 00:04:32,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:04:32,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:04:32,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:04:32,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:04:32,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:04:32,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513180816] [2025-03-15 00:04:32,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513180816] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:04:32,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:04:32,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:04:32,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555540611] [2025-03-15 00:04:32,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:04:32,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:04:32,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:04:32,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:04:32,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:04:32,344 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 137 [2025-03-15 00:04:32,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 200 transitions, 1381 flow. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:04:32,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:04:32,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 137 [2025-03-15 00:04:32,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:04:32,491 INFO L124 PetriNetUnfolderBase]: 334/1279 cut-off events. [2025-03-15 00:04:32,492 INFO L125 PetriNetUnfolderBase]: For 6319/6655 co-relation queries the response was YES. [2025-03-15 00:04:32,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4160 conditions, 1279 events. 334/1279 cut-off events. For 6319/6655 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 9128 event pairs, 80 based on Foata normal form. 24/1155 useless extension candidates. Maximal degree in co-relation 3745. Up to 540 conditions per place. [2025-03-15 00:04:32,498 INFO L140 encePairwiseOnDemand]: 134/137 looper letters, 57 selfloop transitions, 2 changer transitions 27/205 dead transitions. [2025-03-15 00:04:32,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 205 transitions, 1610 flow [2025-03-15 00:04:32,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:04:32,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:04:32,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 349 transitions. [2025-03-15 00:04:32,500 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8491484184914841 [2025-03-15 00:04:32,501 INFO L298 CegarLoopForPetriNet]: 137 programPoint places, 4 predicate places. [2025-03-15 00:04:32,501 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 205 transitions, 1610 flow [2025-03-15 00:04:32,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:04:32,501 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:04:32,501 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] [2025-03-15 00:04:32,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-15 00:04:32,501 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting de_allocatorErr0ASSERT_VIOLATIONDATA_RACE === [allocatorErr0ASSERT_VIOLATIONDATA_RACE, allocatorErr3ASSERT_VIOLATIONDATA_RACE, allocatorErr1ASSERT_VIOLATIONDATA_RACE, allocatorErr4ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2025-03-15 00:04:32,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:04:32,504 INFO L85 PathProgramCache]: Analyzing trace with hash -416142667, now seen corresponding path program 1 times [2025-03-15 00:04:32,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:04:32,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026860768] [2025-03-15 00:04:32,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:04:32,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:04:32,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:04:32,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:04:32,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:04:32,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026860768] [2025-03-15 00:04:32,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026860768] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:04:32,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:04:32,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-15 00:04:32,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878698611] [2025-03-15 00:04:32,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:04:32,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:04:32,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:04:32,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:04:32,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:04:32,775 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 137 [2025-03-15 00:04:32,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 205 transitions, 1610 flow. Second operand has 6 states, 6 states have (on average 109.16666666666667) internal successors, (655), 6 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:04:32,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:04:32,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 137 [2025-03-15 00:04:32,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:04:32,917 INFO L124 PetriNetUnfolderBase]: 161/729 cut-off events. [2025-03-15 00:04:32,917 INFO L125 PetriNetUnfolderBase]: For 4739/4871 co-relation queries the response was YES. [2025-03-15 00:04:32,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2481 conditions, 729 events. 161/729 cut-off events. For 4739/4871 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 4260 event pairs, 38 based on Foata normal form. 22/678 useless extension candidates. Maximal degree in co-relation 2106. Up to 295 conditions per place. [2025-03-15 00:04:32,920 INFO L140 encePairwiseOnDemand]: 131/137 looper letters, 29 selfloop transitions, 20 changer transitions 27/179 dead transitions. [2025-03-15 00:04:32,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 179 transitions, 1425 flow [2025-03-15 00:04:32,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 00:04:32,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 00:04:32,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 560 transitions. [2025-03-15 00:04:32,922 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8175182481751825 [2025-03-15 00:04:32,923 INFO L298 CegarLoopForPetriNet]: 137 programPoint places, 6 predicate places. [2025-03-15 00:04:32,924 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 179 transitions, 1425 flow [2025-03-15 00:04:32,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 109.16666666666667) internal successors, (655), 6 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:04:32,924 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:04:32,924 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] [2025-03-15 00:04:32,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-15 00:04:32,924 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting allocatorErr3ASSERT_VIOLATIONDATA_RACE === [allocatorErr0ASSERT_VIOLATIONDATA_RACE, allocatorErr3ASSERT_VIOLATIONDATA_RACE, allocatorErr1ASSERT_VIOLATIONDATA_RACE, allocatorErr4ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2025-03-15 00:04:32,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:04:32,925 INFO L85 PathProgramCache]: Analyzing trace with hash -425205315, now seen corresponding path program 1 times [2025-03-15 00:04:32,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:04:32,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118087222] [2025-03-15 00:04:32,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:04:32,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:04:32,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:04:32,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:04:32,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:04:32,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118087222] [2025-03-15 00:04:32,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118087222] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:04:32,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:04:32,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:04:32,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085687027] [2025-03-15 00:04:32,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:04:32,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:04:32,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:04:32,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:04:32,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:04:32,967 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 137 [2025-03-15 00:04:32,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 179 transitions, 1425 flow. Second operand has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:04:32,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:04:32,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 137 [2025-03-15 00:04:32,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:04:33,091 INFO L124 PetriNetUnfolderBase]: 179/767 cut-off events. [2025-03-15 00:04:33,091 INFO L125 PetriNetUnfolderBase]: For 5588/5709 co-relation queries the response was YES. [2025-03-15 00:04:33,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2941 conditions, 767 events. 179/767 cut-off events. For 5588/5709 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 4535 event pairs, 38 based on Foata normal form. 0/704 useless extension candidates. Maximal degree in co-relation 2532. Up to 302 conditions per place. [2025-03-15 00:04:33,095 INFO L140 encePairwiseOnDemand]: 131/137 looper letters, 45 selfloop transitions, 7 changer transitions 53/195 dead transitions. [2025-03-15 00:04:33,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 195 transitions, 1764 flow [2025-03-15 00:04:33,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:04:33,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:04:33,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 354 transitions. [2025-03-15 00:04:33,097 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8613138686131386 [2025-03-15 00:04:33,097 INFO L298 CegarLoopForPetriNet]: 137 programPoint places, 8 predicate places. [2025-03-15 00:04:33,098 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 195 transitions, 1764 flow [2025-03-15 00:04:33,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:04:33,098 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:04:33,098 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] [2025-03-15 00:04:33,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-15 00:04:33,098 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting de_allocatorErr1ASSERT_VIOLATIONDATA_RACE === [allocatorErr0ASSERT_VIOLATIONDATA_RACE, allocatorErr3ASSERT_VIOLATIONDATA_RACE, allocatorErr1ASSERT_VIOLATIONDATA_RACE, allocatorErr4ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2025-03-15 00:04:33,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:04:33,099 INFO L85 PathProgramCache]: Analyzing trace with hash 431884089, now seen corresponding path program 1 times [2025-03-15 00:04:33,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:04:33,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903048651] [2025-03-15 00:04:33,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:04:33,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:04:33,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:04:33,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:04:33,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:04:33,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903048651] [2025-03-15 00:04:33,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903048651] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:04:33,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:04:33,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 00:04:33,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145872626] [2025-03-15 00:04:33,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:04:33,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:04:33,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:04:33,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:04:33,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:04:33,174 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 137 [2025-03-15 00:04:33,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 195 transitions, 1764 flow. Second operand has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:04:33,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:04:33,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 137 [2025-03-15 00:04:33,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:04:33,239 INFO L124 PetriNetUnfolderBase]: 78/431 cut-off events. [2025-03-15 00:04:33,240 INFO L125 PetriNetUnfolderBase]: For 4911/5039 co-relation queries the response was YES. [2025-03-15 00:04:33,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1893 conditions, 431 events. 78/431 cut-off events. For 4911/5039 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2122 event pairs, 15 based on Foata normal form. 0/409 useless extension candidates. Maximal degree in co-relation 1652. Up to 148 conditions per place. [2025-03-15 00:04:33,244 INFO L140 encePairwiseOnDemand]: 135/137 looper letters, 0 selfloop transitions, 0 changer transitions 154/154 dead transitions. [2025-03-15 00:04:33,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 154 transitions, 1452 flow [2025-03-15 00:04:33,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:04:33,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:04:33,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 365 transitions. [2025-03-15 00:04:33,245 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8880778588807786 [2025-03-15 00:04:33,246 INFO L298 CegarLoopForPetriNet]: 137 programPoint places, 6 predicate places. [2025-03-15 00:04:33,246 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 154 transitions, 1452 flow [2025-03-15 00:04:33,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:04:33,250 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/time_var_mutex.i_petrified1_AllErrorsAtOnce [2025-03-15 00:04:33,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location allocatorErr0ASSERT_VIOLATIONDATA_RACE (19 of 20 remaining) [2025-03-15 00:04:33,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location allocatorErr3ASSERT_VIOLATIONDATA_RACE (18 of 20 remaining) [2025-03-15 00:04:33,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location allocatorErr1ASSERT_VIOLATIONDATA_RACE (17 of 20 remaining) [2025-03-15 00:04:33,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location allocatorErr4ASSERT_VIOLATIONDATA_RACE (16 of 20 remaining) [2025-03-15 00:04:33,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location allocatorErr2ASSERT_VIOLATIONDATA_RACE (15 of 20 remaining) [2025-03-15 00:04:33,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location de_allocatorErr0ASSERT_VIOLATIONDATA_RACE (14 of 20 remaining) [2025-03-15 00:04:33,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location de_allocatorErr1ASSERT_VIOLATIONDATA_RACE (13 of 20 remaining) [2025-03-15 00:04:33,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location de_allocatorErr2ASSERT_VIOLATIONDATA_RACE (12 of 20 remaining) [2025-03-15 00:04:33,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (11 of 20 remaining) [2025-03-15 00:04:33,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 20 remaining) [2025-03-15 00:04:33,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 20 remaining) [2025-03-15 00:04:33,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 20 remaining) [2025-03-15 00:04:33,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location allocatorErr0ASSERT_VIOLATIONDATA_RACE (7 of 20 remaining) [2025-03-15 00:04:33,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location allocatorErr3ASSERT_VIOLATIONDATA_RACE (6 of 20 remaining) [2025-03-15 00:04:33,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location allocatorErr1ASSERT_VIOLATIONDATA_RACE (5 of 20 remaining) [2025-03-15 00:04:33,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location allocatorErr4ASSERT_VIOLATIONDATA_RACE (4 of 20 remaining) [2025-03-15 00:04:33,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location allocatorErr2ASSERT_VIOLATIONDATA_RACE (3 of 20 remaining) [2025-03-15 00:04:33,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location de_allocatorErr0ASSERT_VIOLATIONDATA_RACE (2 of 20 remaining) [2025-03-15 00:04:33,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location de_allocatorErr1ASSERT_VIOLATIONDATA_RACE (1 of 20 remaining) [2025-03-15 00:04:33,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location de_allocatorErr2ASSERT_VIOLATIONDATA_RACE (0 of 20 remaining) [2025-03-15 00:04:33,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-15 00:04:33,267 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:04:33,270 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-15 00:04:33,270 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-15 00:04:33,274 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 12:04:33 BasicIcfg [2025-03-15 00:04:33,274 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-15 00:04:33,274 INFO L158 Benchmark]: Toolchain (without parser) took 3459.70ms. Allocated memory was 71.3MB in the beginning and 146.8MB in the end (delta: 75.5MB). Free memory was 43.7MB in the beginning and 37.0MB in the end (delta: 6.6MB). Peak memory consumption was 78.5MB. Max. memory is 8.0GB. [2025-03-15 00:04:33,274 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 71.3MB. Free memory is still 33.4MB. There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 00:04:33,275 INFO L158 Benchmark]: CACSL2BoogieTranslator took 319.68ms. Allocated memory is still 71.3MB. Free memory was 43.5MB in the beginning and 23.5MB in the end (delta: 20.0MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-03-15 00:04:33,275 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.59ms. Allocated memory is still 71.3MB. Free memory was 23.5MB 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:04:33,275 INFO L158 Benchmark]: Boogie Preprocessor took 32.51ms. Allocated memory is still 71.3MB. Free memory was 21.6MB in the beginning and 20.4MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 00:04:33,275 INFO L158 Benchmark]: RCFGBuilder took 398.84ms. Allocated memory is still 71.3MB. Free memory was 20.4MB in the beginning and 30.8MB in the end (delta: -10.4MB). Peak memory consumption was 7.0MB. Max. memory is 8.0GB. [2025-03-15 00:04:33,275 INFO L158 Benchmark]: TraceAbstraction took 2665.60ms. Allocated memory was 71.3MB in the beginning and 146.8MB in the end (delta: 75.5MB). Free memory was 29.9MB in the beginning and 37.0MB in the end (delta: -7.2MB). Peak memory consumption was 67.3MB. Max. memory is 8.0GB. [2025-03-15 00:04:33,276 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 is still 33.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 319.68ms. Allocated memory is still 71.3MB. Free memory was 43.5MB in the beginning and 23.5MB in the end (delta: 20.0MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.59ms. Allocated memory is still 71.3MB. Free memory was 23.5MB 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 32.51ms. Allocated memory is still 71.3MB. Free memory was 21.6MB in the beginning and 20.4MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 398.84ms. Allocated memory is still 71.3MB. Free memory was 20.4MB in the beginning and 30.8MB in the end (delta: -10.4MB). Peak memory consumption was 7.0MB. Max. memory is 8.0GB. * TraceAbstraction took 2665.60ms. Allocated memory was 71.3MB in the beginning and 146.8MB in the end (delta: 75.5MB). Free memory was 29.9MB in the beginning and 37.0MB in the end (delta: -7.2MB). Peak memory consumption was 67.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 695]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 701]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 697]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 702]: 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: 708]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 709]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 710]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 717]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 717]: 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 5 procedures, 203 locations, 20 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: 2.5s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 108 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 108 mSDsluCounter, 79 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 351 IncrementalHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 78 mSDtfsCounter, 351 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1764occurred in iteration=9, InterpolantAutomatonStates: 32, 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, 565 NumberOfCodeBlocks, 565 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 555 ConstructedInterpolants, 0 QuantifiedInterpolants, 858 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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 10 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-15 00:04:33,288 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...