/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/weaver-benchmarks/generated/chl/array-int-symm.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:22:07,131 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:22:07,191 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:22:07,195 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:22:07,195 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:22:07,211 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:22:07,212 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:22:07,212 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:22:07,212 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:22:07,212 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:22:07,212 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:22:07,212 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:22:07,212 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:22:07,212 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:22:07,212 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:22:07,213 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:22:07,213 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:22:07,214 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:22:07,214 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:22:07,214 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:22:07,214 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:22:07,214 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:22:07,215 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:22:07,215 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:22:07,215 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:22:07,215 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:22:07,215 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:22:07,215 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:22:07,215 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:22:07,215 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:22:07,215 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:22:07,215 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:22:07,215 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:22:07,215 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:22:07,215 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:22:07,216 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:22:07,216 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:22:07,426 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:22:07,433 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:22:07,435 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:22:07,436 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:22:07,436 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:22:07,437 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/array-int-symm.wvr.bpl [2025-04-26 16:22:07,438 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/array-int-symm.wvr.bpl' [2025-04-26 16:22:07,459 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:22:07,460 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:22:07,460 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:22:07,460 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:22:07,460 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:22:07,468 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array-int-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:07" (1/1) ... [2025-04-26 16:22:07,489 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array-int-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:07" (1/1) ... [2025-04-26 16:22:07,495 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:22:07,496 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:22:07,497 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:22:07,497 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:22:07,497 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:22:07,501 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array-int-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:07" (1/1) ... [2025-04-26 16:22:07,501 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array-int-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:07" (1/1) ... [2025-04-26 16:22:07,502 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array-int-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:07" (1/1) ... [2025-04-26 16:22:07,502 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array-int-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:07" (1/1) ... [2025-04-26 16:22:07,504 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "array-int-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:07" (1/1) ... [2025-04-26 16:22:07,506 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array-int-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:07" (1/1) ... [2025-04-26 16:22:07,508 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array-int-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:07" (1/1) ... [2025-04-26 16:22:07,508 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "array-int-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:07" (1/1) ... [2025-04-26 16:22:07,508 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array-int-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:07" (1/1) ... [2025-04-26 16:22:07,514 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:22:07,515 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:22:07,515 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:22:07,515 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:22:07,515 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array-int-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:07" (1/1) ... [2025-04-26 16:22:07,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:07,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:07,534 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:22:07,537 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:22:07,557 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:22:07,557 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:22:07,557 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:22:07,557 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:22:07,557 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:22:07,557 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:22:07,557 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:22:07,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:22:07,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:22:07,558 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:22:07,592 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:22:07,593 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:22:07,666 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:22:07,666 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:22:07,692 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:22:07,693 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-04-26 16:22:07,693 INFO L201 PluginConnector]: Adding new model array-int-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:22:07 BoogieIcfgContainer [2025-04-26 16:22:07,693 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:22:07,694 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:22:07,694 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:22:07,698 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:22:07,699 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:22:07,699 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "array-int-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:07" (1/2) ... [2025-04-26 16:22:07,700 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@41cd4fb6 and model type array-int-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:22:07, skipping insertion in model container [2025-04-26 16:22:07,700 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:22:07,700 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "array-int-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:22:07" (2/2) ... [2025-04-26 16:22:07,701 INFO L376 chiAutomizerObserver]: Analyzing ICFG array-int-symm.wvr.bpl [2025-04-26 16:22:07,732 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 16:22:07,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 20 transitions, 54 flow [2025-04-26 16:22:07,778 INFO L116 PetriNetUnfolderBase]: 2/16 cut-off events. [2025-04-26 16:22:07,779 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 16:22:07,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25 conditions, 16 events. 2/16 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 10 event pairs, 0 based on Foata normal form. 0/13 useless extension candidates. Maximal degree in co-relation 11. Up to 2 conditions per place. [2025-04-26 16:22:07,783 INFO L82 GeneralOperation]: Start removeDead. Operand has 23 places, 20 transitions, 54 flow [2025-04-26 16:22:07,785 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 21 places, 16 transitions, 44 flow [2025-04-26 16:22:07,785 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 21 places, 16 transitions, 44 flow [2025-04-26 16:22:07,796 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:22:07,796 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:22:07,796 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:22:07,796 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:22:07,797 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:22:07,797 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:22:07,797 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:22:07,797 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:22:07,798 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:22:07,818 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 9 [2025-04-26 16:22:07,818 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:07,819 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:07,821 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:22:07,821 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:22:07,821 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:22:07,821 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 29 states, but on-demand construction may add more states [2025-04-26 16:22:07,823 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 9 [2025-04-26 16:22:07,823 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:07,823 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:07,823 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:22:07,823 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:22:07,827 INFO L752 eck$LassoCheckResult]: Stem: "[70] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[60] $Ultimate##0-->L29: Formula: (and (= v_i_4_18 0) (not v_break_5_15) (= v_len_1_11 (+ v_result_6_19 v_len_3_11))) InVars {len_1=v_len_1_11, len_3=v_len_3_11} OutVars{break_5=v_break_5_15, i_4=v_i_4_18, len_1=v_len_1_11, result_6=v_result_6_19, len_3=v_len_3_11} AuxVars[] AssignedVars[break_5, i_4, result_6]" [2025-04-26 16:22:07,827 INFO L754 eck$LassoCheckResult]: Loop: "[62] L29-->L29: Formula: (let ((.cse2 (select v_array_2_9 v_i_4_14)) (.cse1 (select v_array_0_9 v_i_4_14))) (let ((.cse0 (= .cse2 .cse1))) (and (< v_i_4_15 v_len_1_7) (or (and (not v_break_5_9) .cse0) (and v_break_5_9 (not .cse0))) (< v_i_4_15 v_len_3_7) (= v_result_6_13 (ite .cse0 v_result_6_14 (+ .cse1 (* (- 1) .cse2)))) (not v_break_5_10) (= (+ v_i_4_15 1) v_i_4_14)))) InVars {break_5=v_break_5_10, i_4=v_i_4_15, len_1=v_len_1_7, array_2=v_array_2_9, result_6=v_result_6_14, len_3=v_len_3_7, array_0=v_array_0_9} OutVars{break_5=v_break_5_9, i_4=v_i_4_14, len_1=v_len_1_7, array_2=v_array_2_9, result_6=v_result_6_13, len_3=v_len_3_7, array_0=v_array_0_9} AuxVars[] AssignedVars[break_5, i_4, result_6]" [2025-04-26 16:22:07,830 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:07,830 INFO L85 PathProgramCache]: Analyzing trace with hash 3191, now seen corresponding path program 1 times [2025-04-26 16:22:07,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:07,835 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115555125] [2025-04-26 16:22:07,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:07,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:07,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:22:07,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:22:07,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:07,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:07,877 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:07,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:22:07,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:22:07,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:07,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:07,890 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:07,893 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:07,893 INFO L85 PathProgramCache]: Analyzing trace with hash 93, now seen corresponding path program 1 times [2025-04-26 16:22:07,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:07,893 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130158465] [2025-04-26 16:22:07,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:07,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:07,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:22:07,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:22:07,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:07,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:07,903 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:07,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:22:07,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:22:07,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:07,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:07,908 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:07,908 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:07,908 INFO L85 PathProgramCache]: Analyzing trace with hash 98983, now seen corresponding path program 1 times [2025-04-26 16:22:07,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:07,909 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447401444] [2025-04-26 16:22:07,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:07,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:07,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:22:07,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:22:07,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:07,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:07,918 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:07,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:22:07,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:22:07,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:07,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:07,926 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:08,092 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:22:08,093 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:22:08,093 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:22:08,093 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:22:08,093 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:22:08,093 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:08,093 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:22:08,094 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:22:08,094 INFO L132 ssoRankerPreferences]: Filename of dumped script: array-int-symm.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:22:08,094 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:22:08,094 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:22:08,110 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:08,204 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:08,394 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:22:08,396 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:22:08,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:08,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:08,400 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:22:08,401 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:22:08,403 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:22:08,414 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:08,415 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:08,415 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2025-04-26 16:22:08,415 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:08,462 INFO L402 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2025-04-26 16:22:08,463 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2025-04-26 16:22:08,516 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:22:08,548 INFO L436 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2025-04-26 16:22:08,548 INFO L437 ModelExtractionUtils]: 47 out of 57 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-04-26 16:22:08,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:08,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:08,552 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:22:08,553 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:22:08,554 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:22:08,574 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:22:08,574 INFO L439 nArgumentSynthesizer]: Removed 6 redundant supporting invariants from a total of 6. [2025-04-26 16:22:08,575 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:22:08,575 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i_4, len_1) = -1*i_4 + 1*len_1 Supporting invariants [] [2025-04-26 16:22:08,583 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:22:08,585 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:22:08,619 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:08,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:22:08,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:22:08,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:08,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:08,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:22:08,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:08,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:22:08,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:22:08,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:08,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:08,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:22:08,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:08,645 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:22:08,708 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-04-26 16:22:08,715 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 29 states, but on-demand construction may add more states Second operand has 2 states, 2 states have (on average 1.5) internal successors, (in total 3), 2 states have internal predecessors, (3), 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:22:08,774 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 29 states, but on-demand construction may add more states. Second operand has 2 states, 2 states have (on average 1.5) internal successors, (in total 3), 2 states have internal predecessors, (3), 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 67 states and 149 transitions. Complement of second has 5 states. [2025-04-26 16:22:08,775 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:22:08,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.5) internal successors, (in total 3), 2 states have internal predecessors, (3), 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:22:08,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2025-04-26 16:22:08,782 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 2 letters. Loop has 1 letters. [2025-04-26 16:22:08,782 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:08,783 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 3 letters. Loop has 1 letters. [2025-04-26 16:22:08,783 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:08,783 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 16:22:08,783 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:08,783 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 149 transitions. [2025-04-26 16:22:08,785 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 5 [2025-04-26 16:22:08,788 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 25 states and 58 transitions. [2025-04-26 16:22:08,788 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2025-04-26 16:22:08,789 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2025-04-26 16:22:08,789 INFO L74 IsDeterministic]: Start isDeterministic. Operand 25 states and 58 transitions. [2025-04-26 16:22:08,789 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:08,789 INFO L218 hiAutomatonCegarLoop]: Abstraction has 25 states and 58 transitions. [2025-04-26 16:22:08,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 58 transitions. [2025-04-26 16:22:08,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2025-04-26 16:22:08,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.3636363636363638) internal successors, (in total 52), 21 states have internal predecessors, (52), 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:22:08,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 52 transitions. [2025-04-26 16:22:08,806 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 52 transitions. [2025-04-26 16:22:08,806 INFO L438 stractBuchiCegarLoop]: Abstraction has 22 states and 52 transitions. [2025-04-26 16:22:08,806 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:22:08,807 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 52 transitions. [2025-04-26 16:22:08,807 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 5 [2025-04-26 16:22:08,807 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:08,807 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:08,810 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:22:08,810 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:22:08,811 INFO L752 eck$LassoCheckResult]: Stem: "[70] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[73] L61-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[64] $Ultimate##0-->L48: Formula: (and (= (+ v_result_9_19 v_len_1_17) v_len_3_17) (not v_break_8_15) (= v_i_7_18 0)) InVars {len_1=v_len_1_17, len_3=v_len_3_17} OutVars{result_9=v_result_9_19, i_7=v_i_7_18, len_1=v_len_1_17, break_8=v_break_8_15, len_3=v_len_3_17} AuxVars[] AssignedVars[result_9, i_7, break_8]" [2025-04-26 16:22:08,811 INFO L754 eck$LassoCheckResult]: Loop: "[66] L48-->L48: Formula: (let ((.cse1 (select v_array_2_15 v_i_7_14)) (.cse2 (select v_array_0_15 v_i_7_14))) (let ((.cse0 (= .cse1 .cse2))) (and (< v_i_7_15 v_len_3_13) (= v_result_9_13 (ite .cse0 v_result_9_14 (+ .cse1 (* (- 1) .cse2)))) (= (+ v_i_7_15 1) v_i_7_14) (< v_i_7_15 v_len_1_13) (or (and (not v_break_8_9) .cse0) (and (not .cse0) v_break_8_9)) (not v_break_8_10)))) InVars {result_9=v_result_9_14, i_7=v_i_7_15, len_1=v_len_1_13, array_2=v_array_2_15, break_8=v_break_8_10, len_3=v_len_3_13, array_0=v_array_0_15} OutVars{result_9=v_result_9_13, i_7=v_i_7_14, len_1=v_len_1_13, array_2=v_array_2_15, break_8=v_break_8_9, len_3=v_len_3_13, array_0=v_array_0_15} AuxVars[] AssignedVars[result_9, i_7, break_8]" [2025-04-26 16:22:08,811 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:08,811 INFO L85 PathProgramCache]: Analyzing trace with hash 99388, now seen corresponding path program 1 times [2025-04-26 16:22:08,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:08,812 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757502033] [2025-04-26 16:22:08,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:08,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:08,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:22:08,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:22:08,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:08,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:08,818 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:08,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:22:08,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:22:08,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:08,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:08,824 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:08,825 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:08,825 INFO L85 PathProgramCache]: Analyzing trace with hash 97, now seen corresponding path program 1 times [2025-04-26 16:22:08,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:08,825 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470850697] [2025-04-26 16:22:08,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:08,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:08,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:22:08,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:22:08,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:08,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:08,832 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:08,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:22:08,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:22:08,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:08,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:08,842 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:08,842 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:08,844 INFO L85 PathProgramCache]: Analyzing trace with hash 3081094, now seen corresponding path program 1 times [2025-04-26 16:22:08,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:08,844 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439378331] [2025-04-26 16:22:08,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:08,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:08,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:22:08,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:22:08,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:08,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:08,850 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:08,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:22:08,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:22:08,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:08,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:08,860 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:08,988 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:22:08,989 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:22:08,989 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:22:08,989 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:22:08,989 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:22:08,989 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:08,989 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:22:08,989 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:22:08,989 INFO L132 ssoRankerPreferences]: Filename of dumped script: array-int-symm.wvr.bpl_petrified1_Iteration2_Lasso [2025-04-26 16:22:08,989 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:22:08,989 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:22:08,990 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:08,994 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:09,044 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:09,046 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:09,215 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:22:09,215 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:22:09,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:09,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:09,218 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:22:09,219 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:22:09,221 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:22:09,231 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:09,231 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:09,231 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:09,231 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:09,232 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:09,233 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:09,235 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:09,242 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:22:09,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:09,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:09,244 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:22:09,246 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:22:09,247 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:22:09,258 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:09,258 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:09,258 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2025-04-26 16:22:09,258 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:09,283 INFO L402 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2025-04-26 16:22:09,283 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2025-04-26 16:22:09,328 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:22:09,358 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 16:22:09,358 INFO L437 ModelExtractionUtils]: 47 out of 57 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-04-26 16:22:09,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:09,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:09,360 INFO L229 MonitoredProcess]: Starting monitored process 6 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:22:09,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 16:22:09,363 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:22:09,382 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:09,383 INFO L439 nArgumentSynthesizer]: Removed 6 redundant supporting invariants from a total of 6. [2025-04-26 16:22:09,383 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:22:09,383 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i_7, len_3) = -1*i_7 + 1*len_3 Supporting invariants [] [2025-04-26 16:22:09,390 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:22:09,391 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:22:09,401 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:09,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:22:09,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:22:09,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:09,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:09,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:22:09,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:09,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:22:09,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:22:09,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:09,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:09,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:22:09,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:09,422 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:22:09,422 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-04-26 16:22:09,422 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 52 transitions. cyclomatic complexity: 38 Second operand has 2 states, 2 states have (on average 2.0) internal successors, (in total 4), 2 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:22:09,446 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 52 transitions. cyclomatic complexity: 38. Second operand has 2 states, 2 states have (on average 2.0) internal successors, (in total 4), 2 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 42 states and 94 transitions. Complement of second has 4 states. [2025-04-26 16:22:09,446 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:22:09,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.0) internal successors, (in total 4), 2 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:22:09,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2025-04-26 16:22:09,447 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 3 letters. Loop has 1 letters. [2025-04-26 16:22:09,447 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:09,447 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 4 letters. Loop has 1 letters. [2025-04-26 16:22:09,447 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:09,447 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 3 letters. Loop has 2 letters. [2025-04-26 16:22:09,447 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:09,447 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 94 transitions. [2025-04-26 16:22:09,448 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:22:09,448 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 0 states and 0 transitions. [2025-04-26 16:22:09,449 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:22:09,449 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:22:09,449 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:22:09,449 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:22:09,449 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:22:09,449 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:22:09,449 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:22:09,449 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:22:09,449 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:22:09,449 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:22:09,449 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:22:09,459 INFO L201 PluginConnector]: Adding new model array-int-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:22:09 BoogieIcfgContainer [2025-04-26 16:22:09,459 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:22:09,460 INFO L158 Benchmark]: Toolchain (without parser) took 1999.74ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 86.1MB in the beginning and 41.5MB in the end (delta: 44.6MB). Peak memory consumption was 25.7MB. Max. memory is 8.0GB. [2025-04-26 16:22:09,460 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.17ms. Allocated memory is still 159.4MB. Free memory is still 87.1MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:22:09,460 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.92ms. Allocated memory is still 159.4MB. Free memory was 86.1MB in the beginning and 83.7MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:22:09,460 INFO L158 Benchmark]: Boogie Preprocessor took 17.49ms. Allocated memory is still 159.4MB. Free memory was 83.7MB in the beginning and 82.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:22:09,460 INFO L158 Benchmark]: RCFGBuilder took 178.51ms. Allocated memory is still 159.4MB. Free memory was 82.6MB in the beginning and 71.4MB in the end (delta: 11.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:22:09,461 INFO L158 Benchmark]: BuchiAutomizer took 1765.30ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 71.4MB in the beginning and 41.5MB in the end (delta: 29.9MB). Peak memory consumption was 17.3MB. Max. memory is 8.0GB. [2025-04-26 16:22:09,463 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.17ms. Allocated memory is still 159.4MB. Free memory is still 87.1MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.92ms. Allocated memory is still 159.4MB. Free memory was 86.1MB in the beginning and 83.7MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 17.49ms. Allocated memory is still 159.4MB. Free memory was 83.7MB in the beginning and 82.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 178.51ms. Allocated memory is still 159.4MB. Free memory was 82.6MB in the beginning and 71.4MB in the end (delta: 11.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * BuchiAutomizer took 1765.30ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 71.4MB in the beginning and 41.5MB in the end (delta: 29.9MB). Peak memory consumption was 17.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.6s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 1.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations. 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 [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 31 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 29 mSDsluCounter, 14 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 35 IncrementalHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 9 mSDtfsCounter, 35 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital86 mio100 ax100 hnf100 lsp105 ukn63 mio100 lsp100 div100 bol108 ite100 ukn100 eq166 hnf97 smp100 dnf247 smp55 tf100 neg100 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 178ms VariablesStem: 5 VariablesLoop: 10 DisjunctsStem: 1 DisjunctsLoop: 3 SupportingInvariants: 6 MotzkinApplications: 30 LassoTerminationAnalysisBenchmarks: 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 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * i_4 + len_1 and consists of 4 locations. One deterministic module has affine ranking function len_3 + -1 * i_7 and consists of 3 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:22:09,476 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...