/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 -s ../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/regression/single_assertion_test.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:20:41,721 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:20:41,779 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf [2025-04-26 16:20:41,783 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:20:41,784 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:20:41,805 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:20:41,805 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:20:41,805 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:20:41,806 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:20:41,806 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:20:41,806 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:20:41,806 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:20:41,806 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:20:41,806 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:20:41,806 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:20:41,806 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:20:41,806 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:20:41,807 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:20:41,808 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:20:41,808 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:20:41,808 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:20:41,808 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:20:41,809 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:20:41,809 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:20:41,809 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:20:41,809 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:20:41,809 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:20:41,809 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:20:41,809 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:20:41,809 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:20:41,809 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:20:41,809 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:20:41,809 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:20:41,809 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:20:41,810 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:20:41,810 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:20:41,810 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:20:42,047 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:20:42,056 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:20:42,058 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:20:42,059 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:20:42,059 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:20:42,061 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/regression/single_assertion_test.bpl [2025-04-26 16:20:42,061 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/regression/single_assertion_test.bpl' [2025-04-26 16:20:42,075 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:20:42,077 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:20:42,077 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:20:42,077 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:20:42,077 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:20:42,084 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "single_assertion_test.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:42" (1/1) ... [2025-04-26 16:20:42,102 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "single_assertion_test.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:42" (1/1) ... [2025-04-26 16:20:42,106 INFO L138 Inliner]: procedures = 2, calls = 1, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:20:42,107 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:20:42,108 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:20:42,108 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:20:42,108 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:20:42,113 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "single_assertion_test.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:42" (1/1) ... [2025-04-26 16:20:42,114 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "single_assertion_test.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:42" (1/1) ... [2025-04-26 16:20:42,114 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "single_assertion_test.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:42" (1/1) ... [2025-04-26 16:20:42,114 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "single_assertion_test.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:42" (1/1) ... [2025-04-26 16:20:42,119 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "single_assertion_test.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:42" (1/1) ... [2025-04-26 16:20:42,119 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "single_assertion_test.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:42" (1/1) ... [2025-04-26 16:20:42,122 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "single_assertion_test.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:42" (1/1) ... [2025-04-26 16:20:42,123 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "single_assertion_test.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:42" (1/1) ... [2025-04-26 16:20:42,123 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "single_assertion_test.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:42" (1/1) ... [2025-04-26 16:20:42,131 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:20:42,131 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:20:42,133 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:20:42,133 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:20:42,134 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "single_assertion_test.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:42" (1/1) ... [2025-04-26 16:20:42,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:42,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:42,158 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:42,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-04-26 16:20:42,180 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:20:42,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:20:42,180 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:20:42,180 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread given in one single declaration [2025-04-26 16:20:42,180 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-04-26 16:20:42,180 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-04-26 16:20:42,181 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 16:20:42,214 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:20:42,215 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:20:42,280 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:20:42,280 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:20:42,290 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:20:42,290 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:20:42,291 INFO L201 PluginConnector]: Adding new model single_assertion_test.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:20:42 BoogieIcfgContainer [2025-04-26 16:20:42,291 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:20:42,292 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:20:42,292 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:20:42,297 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:20:42,297 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:20:42,297 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "single_assertion_test.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:42" (1/2) ... [2025-04-26 16:20:42,298 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6d12174c and model type single_assertion_test.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:20:42, skipping insertion in model container [2025-04-26 16:20:42,298 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:20:42,298 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "single_assertion_test.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:20:42" (2/2) ... [2025-04-26 16:20:42,300 INFO L376 chiAutomizerObserver]: Analyzing ICFG single_assertion_test.bpl [2025-04-26 16:20:42,333 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 16:20:42,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 19 places, 17 transitions, 44 flow [2025-04-26 16:20:42,378 INFO L116 PetriNetUnfolderBase]: 1/15 cut-off events. [2025-04-26 16:20:42,379 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-26 16:20:42,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20 conditions, 15 events. 1/15 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 15 event pairs, 0 based on Foata normal form. 0/12 useless extension candidates. Maximal degree in co-relation 5. Up to 2 conditions per place. [2025-04-26 16:20:42,381 INFO L82 GeneralOperation]: Start removeDead. Operand has 19 places, 17 transitions, 44 flow [2025-04-26 16:20:42,385 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 15 places, 13 transitions, 33 flow [2025-04-26 16:20:42,386 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 15 places, 13 transitions, 33 flow [2025-04-26 16:20:42,395 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:20:42,395 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:20:42,395 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:20:42,395 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:20:42,396 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:20:42,396 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:20:42,396 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:20:42,396 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:20:42,397 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:20:42,422 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 5 [2025-04-26 16:20:42,423 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:20:42,423 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:20:42,426 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2025-04-26 16:20:42,426 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:20:42,426 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:20:42,426 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 30 states, but on-demand construction may add more states [2025-04-26 16:20:42,429 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 5 [2025-04-26 16:20:42,430 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:20:42,430 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:20:42,430 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2025-04-26 16:20:42,430 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:20:42,434 INFO L752 eck$LassoCheckResult]: Stem: "[31] $Ultimate##0-->L21: Formula: (= v_x_1 0) InVars {} OutVars{x=v_x_1} AuxVars[] AssignedVars[x]" "[26] L21-->L22-1: Formula: (= 0 v_ULTIMATE.start_i_1) InVars {} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_1} AuxVars[] AssignedVars[ULTIMATE.start_i]" "[20] L22-1-->L24: Formula: (< v_ULTIMATE.start_i_2 2) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_2} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_2} AuxVars[] AssignedVars[]" "[40] L24-->$Ultimate##0: Formula: (and (= v_threadThread1of1ForFork0_i_6 v_ULTIMATE.start_i_8) (= v_threadThread1of1ForFork0_thidvar0_2 v_ULTIMATE.start_i_8)) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_8} OutVars{threadThread1of1ForFork0_i=v_threadThread1of1ForFork0_i_6, ULTIMATE.start_i=v_ULTIMATE.start_i_8, threadThread1of1ForFork0_thidvar0=v_threadThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[threadThread1of1ForFork0_i, threadThread1of1ForFork0_thidvar0]" "[25] L24-1-->L22-1: Formula: (= (+ 1 v_ULTIMATE.start_i_4) v_ULTIMATE.start_i_3) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_4} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_3} AuxVars[] AssignedVars[ULTIMATE.start_i]" "[20] L22-1-->L24: Formula: (< v_ULTIMATE.start_i_2 2) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_2} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_2} AuxVars[] AssignedVars[]" "[38] L24-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 16:20:42,435 INFO L754 eck$LassoCheckResult]: Loop: "[39] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 16:20:42,438 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:42,439 INFO L85 PathProgramCache]: Analyzing trace with hash -45301957, now seen corresponding path program 1 times [2025-04-26 16:20:42,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:42,444 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319364552] [2025-04-26 16:20:42,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:42,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:42,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:20:42,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:20:42,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:42,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:42,503 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:42,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:20:42,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:20:42,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:42,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:42,521 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:42,524 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:42,524 INFO L85 PathProgramCache]: Analyzing trace with hash 70, now seen corresponding path program 1 times [2025-04-26 16:20:42,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:42,524 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537390191] [2025-04-26 16:20:42,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:42,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:42,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:20:42,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:20:42,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:42,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:42,527 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:42,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:20:42,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:20:42,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:42,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:42,533 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:42,534 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:42,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1404360628, now seen corresponding path program 1 times [2025-04-26 16:20:42,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:42,537 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756407832] [2025-04-26 16:20:42,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:42,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:42,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:20:42,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:20:42,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:42,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:42,545 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:42,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:20:42,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:20:42,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:42,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:42,550 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:42,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:20:42,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:20:42,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:42,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:42,673 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:42,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:20:42,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:20:42,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:42,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:42,686 WARN L166 chiAutomizerObserver]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-26 16:20:42,699 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-26 16:20:42,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 24 transitions, 70 flow [2025-04-26 16:20:42,710 INFO L116 PetriNetUnfolderBase]: 2/30 cut-off events. [2025-04-26 16:20:42,710 INFO L117 PetriNetUnfolderBase]: For 7/8 co-relation queries the response was YES. [2025-04-26 16:20:42,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 30 events. 2/30 cut-off events. For 7/8 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 47 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 18. Up to 4 conditions per place. [2025-04-26 16:20:42,710 INFO L82 GeneralOperation]: Start removeDead. Operand has 26 places, 24 transitions, 70 flow [2025-04-26 16:20:42,711 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 26 places, 24 transitions, 70 flow [2025-04-26 16:20:42,711 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 26 places, 24 transitions, 70 flow [2025-04-26 16:20:42,711 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:20:42,711 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:20:42,711 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:20:42,711 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:20:42,711 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:20:42,711 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:20:42,711 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:20:42,712 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:20:42,712 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:20:42,750 INFO L131 ngComponentsAnalysis]: Automaton has 25 accepting balls. 25 [2025-04-26 16:20:42,751 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:20:42,751 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:20:42,753 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1] [2025-04-26 16:20:42,753 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:20:42,753 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:20:42,753 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 164 states, but on-demand construction may add more states [2025-04-26 16:20:42,762 INFO L131 ngComponentsAnalysis]: Automaton has 25 accepting balls. 25 [2025-04-26 16:20:42,762 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:20:42,762 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:20:42,762 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1] [2025-04-26 16:20:42,762 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:20:42,763 INFO L752 eck$LassoCheckResult]: Stem: "[55] $Ultimate##0-->L21: Formula: (= v_x_1 0) InVars {} OutVars{x=v_x_1} AuxVars[] AssignedVars[x]" "[50] L21-->L22-1: Formula: (= 0 v_ULTIMATE.start_i_1) InVars {} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_1} AuxVars[] AssignedVars[ULTIMATE.start_i]" "[44] L22-1-->L24: Formula: (< v_ULTIMATE.start_i_2 2) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_2} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_2} AuxVars[] AssignedVars[]" "[68] L24-->$Ultimate##0: Formula: (and (= v_threadThread1of2ForFork0_i_6 v_ULTIMATE.start_i_13) (= v_threadThread1of2ForFork0_thidvar0_2 v_ULTIMATE.start_i_13)) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_13} OutVars{threadThread1of2ForFork0_thidvar0=v_threadThread1of2ForFork0_thidvar0_2, ULTIMATE.start_i=v_ULTIMATE.start_i_13, threadThread1of2ForFork0_i=v_threadThread1of2ForFork0_i_6} AuxVars[] AssignedVars[threadThread1of2ForFork0_thidvar0, threadThread1of2ForFork0_i]" "[49] L24-1-->L22-1: Formula: (= (+ 1 v_ULTIMATE.start_i_4) v_ULTIMATE.start_i_3) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_4} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_3} AuxVars[] AssignedVars[ULTIMATE.start_i]" "[44] L22-1-->L24: Formula: (< v_ULTIMATE.start_i_2 2) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_2} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_2} AuxVars[] AssignedVars[]" "[69] L24-->$Ultimate##0: Formula: (and (= v_threadThread2of2ForFork0_thidvar0_2 v_ULTIMATE.start_i_16) (= v_threadThread2of2ForFork0_i_6 v_ULTIMATE.start_i_16)) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_16} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_16, threadThread2of2ForFork0_thidvar0=v_threadThread2of2ForFork0_thidvar0_2, threadThread2of2ForFork0_i=v_threadThread2of2ForFork0_i_6} AuxVars[] AssignedVars[threadThread2of2ForFork0_thidvar0, threadThread2of2ForFork0_i]" "[49] L24-1-->L22-1: Formula: (= (+ 1 v_ULTIMATE.start_i_4) v_ULTIMATE.start_i_3) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_4} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_3} AuxVars[] AssignedVars[ULTIMATE.start_i]" "[44] L22-1-->L24: Formula: (< v_ULTIMATE.start_i_2 2) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_2} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_2} AuxVars[] AssignedVars[]" "[66] L24-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 16:20:42,763 INFO L754 eck$LassoCheckResult]: Loop: "[67] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 16:20:42,763 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:42,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1141816817, now seen corresponding path program 1 times [2025-04-26 16:20:42,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:42,764 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169777851] [2025-04-26 16:20:42,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:42,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:42,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:20:42,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:20:42,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:42,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:20:42,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:20:42,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:20:42,850 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169777851] [2025-04-26 16:20:42,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169777851] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:20:42,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:20:42,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-26 16:20:42,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159011102] [2025-04-26 16:20:42,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:20:42,858 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:20:42,859 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:42,859 INFO L85 PathProgramCache]: Analyzing trace with hash 98, now seen corresponding path program 1 times [2025-04-26 16:20:42,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:42,860 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428317698] [2025-04-26 16:20:42,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:42,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:42,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:20:42,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:20:42,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:42,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:42,864 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:42,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:20:42,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:20:42,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:42,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:42,865 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:42,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:20:42,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 16:20:42,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-26 16:20:42,892 INFO L87 Difference]: Start difference. First operand currently 164 states, but on-demand construction may add more states Second operand has 5 states, 5 states have (on average 2.0) internal successors, (in total 10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:20:42,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:20:42,952 INFO L93 Difference]: Finished difference Result 115 states and 235 transitions. [2025-04-26 16:20:42,952 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 115 states and 235 transitions. [2025-04-26 16:20:42,956 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:20:42,971 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 115 states to 0 states and 0 transitions. [2025-04-26 16:20:42,972 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:20:42,972 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:20:42,972 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:20:42,972 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:20:42,972 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:20:42,972 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:20:42,975 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-26 16:20:42,977 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:20:42,977 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:20:42,977 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:20:42,977 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:20:42,977 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:20:42,980 INFO L201 PluginConnector]: Adding new model single_assertion_test.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:20:42 BoogieIcfgContainer [2025-04-26 16:20:42,980 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:20:42,981 INFO L158 Benchmark]: Toolchain (without parser) took 904.31ms. Allocated memory is still 155.2MB. Free memory was 84.8MB in the beginning and 118.3MB in the end (delta: -33.4MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:20:42,982 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.18ms. Allocated memory is still 155.2MB. Free memory is still 85.6MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:20:42,982 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.42ms. Allocated memory is still 155.2MB. Free memory was 84.8MB in the beginning and 83.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:20:42,982 INFO L158 Benchmark]: Boogie Preprocessor took 22.98ms. Allocated memory is still 155.2MB. Free memory was 83.0MB in the beginning and 81.9MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:20:42,982 INFO L158 Benchmark]: RCFGBuilder took 159.48ms. Allocated memory is still 155.2MB. Free memory was 81.9MB in the beginning and 73.3MB in the end (delta: 8.6MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:20:42,983 INFO L158 Benchmark]: BuchiAutomizer took 687.82ms. Allocated memory is still 155.2MB. Free memory was 73.1MB in the beginning and 118.3MB in the end (delta: -45.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:20:42,984 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.18ms. Allocated memory is still 155.2MB. Free memory is still 85.6MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 30.42ms. Allocated memory is still 155.2MB. Free memory was 84.8MB in the beginning and 83.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 22.98ms. Allocated memory is still 155.2MB. Free memory was 83.0MB in the beginning and 81.9MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 159.48ms. Allocated memory is still 155.2MB. Free memory was 81.9MB in the beginning and 73.3MB in the end (delta: 8.6MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 687.82ms. Allocated memory is still 155.2MB. Free memory was 73.1MB in the beginning and 118.3MB in the end (delta: -45.1MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 0.3s and 1 iterations. TraceHistogramMax:2. Analysis of lassos took 0.2s. Construction of modules took 0.0s. Büchi inclusion checks took 0.0s. Highest rank in rank-based complementation 0. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s InitialAbstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 0.2s and 2 iterations. TraceHistogramMax:3. Analysis of lassos took 0.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.0s. Highest rank in rank-based complementation 0. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 47 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 47 mSDsluCounter, 38 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 19 IncrementalHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 25 mSDtfsCounter, 19 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN1 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s InitialAbstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 1 terminating modules (1 trivial, 0 deterministic, 0 nondeterministic). 1 modules have a trivial ranking function, the largest among these consists of 5 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:20:42,996 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...