/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 /storage/cav23-termute-examples/1_thr/aaron2_1.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:24:02,934 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:24:02,985 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:24:02,991 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:24:02,991 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:24:03,009 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:24:03,009 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:24:03,009 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:24:03,010 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:24:03,010 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:24:03,010 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:24:03,010 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:24:03,010 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:24:03,010 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:24:03,010 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:24:03,010 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:24:03,010 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:24:03,010 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:24:03,010 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:24:03,010 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:24:03,010 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:24:03,010 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:24:03,010 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:24:03,011 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:24:03,011 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:24:03,011 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:24:03,011 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:24:03,011 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:24:03,011 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:24:03,011 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:24:03,011 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:24:03,011 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:24:03,011 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:24:03,011 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:24:03,011 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:24:03,011 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:24:03,011 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:24:03,202 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:24:03,207 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:24:03,210 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:24:03,211 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:24:03,211 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:24:03,212 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/1_thr/aaron2_1.c.bpl [2025-04-26 16:24:03,212 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/1_thr/aaron2_1.c.bpl' [2025-04-26 16:24:03,224 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:24:03,225 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:24:03,226 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:24:03,226 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:24:03,226 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:24:03,233 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "aaron2_1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:03" (1/1) ... [2025-04-26 16:24:03,254 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "aaron2_1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:03" (1/1) ... [2025-04-26 16:24:03,257 INFO L138 Inliner]: procedures = 2, calls = 1, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:24:03,258 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:24:03,259 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:24:03,259 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:24:03,259 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:24:03,263 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "aaron2_1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:03" (1/1) ... [2025-04-26 16:24:03,263 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "aaron2_1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:03" (1/1) ... [2025-04-26 16:24:03,264 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "aaron2_1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:03" (1/1) ... [2025-04-26 16:24:03,264 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "aaron2_1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:03" (1/1) ... [2025-04-26 16:24:03,265 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "aaron2_1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:03" (1/1) ... [2025-04-26 16:24:03,265 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "aaron2_1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:03" (1/1) ... [2025-04-26 16:24:03,267 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "aaron2_1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:03" (1/1) ... [2025-04-26 16:24:03,268 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "aaron2_1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:03" (1/1) ... [2025-04-26 16:24:03,268 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "aaron2_1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:03" (1/1) ... [2025-04-26 16:24:03,277 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:24:03,278 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:24:03,278 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:24:03,278 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:24:03,283 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "aaron2_1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:03" (1/1) ... [2025-04-26 16:24:03,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:03,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:03,308 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:24:03,313 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:24:03,327 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:24:03,327 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:24:03,327 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:24:03,327 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:24:03,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:24:03,327 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:24:03,328 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:24:03,361 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:24:03,363 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:24:03,413 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:24:03,413 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:24:03,420 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:24:03,421 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:24:03,422 INFO L201 PluginConnector]: Adding new model aaron2_1.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:24:03 BoogieIcfgContainer [2025-04-26 16:24:03,422 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:24:03,423 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:24:03,423 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:24:03,429 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:24:03,429 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:24:03,429 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "aaron2_1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:03" (1/2) ... [2025-04-26 16:24:03,430 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4e520321 and model type aaron2_1.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:24:03, skipping insertion in model container [2025-04-26 16:24:03,431 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:24:03,431 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "aaron2_1.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:24:03" (2/2) ... [2025-04-26 16:24:03,432 INFO L376 chiAutomizerObserver]: Analyzing ICFG aaron2_1.c.bpl [2025-04-26 16:24:03,465 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-04-26 16:24:03,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 12 places, 11 transitions, 29 flow [2025-04-26 16:24:03,515 INFO L116 PetriNetUnfolderBase]: 2/9 cut-off events. [2025-04-26 16:24:03,517 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-26 16:24:03,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14 conditions, 9 events. 2/9 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 4 event pairs, 0 based on Foata normal form. 0/7 useless extension candidates. Maximal degree in co-relation 6. Up to 3 conditions per place. [2025-04-26 16:24:03,520 INFO L82 GeneralOperation]: Start removeDead. Operand has 12 places, 11 transitions, 29 flow [2025-04-26 16:24:03,526 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 11 places, 9 transitions, 24 flow [2025-04-26 16:24:03,527 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 11 places, 9 transitions, 24 flow [2025-04-26 16:24:03,536 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:24:03,536 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:24:03,536 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:24:03,536 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:24:03,536 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:24:03,536 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:24:03,536 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:24:03,537 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:24:03,538 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:24:03,556 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-04-26 16:24:03,556 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:03,556 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:03,562 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:24:03,562 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:24:03,562 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:24:03,562 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 7 states, but on-demand construction may add more states [2025-04-26 16:24:03,562 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-04-26 16:24:03,562 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:03,563 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:03,563 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:24:03,563 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:24:03,568 INFO L752 eck$LassoCheckResult]: Stem: "[34] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[26] $Ultimate##0-->L20-2: Formula: (<= 0 v_tx_1) InVars {tx=v_tx_1} OutVars{tx=v_tx_1} AuxVars[] AssignedVars[]" [2025-04-26 16:24:03,569 INFO L754 eck$LassoCheckResult]: Loop: "[28] L20-2-->L20: Formula: (<= v_y1_1 v_x_1) InVars {y1=v_y1_1, x=v_x_1} OutVars{y1=v_y1_1, x=v_x_1} AuxVars[] AssignedVars[]" "[30] L20-->L20-2: Formula: (= v_x_3 (+ v_tx_2 v_x_2 1)) InVars {tx=v_tx_2, x=v_x_3} OutVars{tx=v_tx_2, x=v_x_2} AuxVars[] AssignedVars[x]" [2025-04-26 16:24:03,573 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:03,574 INFO L85 PathProgramCache]: Analyzing trace with hash 2041, now seen corresponding path program 1 times [2025-04-26 16:24:03,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:03,579 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428531108] [2025-04-26 16:24:03,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:03,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:03,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:03,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:03,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:03,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:03,627 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:03,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:03,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:03,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:03,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:03,639 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:03,645 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:03,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1859, now seen corresponding path program 1 times [2025-04-26 16:24:03,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:03,646 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476810912] [2025-04-26 16:24:03,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:03,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:03,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:03,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:03,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:03,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:03,653 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:03,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:03,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:03,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:03,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:03,656 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:03,657 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:03,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1962299, now seen corresponding path program 1 times [2025-04-26 16:24:03,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:03,658 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71363053] [2025-04-26 16:24:03,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:03,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:03,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:24:03,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:24:03,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:03,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:03,663 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:03,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:24:03,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:24:03,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:03,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:03,668 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:03,757 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:03,759 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:03,759 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:03,759 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:03,760 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:24:03,760 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:03,760 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:03,760 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:03,761 INFO L132 ssoRankerPreferences]: Filename of dumped script: aaron2_1.c.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:24:03,761 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:03,761 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:03,773 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:03,792 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:03,841 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:03,843 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:24:03,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:03,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:03,847 INFO L229 MonitoredProcess]: Starting monitored process 2 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:24:03,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-04-26 16:24:03,849 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:03,850 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:03,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:03,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:03,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:03,876 INFO L229 MonitoredProcess]: Starting monitored process 3 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:24:03,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 16:24:03,880 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:24:03,880 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:04,007 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:24:04,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 16:24:04,013 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:04,013 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:04,013 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:04,014 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:04,014 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:24:04,014 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:04,014 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:04,014 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:04,014 INFO L132 ssoRankerPreferences]: Filename of dumped script: aaron2_1.c.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:24:04,014 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:04,014 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:04,015 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:04,024 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:04,061 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:04,063 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:24:04,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:04,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:04,066 INFO L229 MonitoredProcess]: Starting monitored process 4 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:24:04,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 16:24:04,069 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:24:04,080 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:04,081 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:04,081 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:04,081 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:04,087 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:24:04,088 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:24:04,096 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:24:04,108 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:24:04,108 INFO L437 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 2 variables to zero. [2025-04-26 16:24:04,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:04,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:04,112 INFO L229 MonitoredProcess]: Starting monitored process 5 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:24:04,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 16:24:04,114 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:24:04,134 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 16:24:04,134 INFO L439 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-04-26 16:24:04,135 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:24:04,135 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x, y1) = 2*x - 2*y1 + 1 Supporting invariants [1*tx >= 0] [2025-04-26 16:24:04,142 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:04,150 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:24:04,184 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:04,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:04,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:04,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:04,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:04,193 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-26 16:24:04,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:04,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:04,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:04,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:04,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:04,202 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:24:04,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:04,231 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:24:04,295 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:24:04,298 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 7 states, but on-demand construction may add more states Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 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:24:04,405 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 7 states, but on-demand construction may add more states. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 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) Result 14 states and 18 transitions. Complement of second has 6 states. [2025-04-26 16:24:04,409 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:24:04,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 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:24:04,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2025-04-26 16:24:04,432 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 16:24:04,432 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:04,432 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:24:04,432 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:04,433 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 2 letters. Loop has 4 letters. [2025-04-26 16:24:04,433 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:04,433 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 18 transitions. [2025-04-26 16:24:04,434 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:24:04,435 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 0 states and 0 transitions. [2025-04-26 16:24:04,436 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:24:04,436 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:24:04,436 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:24:04,436 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:24:04,437 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:24:04,437 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:24:04,437 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:24:04,437 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:24:04,437 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:24:04,437 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:24:04,437 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:24:04,447 INFO L201 PluginConnector]: Adding new model aaron2_1.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:24:04 BoogieIcfgContainer [2025-04-26 16:24:04,447 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:24:04,448 INFO L158 Benchmark]: Toolchain (without parser) took 1222.14ms. Allocated memory was 155.2MB in the beginning and 310.4MB in the end (delta: 155.2MB). Free memory was 82.6MB in the beginning and 267.2MB in the end (delta: -184.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:24:04,448 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.20ms. Allocated memory is still 155.2MB. Free memory is still 83.5MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:24:04,448 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.88ms. Allocated memory is still 155.2MB. Free memory was 82.6MB in the beginning and 80.8MB in the end (delta: 1.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:24:04,448 INFO L158 Benchmark]: Boogie Preprocessor took 18.70ms. Allocated memory is still 155.2MB. Free memory was 80.8MB in the beginning and 79.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:24:04,456 INFO L158 Benchmark]: RCFGBuilder took 143.96ms. Allocated memory is still 155.2MB. Free memory was 79.8MB in the beginning and 71.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:24:04,456 INFO L158 Benchmark]: BuchiAutomizer took 1023.56ms. Allocated memory was 155.2MB in the beginning and 310.4MB in the end (delta: 155.2MB). Free memory was 71.2MB in the beginning and 267.2MB in the end (delta: -196.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:24:04,462 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.20ms. Allocated memory is still 155.2MB. Free memory is still 83.5MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.88ms. Allocated memory is still 155.2MB. Free memory was 82.6MB in the beginning and 80.8MB in the end (delta: 1.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 18.70ms. Allocated memory is still 155.2MB. Free memory was 80.8MB in the beginning and 79.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 143.96ms. Allocated memory is still 155.2MB. Free memory was 79.8MB in the beginning and 71.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 1023.56ms. Allocated memory was 155.2MB in the beginning and 310.4MB in the end (delta: 155.2MB). Free memory was 71.2MB in the beginning and 267.2MB in the end (delta: -196.0MB). 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.9s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 0.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. 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 [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8 mSDsluCounter, 7 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11 IncrementalHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 3 mSDtfsCounter, 11 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital17 mio100 ax100 hnf100 lsp76 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq153 hnf94 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 71ms VariablesStem: 1 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s InitialAbstractionConstructionTime: 0.0s InitialAbstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 1 terminating modules (0 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 2 * x + 1 + -2 * y1 and consists of 4 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:24:04,479 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...