/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 -i ../../../trunk/examples/svcomp/goblint-regression/13-privatized_69-refine-protected-loop-interval_true.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-14 21:51:03,596 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 21:51:03,680 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-14 21:51:03,703 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 21:51:03,703 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 21:51:03,703 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 21:51:03,704 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 21:51:03,704 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 21:51:03,704 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 21:51:03,704 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 21:51:03,704 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 21:51:03,704 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 21:51:03,704 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 21:51:03,704 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 21:51:03,704 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 21:51:03,705 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 21:51:03,705 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 21:51:03,705 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 21:51:03,705 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 21:51:03,705 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 21:51:03,705 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 21:51:03,705 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-14 21:51:03,705 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 21:51:03,705 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-14 21:51:03,705 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 21:51:03,705 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-14 21:51:03,705 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 21:51:03,706 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 21:51:03,706 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 21:51:03,706 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 21:51:03,706 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 21:51:03,706 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 21:51:03,706 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 [2025-03-14 21:51:03,914 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 21:51:03,920 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 21:51:03,922 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 21:51:03,922 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 21:51:03,923 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 21:51:03,923 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_69-refine-protected-loop-interval_true.i [2025-03-14 21:51:05,078 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2539c40b/c8e2983894f940228a3f1d1a781dc1eb/FLAG63f8ff187 [2025-03-14 21:51:05,295 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 21:51:05,296 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_69-refine-protected-loop-interval_true.i [2025-03-14 21:51:05,310 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2539c40b/c8e2983894f940228a3f1d1a781dc1eb/FLAG63f8ff187 [2025-03-14 21:51:05,637 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2539c40b/c8e2983894f940228a3f1d1a781dc1eb [2025-03-14 21:51:05,638 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 21:51:05,639 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-14 21:51:05,640 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 21:51:05,640 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 21:51:05,644 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 21:51:05,644 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 09:51:05" (1/1) ... [2025-03-14 21:51:05,645 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49add564 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:51:05, skipping insertion in model container [2025-03-14 21:51:05,645 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 09:51:05" (1/1) ... [2025-03-14 21:51:05,673 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 21:51:05,769 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_69-refine-protected-loop-interval_true.i[1107,1120] [2025-03-14 21:51:05,868 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 21:51:05,879 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 21:51:05,888 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_69-refine-protected-loop-interval_true.i[1107,1120] [2025-03-14 21:51:05,911 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 21:51:05,933 INFO L204 MainTranslator]: Completed translation [2025-03-14 21:51:05,934 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:51:05 WrapperNode [2025-03-14 21:51:05,934 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 21:51:05,935 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 21:51:05,935 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 21:51:05,935 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 21:51:05,939 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:51:05" (1/1) ... [2025-03-14 21:51:05,949 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:51:05" (1/1) ... [2025-03-14 21:51:05,964 INFO L138 Inliner]: procedures = 165, calls = 23, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 90 [2025-03-14 21:51:05,964 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 21:51:05,964 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 21:51:05,964 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 21:51:05,964 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 21:51:05,969 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:51:05" (1/1) ... [2025-03-14 21:51:05,969 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:51:05" (1/1) ... [2025-03-14 21:51:05,970 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:51:05" (1/1) ... [2025-03-14 21:51:05,970 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:51:05" (1/1) ... [2025-03-14 21:51:05,975 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:51:05" (1/1) ... [2025-03-14 21:51:05,975 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:51:05" (1/1) ... [2025-03-14 21:51:05,979 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:51:05" (1/1) ... [2025-03-14 21:51:05,980 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:51:05" (1/1) ... [2025-03-14 21:51:05,980 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:51:05" (1/1) ... [2025-03-14 21:51:05,981 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 21:51:05,982 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-14 21:51:05,982 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-14 21:51:05,982 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-14 21:51:05,983 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:51:05" (1/1) ... [2025-03-14 21:51:05,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-14 21:51:05,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 21:51:06,012 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-14 21:51:06,014 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-14 21:51:06,028 INFO L130 BoogieDeclarations]: Found specification of procedure worker [2025-03-14 21:51:06,029 INFO L138 BoogieDeclarations]: Found implementation of procedure worker [2025-03-14 21:51:06,029 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-14 21:51:06,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 21:51:06,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 21:51:06,029 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-14 21:51:06,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 21:51:06,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 21:51:06,030 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 21:51:06,108 INFO L234 CfgBuilder]: Building ICFG [2025-03-14 21:51:06,109 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 21:51:06,246 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 21:51:06,246 INFO L283 CfgBuilder]: Performing block encoding [2025-03-14 21:51:06,261 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 21:51:06,261 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-14 21:51:06,262 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.03 09:51:06 BoogieIcfgContainer [2025-03-14 21:51:06,262 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-14 21:51:06,264 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 21:51:06,264 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 21:51:06,267 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 21:51:06,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 09:51:05" (1/3) ... [2025-03-14 21:51:06,267 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a08dce4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 09:51:06, skipping insertion in model container [2025-03-14 21:51:06,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:51:05" (2/3) ... [2025-03-14 21:51:06,267 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a08dce4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 09:51:06, skipping insertion in model container [2025-03-14 21:51:06,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.03 09:51:06" (3/3) ... [2025-03-14 21:51:06,268 INFO L128 eAbstractionObserver]: Analyzing ICFG 13-privatized_69-refine-protected-loop-interval_true.i [2025-03-14 21:51:06,277 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 21:51:06,279 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG 13-privatized_69-refine-protected-loop-interval_true.i that has 2 procedures, 100 locations, 1 initial locations, 3 loop locations, and 2 error locations. [2025-03-14 21:51:06,279 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 21:51:06,326 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 21:51:06,353 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 21:51:06,364 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;@5d6eee90, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 21:51:06,364 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-03-14 21:51:06,399 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 21:51:06,399 INFO L124 PetriNetUnfolderBase]: 1/72 cut-off events. [2025-03-14 21:51:06,402 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 21:51:06,402 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:51:06,402 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] [2025-03-14 21:51:06,403 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-14 21:51:06,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:51:06,409 INFO L85 PathProgramCache]: Analyzing trace with hash 244147867, now seen corresponding path program 1 times [2025-03-14 21:51:06,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:51:06,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343255452] [2025-03-14 21:51:06,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:51:06,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:51:06,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:51:06,737 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-14 21:51:06,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:51:06,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343255452] [2025-03-14 21:51:06,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343255452] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:51:06,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:51:06,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 21:51:06,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157161097] [2025-03-14 21:51:06,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:51:06,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 21:51:06,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:51:06,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 21:51:06,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-14 21:51:06,767 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 106 [2025-03-14 21:51:06,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 106 transitions, 216 flow. Second operand has 5 states, 5 states have (on average 70.8) internal successors, (354), 5 states have internal predecessors, (354), 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-14 21:51:06,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:51:06,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 106 [2025-03-14 21:51:06,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:51:07,023 INFO L124 PetriNetUnfolderBase]: 222/682 cut-off events. [2025-03-14 21:51:07,023 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 21:51:07,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1085 conditions, 682 events. 222/682 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 3504 event pairs, 78 based on Foata normal form. 23/621 useless extension candidates. Maximal degree in co-relation 1047. Up to 262 conditions per place. [2025-03-14 21:51:07,035 INFO L140 encePairwiseOnDemand]: 91/106 looper letters, 60 selfloop transitions, 15 changer transitions 0/141 dead transitions. [2025-03-14 21:51:07,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 141 transitions, 435 flow [2025-03-14 21:51:07,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-14 21:51:07,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-14 21:51:07,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 637 transitions. [2025-03-14 21:51:07,045 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7511792452830188 [2025-03-14 21:51:07,047 INFO L298 CegarLoopForPetriNet]: 103 programPoint places, 1 predicate places. [2025-03-14 21:51:07,047 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 141 transitions, 435 flow [2025-03-14 21:51:07,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 70.8) internal successors, (354), 5 states have internal predecessors, (354), 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-14 21:51:07,049 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:51:07,049 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-14 21:51:07,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 21:51:07,049 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-14 21:51:07,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:51:07,050 INFO L85 PathProgramCache]: Analyzing trace with hash 2135310115, now seen corresponding path program 1 times [2025-03-14 21:51:07,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:51:07,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750458021] [2025-03-14 21:51:07,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:51:07,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:51:07,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:51:07,169 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-14 21:51:07,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:51:07,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750458021] [2025-03-14 21:51:07,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750458021] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:51:07,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:51:07,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 21:51:07,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49536881] [2025-03-14 21:51:07,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:51:07,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 21:51:07,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:51:07,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 21:51:07,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 21:51:07,171 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 106 [2025-03-14 21:51:07,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 141 transitions, 435 flow. Second operand has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 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-14 21:51:07,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:51:07,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 106 [2025-03-14 21:51:07,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:51:07,214 INFO L124 PetriNetUnfolderBase]: 10/140 cut-off events. [2025-03-14 21:51:07,214 INFO L125 PetriNetUnfolderBase]: For 43/61 co-relation queries the response was YES. [2025-03-14 21:51:07,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 140 events. 10/140 cut-off events. For 43/61 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 227 event pairs, 0 based on Foata normal form. 26/157 useless extension candidates. Maximal degree in co-relation 176. Up to 42 conditions per place. [2025-03-14 21:51:07,215 INFO L140 encePairwiseOnDemand]: 101/106 looper letters, 8 selfloop transitions, 6 changer transitions 8/110 dead transitions. [2025-03-14 21:51:07,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 110 transitions, 341 flow [2025-03-14 21:51:07,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 21:51:07,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 21:51:07,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 279 transitions. [2025-03-14 21:51:07,218 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8773584905660378 [2025-03-14 21:51:07,218 INFO L298 CegarLoopForPetriNet]: 103 programPoint places, 1 predicate places. [2025-03-14 21:51:07,219 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 110 transitions, 341 flow [2025-03-14 21:51:07,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 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-14 21:51:07,219 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:51:07,219 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] [2025-03-14 21:51:07,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 21:51:07,219 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-14 21:51:07,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:51:07,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1771755029, now seen corresponding path program 1 times [2025-03-14 21:51:07,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:51:07,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528113635] [2025-03-14 21:51:07,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:51:07,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:51:07,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:51:07,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 21:51:07,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:51:07,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528113635] [2025-03-14 21:51:07,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528113635] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:51:07,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:51:07,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 21:51:07,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050776359] [2025-03-14 21:51:07,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:51:07,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 21:51:07,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:51:07,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 21:51:07,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-14 21:51:07,331 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 106 [2025-03-14 21:51:07,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 110 transitions, 341 flow. Second operand has 5 states, 5 states have (on average 71.8) internal successors, (359), 5 states have internal predecessors, (359), 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-14 21:51:07,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:51:07,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 106 [2025-03-14 21:51:07,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:51:07,458 INFO L124 PetriNetUnfolderBase]: 17/239 cut-off events. [2025-03-14 21:51:07,458 INFO L125 PetriNetUnfolderBase]: For 45/88 co-relation queries the response was YES. [2025-03-14 21:51:07,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 450 conditions, 239 events. 17/239 cut-off events. For 45/88 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 537 event pairs, 0 based on Foata normal form. 5/228 useless extension candidates. Maximal degree in co-relation 399. Up to 71 conditions per place. [2025-03-14 21:51:07,459 INFO L140 encePairwiseOnDemand]: 95/106 looper letters, 39 selfloop transitions, 12 changer transitions 8/124 dead transitions. [2025-03-14 21:51:07,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 124 transitions, 523 flow [2025-03-14 21:51:07,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-14 21:51:07,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-14 21:51:07,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 531 transitions. [2025-03-14 21:51:07,461 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.715633423180593 [2025-03-14 21:51:07,462 INFO L298 CegarLoopForPetriNet]: 103 programPoint places, 5 predicate places. [2025-03-14 21:51:07,462 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 124 transitions, 523 flow [2025-03-14 21:51:07,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 71.8) internal successors, (359), 5 states have internal predecessors, (359), 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-14 21:51:07,462 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:51:07,462 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] [2025-03-14 21:51:07,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 21:51:07,463 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-14 21:51:07,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:51:07,463 INFO L85 PathProgramCache]: Analyzing trace with hash 755388182, now seen corresponding path program 1 times [2025-03-14 21:51:07,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:51:07,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138572089] [2025-03-14 21:51:07,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:51:07,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:51:07,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:51:07,543 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-14 21:51:07,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:51:07,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138572089] [2025-03-14 21:51:07,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138572089] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:51:07,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:51:07,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 21:51:07,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495586257] [2025-03-14 21:51:07,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:51:07,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 21:51:07,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:51:07,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 21:51:07,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-14 21:51:07,544 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 106 [2025-03-14 21:51:07,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 124 transitions, 523 flow. Second operand has 5 states, 5 states have (on average 81.4) internal successors, (407), 5 states have internal predecessors, (407), 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-14 21:51:07,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:51:07,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 106 [2025-03-14 21:51:07,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:51:07,660 INFO L124 PetriNetUnfolderBase]: 59/429 cut-off events. [2025-03-14 21:51:07,660 INFO L125 PetriNetUnfolderBase]: For 225/308 co-relation queries the response was YES. [2025-03-14 21:51:07,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 900 conditions, 429 events. 59/429 cut-off events. For 225/308 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1863 event pairs, 11 based on Foata normal form. 2/402 useless extension candidates. Maximal degree in co-relation 845. Up to 114 conditions per place. [2025-03-14 21:51:07,663 INFO L140 encePairwiseOnDemand]: 97/106 looper letters, 44 selfloop transitions, 12 changer transitions 8/137 dead transitions. [2025-03-14 21:51:07,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 137 transitions, 713 flow [2025-03-14 21:51:07,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-14 21:51:07,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-14 21:51:07,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 609 transitions. [2025-03-14 21:51:07,665 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8207547169811321 [2025-03-14 21:51:07,667 INFO L298 CegarLoopForPetriNet]: 103 programPoint places, 8 predicate places. [2025-03-14 21:51:07,667 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 137 transitions, 713 flow [2025-03-14 21:51:07,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 81.4) internal successors, (407), 5 states have internal predecessors, (407), 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-14 21:51:07,667 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:51:07,667 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 21:51:07,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 21:51:07,667 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-14 21:51:07,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:51:07,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1680234982, now seen corresponding path program 1 times [2025-03-14 21:51:07,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:51:07,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479619250] [2025-03-14 21:51:07,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:51:07,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:51:07,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:51:07,786 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 21:51:07,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:51:07,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479619250] [2025-03-14 21:51:07,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479619250] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 21:51:07,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860340036] [2025-03-14 21:51:07,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:51:07,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 21:51:07,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 21:51:07,790 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 21:51:07,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-14 21:51:07,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:51:07,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-14 21:51:07,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 21:51:07,963 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 21:51:07,963 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-14 21:51:07,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860340036] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:51:07,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-14 21:51:07,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 9 [2025-03-14 21:51:07,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496750606] [2025-03-14 21:51:07,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:51:07,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 21:51:07,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:51:07,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 21:51:07,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-14 21:51:07,965 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 106 [2025-03-14 21:51:07,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 137 transitions, 713 flow. Second operand has 7 states, 7 states have (on average 81.71428571428571) internal successors, (572), 7 states have internal predecessors, (572), 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-14 21:51:07,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:51:07,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 106 [2025-03-14 21:51:07,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:51:08,166 INFO L124 PetriNetUnfolderBase]: 87/568 cut-off events. [2025-03-14 21:51:08,166 INFO L125 PetriNetUnfolderBase]: For 430/596 co-relation queries the response was YES. [2025-03-14 21:51:08,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1447 conditions, 568 events. 87/568 cut-off events. For 430/596 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2621 event pairs, 13 based on Foata normal form. 8/543 useless extension candidates. Maximal degree in co-relation 1388. Up to 176 conditions per place. [2025-03-14 21:51:08,169 INFO L140 encePairwiseOnDemand]: 98/106 looper letters, 67 selfloop transitions, 23 changer transitions 8/171 dead transitions. [2025-03-14 21:51:08,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 171 transitions, 1155 flow [2025-03-14 21:51:08,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-14 21:51:08,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-14 21:51:08,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 955 transitions. [2025-03-14 21:51:08,173 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8190394511149228 [2025-03-14 21:51:08,174 INFO L298 CegarLoopForPetriNet]: 103 programPoint places, 18 predicate places. [2025-03-14 21:51:08,174 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 171 transitions, 1155 flow [2025-03-14 21:51:08,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 81.71428571428571) internal successors, (572), 7 states have internal predecessors, (572), 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-14 21:51:08,174 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:51:08,174 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 21:51:08,181 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-14 21:51:08,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 21:51:08,375 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-14 21:51:08,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:51:08,376 INFO L85 PathProgramCache]: Analyzing trace with hash -932113756, now seen corresponding path program 1 times [2025-03-14 21:51:08,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:51:08,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780478797] [2025-03-14 21:51:08,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:51:08,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:51:08,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:51:08,530 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 21:51:08,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:51:08,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780478797] [2025-03-14 21:51:08,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780478797] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:51:08,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:51:08,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-14 21:51:08,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742653120] [2025-03-14 21:51:08,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:51:08,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-14 21:51:08,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:51:08,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-14 21:51:08,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-14 21:51:08,532 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 106 [2025-03-14 21:51:08,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 171 transitions, 1155 flow. Second operand has 8 states, 8 states have (on average 69.75) internal successors, (558), 8 states have internal predecessors, (558), 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-14 21:51:08,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:51:08,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 106 [2025-03-14 21:51:08,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:51:08,732 INFO L124 PetriNetUnfolderBase]: 160/851 cut-off events. [2025-03-14 21:51:08,732 INFO L125 PetriNetUnfolderBase]: For 875/921 co-relation queries the response was YES. [2025-03-14 21:51:08,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2468 conditions, 851 events. 160/851 cut-off events. For 875/921 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 4550 event pairs, 34 based on Foata normal form. 2/792 useless extension candidates. Maximal degree in co-relation 2405. Up to 255 conditions per place. [2025-03-14 21:51:08,737 INFO L140 encePairwiseOnDemand]: 88/106 looper letters, 61 selfloop transitions, 37 changer transitions 22/193 dead transitions. [2025-03-14 21:51:08,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 193 transitions, 1559 flow [2025-03-14 21:51:08,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-14 21:51:08,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-14 21:51:08,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 859 transitions. [2025-03-14 21:51:08,739 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.675314465408805 [2025-03-14 21:51:08,739 INFO L298 CegarLoopForPetriNet]: 103 programPoint places, 29 predicate places. [2025-03-14 21:51:08,739 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 193 transitions, 1559 flow [2025-03-14 21:51:08,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 69.75) internal successors, (558), 8 states have internal predecessors, (558), 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-14 21:51:08,739 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:51:08,740 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 21:51:08,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 21:51:08,740 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-14 21:51:08,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:51:08,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1797910182, now seen corresponding path program 1 times [2025-03-14 21:51:08,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:51:08,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155064533] [2025-03-14 21:51:08,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:51:08,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:51:08,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:51:08,829 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 21:51:08,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:51:08,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155064533] [2025-03-14 21:51:08,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155064533] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:51:08,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:51:08,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-14 21:51:08,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329664514] [2025-03-14 21:51:08,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:51:08,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 21:51:08,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:51:08,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 21:51:08,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-14 21:51:08,831 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 106 [2025-03-14 21:51:08,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 193 transitions, 1559 flow. Second operand has 6 states, 6 states have (on average 81.0) internal successors, (486), 6 states have internal predecessors, (486), 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-14 21:51:08,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:51:08,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 106 [2025-03-14 21:51:08,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:51:09,000 INFO L124 PetriNetUnfolderBase]: 197/912 cut-off events. [2025-03-14 21:51:09,000 INFO L125 PetriNetUnfolderBase]: For 1385/1461 co-relation queries the response was YES. [2025-03-14 21:51:09,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3005 conditions, 912 events. 197/912 cut-off events. For 1385/1461 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4850 event pairs, 21 based on Foata normal form. 6/863 useless extension candidates. Maximal degree in co-relation 2938. Up to 252 conditions per place. [2025-03-14 21:51:09,003 INFO L140 encePairwiseOnDemand]: 96/106 looper letters, 0 selfloop transitions, 0 changer transitions 221/221 dead transitions. [2025-03-14 21:51:09,003 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 221 transitions, 2065 flow [2025-03-14 21:51:09,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-14 21:51:09,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-14 21:51:09,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 821 transitions. [2025-03-14 21:51:09,005 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7745283018867924 [2025-03-14 21:51:09,005 INFO L298 CegarLoopForPetriNet]: 103 programPoint places, 35 predicate places. [2025-03-14 21:51:09,005 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 221 transitions, 2065 flow [2025-03-14 21:51:09,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 81.0) internal successors, (486), 6 states have internal predecessors, (486), 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-14 21:51:09,011 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/13-privatized_69-refine-protected-loop-interval_true.i_petrified1_AllErrorsAtOnce [2025-03-14 21:51:09,032 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-03-14 21:51:09,033 INFO L782 garLoopResultBuilder]: Registering result SAFE for location workerErr1ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-03-14 21:51:09,033 INFO L782 garLoopResultBuilder]: Registering result SAFE for location workerErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2025-03-14 21:51:09,033 INFO L782 garLoopResultBuilder]: Registering result SAFE for location workerErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-03-14 21:51:09,033 INFO L782 garLoopResultBuilder]: Registering result SAFE for location workerErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-03-14 21:51:09,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 21:51:09,033 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-14 21:51:09,036 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-14 21:51:09,036 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-14 21:51:09,039 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.03 09:51:09 BasicIcfg [2025-03-14 21:51:09,039 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-14 21:51:09,040 INFO L158 Benchmark]: Toolchain (without parser) took 3400.43ms. Allocated memory was 71.3MB in the beginning and 109.1MB in the end (delta: 37.7MB). Free memory was 43.2MB in the beginning and 60.4MB in the end (delta: -17.2MB). Peak memory consumption was 70.1MB. Max. memory is 8.0GB. [2025-03-14 21:51:09,040 INFO L158 Benchmark]: CDTParser took 0.87ms. Allocated memory is still 71.3MB. Free memory is still 32.9MB. There was no memory consumed. Max. memory is 8.0GB. [2025-03-14 21:51:09,040 INFO L158 Benchmark]: CACSL2BoogieTranslator took 294.26ms. Allocated memory is still 71.3MB. Free memory was 43.0MB in the beginning and 23.1MB in the end (delta: 19.9MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-03-14 21:51:09,040 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.78ms. Allocated memory is still 71.3MB. Free memory was 23.1MB in the beginning and 21.3MB in the end (delta: 1.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-14 21:51:09,040 INFO L158 Benchmark]: Boogie Preprocessor took 17.15ms. Allocated memory is still 71.3MB. Free memory was 21.3MB in the beginning and 20.3MB in the end (delta: 997.7kB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-14 21:51:09,040 INFO L158 Benchmark]: RCFGBuilder took 279.81ms. Allocated memory is still 71.3MB. Free memory was 20.3MB in the beginning and 32.6MB in the end (delta: -12.3MB). Peak memory consumption was 7.0MB. Max. memory is 8.0GB. [2025-03-14 21:51:09,041 INFO L158 Benchmark]: TraceAbstraction took 2775.80ms. Allocated memory was 71.3MB in the beginning and 109.1MB in the end (delta: 37.7MB). Free memory was 31.4MB in the beginning and 60.4MB in the end (delta: -29.0MB). Peak memory consumption was 59.0MB. Max. memory is 8.0GB. [2025-03-14 21:51:09,042 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.87ms. Allocated memory is still 71.3MB. Free memory is still 32.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 294.26ms. Allocated memory is still 71.3MB. Free memory was 43.0MB in the beginning and 23.1MB in the end (delta: 19.9MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.78ms. Allocated memory is still 71.3MB. Free memory was 23.1MB in the beginning and 21.3MB in the end (delta: 1.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 17.15ms. Allocated memory is still 71.3MB. Free memory was 21.3MB in the beginning and 20.3MB in the end (delta: 997.7kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 279.81ms. Allocated memory is still 71.3MB. Free memory was 20.3MB in the beginning and 32.6MB in the end (delta: -12.3MB). Peak memory consumption was 7.0MB. Max. memory is 8.0GB. * TraceAbstraction took 2775.80ms. Allocated memory was 71.3MB in the beginning and 109.1MB in the end (delta: 37.7MB). Free memory was 31.4MB in the beginning and 60.4MB in the end (delta: -29.0MB). Peak memory consumption was 59.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 143 locations, 5 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.7s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 252 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 252 mSDsluCounter, 301 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 188 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 636 IncrementalHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 113 mSDtfsCounter, 636 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 140 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2065occurred in iteration=7, InterpolantAutomatonStates: 58, 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.9s InterpolantComputationTime, 521 NumberOfCodeBlocks, 521 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 513 ConstructedInterpolants, 0 QuantifiedInterpolants, 999 SizeOfPredicates, 4 NumberOfNonLiveVariables, 166 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 8 InterpolantComputations, 7 PerfectInterpolantSequences, 20/28 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 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-14 21:51:09,056 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...