/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/popl20-more/inc-subseq-array.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:23:14,764 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:23:14,815 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:23:14,822 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:23:14,822 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:23:14,838 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:23:14,839 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:23:14,839 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:23:14,839 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:23:14,839 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:23:14,839 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:23:14,839 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:23:14,839 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:23:14,839 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:23:14,839 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:23:14,839 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:23:14,839 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:23:14,840 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:23:14,840 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:23:14,840 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:23:14,840 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:23:14,840 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:23:14,840 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:23:14,840 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:23:14,840 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:23:14,840 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:23:14,840 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:23:14,840 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:23:14,840 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:23:14,840 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:23:14,840 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:23:14,842 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:23:14,842 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:23:14,842 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:23:14,842 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:23:14,842 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:23:14,842 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:23:15,063 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:23:15,074 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:23:15,076 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:23:15,076 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:23:15,077 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:23:15,078 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/inc-subseq-array.wvr.bpl [2025-04-26 16:23:15,079 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/inc-subseq-array.wvr.bpl' [2025-04-26 16:23:15,097 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:23:15,098 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:23:15,099 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:23:15,099 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:23:15,099 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:23:15,106 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "inc-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:15" (1/1) ... [2025-04-26 16:23:15,127 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "inc-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:15" (1/1) ... [2025-04-26 16:23:15,137 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:23:15,138 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:23:15,139 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:23:15,139 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:23:15,139 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:23:15,144 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "inc-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:15" (1/1) ... [2025-04-26 16:23:15,144 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "inc-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:15" (1/1) ... [2025-04-26 16:23:15,147 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "inc-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:15" (1/1) ... [2025-04-26 16:23:15,147 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "inc-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:15" (1/1) ... [2025-04-26 16:23:15,150 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "inc-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:15" (1/1) ... [2025-04-26 16:23:15,150 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "inc-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:15" (1/1) ... [2025-04-26 16:23:15,154 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "inc-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:15" (1/1) ... [2025-04-26 16:23:15,154 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "inc-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:15" (1/1) ... [2025-04-26 16:23:15,155 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "inc-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:15" (1/1) ... [2025-04-26 16:23:15,165 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:23:15,165 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:23:15,166 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:23:15,166 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:23:15,169 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "inc-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:15" (1/1) ... [2025-04-26 16:23:15,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:15,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:15,192 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:23:15,198 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:23:15,214 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:23:15,215 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:23:15,215 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:23:15,215 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:23:15,215 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:23:15,215 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:23:15,215 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:23:15,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:23:15,215 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:23:15,216 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:23:15,253 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:23:15,255 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:23:15,329 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:23:15,329 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:23:15,345 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:23:15,345 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:23:15,345 INFO L201 PluginConnector]: Adding new model inc-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:23:15 BoogieIcfgContainer [2025-04-26 16:23:15,345 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:23:15,346 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:23:15,346 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:23:15,352 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:23:15,352 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:23:15,352 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "inc-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:15" (1/2) ... [2025-04-26 16:23:15,354 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3d269675 and model type inc-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:23:15, skipping insertion in model container [2025-04-26 16:23:15,354 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:23:15,354 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "inc-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:23:15" (2/2) ... [2025-04-26 16:23:15,355 INFO L376 chiAutomizerObserver]: Analyzing ICFG inc-subseq-array.wvr.bpl [2025-04-26 16:23:15,397 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 16:23:15,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 30 transitions, 74 flow [2025-04-26 16:23:15,441 INFO L116 PetriNetUnfolderBase]: 3/26 cut-off events. [2025-04-26 16:23:15,443 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 16:23:15,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 26 events. 3/26 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 36 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 17. Up to 2 conditions per place. [2025-04-26 16:23:15,446 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 30 transitions, 74 flow [2025-04-26 16:23:15,448 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 26 transitions, 64 flow [2025-04-26 16:23:15,449 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 30 places, 26 transitions, 64 flow [2025-04-26 16:23:15,457 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:23:15,457 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:23:15,457 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:23:15,457 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:23:15,457 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:23:15,458 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:23:15,458 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:23:15,458 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:23:15,459 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:23:15,485 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 47 [2025-04-26 16:23:15,485 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:15,485 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:15,489 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:23:15,489 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:23:15,489 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:23:15,489 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 64 states, but on-demand construction may add more states [2025-04-26 16:23:15,494 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 47 [2025-04-26 16:23:15,494 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:15,494 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:15,494 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:23:15,495 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:23:15,499 INFO L752 eck$LassoCheckResult]: Stem: "[63] $Ultimate##0-->L54: Formula: (= v_end_7 v_start_7) InVars {end=v_end_7, start=v_start_7} OutVars{end=v_end_7, start=v_start_7} AuxVars[] AssignedVars[]" "[42] L54-->L55: Formula: (and (= v_v_old_3 v_last_4) (= (select v_A_5 0) v_v_old_3)) InVars {A=v_A_5, last=v_last_4, v_old=v_v_old_3} OutVars{A=v_A_5, last=v_last_4, v_old=v_v_old_3} AuxVars[] AssignedVars[]" "[55] L55-->L56: Formula: (= v_i_11 0) InVars {i=v_i_11} OutVars{i=v_i_11} AuxVars[] AssignedVars[]" "[46] L56-->L57: Formula: v_ok_4 InVars {ok=v_ok_4} OutVars{ok=v_ok_4} AuxVars[] AssignedVars[]" "[87] L57-->L23: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" [2025-04-26 16:23:15,500 INFO L754 eck$LassoCheckResult]: Loop: "[69] L23-->L24: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[72] L24-->L24-2: Formula: (< (select v_A_4 v_i_5) v_last_3) InVars {A=v_A_4, last=v_last_3, i=v_i_5} OutVars{A=v_A_4, last=v_last_3, i=v_i_5} AuxVars[] AssignedVars[]" "[74] L24-2-->L23: Formula: (= v_i_6 (+ v_i_7 1)) InVars {i=v_i_7} OutVars{i=v_i_6} AuxVars[] AssignedVars[i]" [2025-04-26 16:23:15,503 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:15,503 INFO L85 PathProgramCache]: Analyzing trace with hash 88116564, now seen corresponding path program 1 times [2025-04-26 16:23:15,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:15,508 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231068079] [2025-04-26 16:23:15,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:15,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:15,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:15,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:15,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:15,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:15,555 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:15,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:15,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:15,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:15,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:15,571 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:15,573 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:15,573 INFO L85 PathProgramCache]: Analyzing trace with hash 98406, now seen corresponding path program 1 times [2025-04-26 16:23:15,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:15,573 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873529230] [2025-04-26 16:23:15,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:15,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:15,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:23:15,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:23:15,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:15,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:15,581 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:15,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:23:15,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:23:15,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:15,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:15,585 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:15,586 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:15,586 INFO L85 PathProgramCache]: Analyzing trace with hash 855608883, now seen corresponding path program 1 times [2025-04-26 16:23:15,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:15,586 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691354558] [2025-04-26 16:23:15,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:15,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:15,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:23:15,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:23:15,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:15,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:15,682 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:23:15,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:23:15,683 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691354558] [2025-04-26 16:23:15,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691354558] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:23:15,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:23:15,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-26 16:23:15,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521242477] [2025-04-26 16:23:15,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:23:15,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:23:15,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 16:23:15,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-26 16:23:15,765 INFO L87 Difference]: Start difference. First operand currently 64 states, but on-demand construction may add more states Second operand has 4 states, 4 states have (on average 2.0) internal successors, (in total 8), 4 states have internal predecessors, (8), 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:23:15,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:23:15,870 INFO L93 Difference]: Finished difference Result 186 states and 372 transitions. [2025-04-26 16:23:15,871 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 186 states and 372 transitions. [2025-04-26 16:23:15,878 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 127 [2025-04-26 16:23:15,887 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 186 states to 159 states and 327 transitions. [2025-04-26 16:23:15,888 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 159 [2025-04-26 16:23:15,889 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 159 [2025-04-26 16:23:15,889 INFO L74 IsDeterministic]: Start isDeterministic. Operand 159 states and 327 transitions. [2025-04-26 16:23:15,891 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:23:15,891 INFO L218 hiAutomatonCegarLoop]: Abstraction has 159 states and 327 transitions. [2025-04-26 16:23:15,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states and 327 transitions. [2025-04-26 16:23:15,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 68. [2025-04-26 16:23:15,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 68 states have (on average 2.1029411764705883) internal successors, (in total 143), 67 states have internal predecessors, (143), 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:23:15,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 143 transitions. [2025-04-26 16:23:15,940 INFO L240 hiAutomatonCegarLoop]: Abstraction has 68 states and 143 transitions. [2025-04-26 16:23:15,941 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-26 16:23:15,943 INFO L438 stractBuchiCegarLoop]: Abstraction has 68 states and 143 transitions. [2025-04-26 16:23:15,943 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:23:15,943 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 143 transitions. [2025-04-26 16:23:15,944 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 55 [2025-04-26 16:23:15,945 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:15,945 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:15,945 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 16:23:15,945 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:23:15,945 INFO L752 eck$LassoCheckResult]: Stem: "[63] $Ultimate##0-->L54: Formula: (= v_end_7 v_start_7) InVars {end=v_end_7, start=v_start_7} OutVars{end=v_end_7, start=v_start_7} AuxVars[] AssignedVars[]" "[42] L54-->L55: Formula: (and (= v_v_old_3 v_last_4) (= (select v_A_5 0) v_v_old_3)) InVars {A=v_A_5, last=v_last_4, v_old=v_v_old_3} OutVars{A=v_A_5, last=v_last_4, v_old=v_v_old_3} AuxVars[] AssignedVars[]" "[55] L55-->L56: Formula: (= v_i_11 0) InVars {i=v_i_11} OutVars{i=v_i_11} AuxVars[] AssignedVars[]" "[46] L56-->L57: Formula: v_ok_4 InVars {ok=v_ok_4} OutVars{ok=v_ok_4} AuxVars[] AssignedVars[]" "[87] L57-->L23: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[84] L57-1-->L39: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0]" [2025-04-26 16:23:15,946 INFO L754 eck$LassoCheckResult]: Loop: "[77] L39-->L40: Formula: (or (< v_start_1 v_end_4) (< v_i_9 v_N_3)) InVars {i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} OutVars{i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} AuxVars[] AssignedVars[]" "[79] L40-->L40-1: Formula: (and (< v_start_13 v_end_12) (= v_start_12 (+ v_start_13 1)) (= (select v_queue_7 v_start_13) v_new_6)) InVars {queue=v_queue_7, end=v_end_12, start=v_start_13} OutVars{end=v_end_12, start=v_start_12, new=v_new_6, queue=v_queue_7} AuxVars[] AssignedVars[start, new]" "[80] L40-1-->L46: Formula: (or (and (<= v_v_old_1 v_new_2) v_ok_2 v_ok_1) (and (or (not v_ok_2) (< v_new_2 v_v_old_1)) (not v_ok_1))) InVars {ok=v_ok_2, v_old=v_v_old_1, new=v_new_2} OutVars{ok=v_ok_1, v_old=v_v_old_1, new=v_new_2} AuxVars[] AssignedVars[ok]" "[81] L46-->L39: Formula: (= v_v_old_2 v_new_3) InVars {new=v_new_3} OutVars{v_old=v_v_old_2, new=v_new_3} AuxVars[] AssignedVars[v_old]" [2025-04-26 16:23:15,946 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:15,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1563353728, now seen corresponding path program 1 times [2025-04-26 16:23:15,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:15,946 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006231513] [2025-04-26 16:23:15,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:15,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:15,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:23:15,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:23:15,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:15,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:15,954 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:15,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:23:15,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:23:15,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:15,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:15,965 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:15,965 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:15,965 INFO L85 PathProgramCache]: Analyzing trace with hash 3295908, now seen corresponding path program 1 times [2025-04-26 16:23:15,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:15,965 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862259232] [2025-04-26 16:23:15,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:15,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:15,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:15,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:15,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:15,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:15,974 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:15,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:15,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:15,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:15,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:15,985 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:15,986 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:15,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1915392163, now seen corresponding path program 1 times [2025-04-26 16:23:15,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:15,986 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049299059] [2025-04-26 16:23:15,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:15,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:15,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:23:15,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:23:15,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:15,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:16,011 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:23:16,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:23:16,012 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049299059] [2025-04-26 16:23:16,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049299059] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:23:16,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:23:16,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:23:16,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083361057] [2025-04-26 16:23:16,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:23:16,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:23:16,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:23:16,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:23:16,130 INFO L87 Difference]: Start difference. First operand 68 states and 143 transitions. cyclomatic complexity: 84 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:16,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:23:16,144 INFO L93 Difference]: Finished difference Result 77 states and 150 transitions. [2025-04-26 16:23:16,144 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 150 transitions. [2025-04-26 16:23:16,147 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 47 [2025-04-26 16:23:16,148 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 69 states and 137 transitions. [2025-04-26 16:23:16,148 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2025-04-26 16:23:16,148 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 69 [2025-04-26 16:23:16,148 INFO L74 IsDeterministic]: Start isDeterministic. Operand 69 states and 137 transitions. [2025-04-26 16:23:16,149 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:23:16,149 INFO L218 hiAutomatonCegarLoop]: Abstraction has 69 states and 137 transitions. [2025-04-26 16:23:16,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 137 transitions. [2025-04-26 16:23:16,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2025-04-26 16:23:16,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 67 states have (on average 2.0) internal successors, (in total 134), 66 states have internal predecessors, (134), 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:23:16,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 134 transitions. [2025-04-26 16:23:16,155 INFO L240 hiAutomatonCegarLoop]: Abstraction has 67 states and 134 transitions. [2025-04-26 16:23:16,156 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:23:16,157 INFO L438 stractBuchiCegarLoop]: Abstraction has 67 states and 134 transitions. [2025-04-26 16:23:16,157 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:23:16,157 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 134 transitions. [2025-04-26 16:23:16,157 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 47 [2025-04-26 16:23:16,157 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:16,157 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:16,158 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:16,158 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:23:16,158 INFO L752 eck$LassoCheckResult]: Stem: "[63] $Ultimate##0-->L54: Formula: (= v_end_7 v_start_7) InVars {end=v_end_7, start=v_start_7} OutVars{end=v_end_7, start=v_start_7} AuxVars[] AssignedVars[]" "[42] L54-->L55: Formula: (and (= v_v_old_3 v_last_4) (= (select v_A_5 0) v_v_old_3)) InVars {A=v_A_5, last=v_last_4, v_old=v_v_old_3} OutVars{A=v_A_5, last=v_last_4, v_old=v_v_old_3} AuxVars[] AssignedVars[]" "[55] L55-->L56: Formula: (= v_i_11 0) InVars {i=v_i_11} OutVars{i=v_i_11} AuxVars[] AssignedVars[]" "[46] L56-->L57: Formula: v_ok_4 InVars {ok=v_ok_4} OutVars{ok=v_ok_4} AuxVars[] AssignedVars[]" "[87] L57-->L23: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[69] L23-->L24: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[71] L24-->L25: Formula: (<= v_last_1 (select v_A_1 v_i_2)) InVars {A=v_A_1, last=v_last_1, i=v_i_2} OutVars{A=v_A_1, last=v_last_1, i=v_i_2} AuxVars[] AssignedVars[]" "[73] L25-->L25-1: Formula: (and (= (select v_A_6 v_i_12) (select v_queue_3 v_end_9)) (= (+ v_end_9 1) v_end_8)) InVars {A=v_A_6, i=v_i_12, end=v_end_9, queue=v_queue_3} OutVars{A=v_A_6, i=v_i_12, end=v_end_8, queue=v_queue_3} AuxVars[] AssignedVars[end]" [2025-04-26 16:23:16,158 INFO L754 eck$LassoCheckResult]: Loop: "[75] L25-1-->L24-2: Formula: (= (select v_A_3 v_i_4) v_last_2) InVars {A=v_A_3, i=v_i_4} OutVars{A=v_A_3, last=v_last_2, i=v_i_4} AuxVars[] AssignedVars[last]" "[74] L24-2-->L23: Formula: (= v_i_6 (+ v_i_7 1)) InVars {i=v_i_7} OutVars{i=v_i_6} AuxVars[] AssignedVars[i]" "[69] L23-->L24: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[71] L24-->L25: Formula: (<= v_last_1 (select v_A_1 v_i_2)) InVars {A=v_A_1, last=v_last_1, i=v_i_2} OutVars{A=v_A_1, last=v_last_1, i=v_i_2} AuxVars[] AssignedVars[]" "[73] L25-->L25-1: Formula: (and (= (select v_A_6 v_i_12) (select v_queue_3 v_end_9)) (= (+ v_end_9 1) v_end_8)) InVars {A=v_A_6, i=v_i_12, end=v_end_9, queue=v_queue_3} OutVars{A=v_A_6, i=v_i_12, end=v_end_8, queue=v_queue_3} AuxVars[] AssignedVars[end]" [2025-04-26 16:23:16,159 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:16,159 INFO L85 PathProgramCache]: Analyzing trace with hash 855608851, now seen corresponding path program 1 times [2025-04-26 16:23:16,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:16,159 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747771439] [2025-04-26 16:23:16,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:16,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:16,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:23:16,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:23:16,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:16,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:16,169 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:16,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:23:16,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:23:16,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:16,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:16,178 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:16,178 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:16,181 INFO L85 PathProgramCache]: Analyzing trace with hash 100166343, now seen corresponding path program 1 times [2025-04-26 16:23:16,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:16,181 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441956936] [2025-04-26 16:23:16,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:16,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:16,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:16,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:16,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:16,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:16,189 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:16,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:16,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:16,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:16,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:16,198 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:16,198 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:16,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1228462069, now seen corresponding path program 1 times [2025-04-26 16:23:16,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:16,199 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108828038] [2025-04-26 16:23:16,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:16,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:16,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:23:16,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:23:16,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:16,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:16,211 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:16,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:23:16,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:23:16,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:16,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:16,225 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:16,344 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:16,345 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:16,345 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:16,345 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:16,345 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:16,345 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:16,345 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:16,345 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:16,345 INFO L132 ssoRankerPreferences]: Filename of dumped script: inc-subseq-array.wvr.bpl_petrified1_Iteration3_Lasso [2025-04-26 16:23:16,346 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:16,346 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:16,359 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:16,365 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:16,405 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:16,498 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:16,500 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:16,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:16,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:16,503 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:23:16,504 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:23:16,505 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:23:16,515 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:16,516 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:16,516 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:16,516 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:16,520 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:16,520 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:16,524 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:16,530 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-04-26 16:23:16,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:16,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:16,532 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:23:16,534 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:23:16,535 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:23:16,545 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:16,545 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:16,546 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:16,546 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:16,549 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:16,549 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:16,554 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:16,565 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 16:23:16,565 INFO L437 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 16:23:16,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:16,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:16,570 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:23:16,571 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:23:16,572 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:16,587 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 16:23:16,588 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:23:16,588 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:16,589 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, i) = 1*N - 1*i Supporting invariants [] [2025-04-26 16:23:16,593 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:23:16,595 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:23:16,614 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:16,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:23:16,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:23:16,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:16,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:16,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:16,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:16,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:16,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:16,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:16,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:16,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:16,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:16,683 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:23:16,686 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 16:23:16,687 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 67 states and 134 transitions. cyclomatic complexity: 74 Second operand has 5 states, 5 states have (on average 2.6) internal successors, (in total 13), 5 states have internal predecessors, (13), 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:23:16,750 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 67 states and 134 transitions. cyclomatic complexity: 74. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (in total 13), 5 states have internal predecessors, (13), 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 152 states and 345 transitions. Complement of second has 6 states. [2025-04-26 16:23:16,751 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:23:16,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (in total 13), 5 states have internal predecessors, (13), 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:23:16,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2025-04-26 16:23:16,755 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 45 transitions. Stem has 8 letters. Loop has 5 letters. [2025-04-26 16:23:16,755 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:16,755 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 45 transitions. Stem has 13 letters. Loop has 5 letters. [2025-04-26 16:23:16,755 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:16,755 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 45 transitions. Stem has 8 letters. Loop has 10 letters. [2025-04-26 16:23:16,756 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:16,756 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 152 states and 345 transitions. [2025-04-26 16:23:16,757 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 32 [2025-04-26 16:23:16,759 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 152 states to 100 states and 225 transitions. [2025-04-26 16:23:16,759 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2025-04-26 16:23:16,760 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2025-04-26 16:23:16,760 INFO L74 IsDeterministic]: Start isDeterministic. Operand 100 states and 225 transitions. [2025-04-26 16:23:16,760 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:16,760 INFO L218 hiAutomatonCegarLoop]: Abstraction has 100 states and 225 transitions. [2025-04-26 16:23:16,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states and 225 transitions. [2025-04-26 16:23:16,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 84. [2025-04-26 16:23:16,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 84 states have (on average 2.25) internal successors, (in total 189), 83 states have internal predecessors, (189), 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:23:16,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 189 transitions. [2025-04-26 16:23:16,768 INFO L240 hiAutomatonCegarLoop]: Abstraction has 84 states and 189 transitions. [2025-04-26 16:23:16,768 INFO L438 stractBuchiCegarLoop]: Abstraction has 84 states and 189 transitions. [2025-04-26 16:23:16,768 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:23:16,768 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84 states and 189 transitions. [2025-04-26 16:23:16,768 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 32 [2025-04-26 16:23:16,768 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:16,768 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:16,769 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:16,769 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:23:16,769 INFO L752 eck$LassoCheckResult]: Stem: "[63] $Ultimate##0-->L54: Formula: (= v_end_7 v_start_7) InVars {end=v_end_7, start=v_start_7} OutVars{end=v_end_7, start=v_start_7} AuxVars[] AssignedVars[]" "[42] L54-->L55: Formula: (and (= v_v_old_3 v_last_4) (= (select v_A_5 0) v_v_old_3)) InVars {A=v_A_5, last=v_last_4, v_old=v_v_old_3} OutVars{A=v_A_5, last=v_last_4, v_old=v_v_old_3} AuxVars[] AssignedVars[]" "[55] L55-->L56: Formula: (= v_i_11 0) InVars {i=v_i_11} OutVars{i=v_i_11} AuxVars[] AssignedVars[]" "[46] L56-->L57: Formula: v_ok_4 InVars {ok=v_ok_4} OutVars{ok=v_ok_4} AuxVars[] AssignedVars[]" "[87] L57-->L23: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[69] L23-->L24: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[71] L24-->L25: Formula: (<= v_last_1 (select v_A_1 v_i_2)) InVars {A=v_A_1, last=v_last_1, i=v_i_2} OutVars{A=v_A_1, last=v_last_1, i=v_i_2} AuxVars[] AssignedVars[]" "[73] L25-->L25-1: Formula: (and (= (select v_A_6 v_i_12) (select v_queue_3 v_end_9)) (= (+ v_end_9 1) v_end_8)) InVars {A=v_A_6, i=v_i_12, end=v_end_9, queue=v_queue_3} OutVars{A=v_A_6, i=v_i_12, end=v_end_8, queue=v_queue_3} AuxVars[] AssignedVars[end]" "[84] L57-1-->L39: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0]" [2025-04-26 16:23:16,769 INFO L754 eck$LassoCheckResult]: Loop: "[77] L39-->L40: Formula: (or (< v_start_1 v_end_4) (< v_i_9 v_N_3)) InVars {i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} OutVars{i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} AuxVars[] AssignedVars[]" "[79] L40-->L40-1: Formula: (and (< v_start_13 v_end_12) (= v_start_12 (+ v_start_13 1)) (= (select v_queue_7 v_start_13) v_new_6)) InVars {queue=v_queue_7, end=v_end_12, start=v_start_13} OutVars{end=v_end_12, start=v_start_12, new=v_new_6, queue=v_queue_7} AuxVars[] AssignedVars[start, new]" "[80] L40-1-->L46: Formula: (or (and (<= v_v_old_1 v_new_2) v_ok_2 v_ok_1) (and (or (not v_ok_2) (< v_new_2 v_v_old_1)) (not v_ok_1))) InVars {ok=v_ok_2, v_old=v_v_old_1, new=v_new_2} OutVars{ok=v_ok_1, v_old=v_v_old_1, new=v_new_2} AuxVars[] AssignedVars[ok]" "[81] L46-->L39: Formula: (= v_v_old_2 v_new_3) InVars {new=v_new_3} OutVars{v_old=v_v_old_2, new=v_new_3} AuxVars[] AssignedVars[v_old]" [2025-04-26 16:23:16,770 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:16,771 INFO L85 PathProgramCache]: Analyzing trace with hash 754070689, now seen corresponding path program 1 times [2025-04-26 16:23:16,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:16,771 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580588234] [2025-04-26 16:23:16,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:16,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:16,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:23:16,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:23:16,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:16,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:16,780 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:16,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:23:16,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:23:16,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:16,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:16,788 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:16,789 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:16,789 INFO L85 PathProgramCache]: Analyzing trace with hash 3295908, now seen corresponding path program 2 times [2025-04-26 16:23:16,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:16,789 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824349203] [2025-04-26 16:23:16,789 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:23:16,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:16,792 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:16,794 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:16,794 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:23:16,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:16,794 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:16,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:16,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:16,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:16,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:16,797 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:16,797 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:16,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1236873028, now seen corresponding path program 1 times [2025-04-26 16:23:16,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:16,797 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064775999] [2025-04-26 16:23:16,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:16,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:16,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:23:16,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:23:16,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:16,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:16,803 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:16,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:23:16,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:23:16,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:16,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:16,809 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:17,000 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:17,001 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:17,001 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:17,001 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:17,001 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:17,001 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:17,001 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:17,001 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:17,001 INFO L132 ssoRankerPreferences]: Filename of dumped script: inc-subseq-array.wvr.bpl_petrified1_Iteration4_Lasso [2025-04-26 16:23:17,001 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:17,001 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:17,002 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:17,005 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:17,007 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:17,009 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:17,011 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:17,061 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:17,217 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:17,217 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:17,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:17,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:17,222 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:23:17,223 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:23:17,224 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:23:17,236 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:17,237 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:17,238 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:17,238 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:17,240 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:17,240 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:17,243 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:17,249 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:23:17,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:17,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:17,251 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:23:17,252 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:23:17,254 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:23:17,264 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:17,264 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:17,264 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:17,264 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:17,267 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:17,267 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:17,269 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:17,275 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 16:23:17,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:17,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:17,277 INFO L229 MonitoredProcess]: Starting monitored process 7 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:23:17,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 16:23:17,280 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:23:17,289 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:17,289 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:17,289 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:17,290 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:17,292 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:17,292 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:17,294 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:17,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:17,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:17,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:17,302 INFO L229 MonitoredProcess]: Starting monitored process 8 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:23:17,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 16:23:17,303 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:23:17,313 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:17,313 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:17,313 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:17,313 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:17,314 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:17,315 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:17,317 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:17,324 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 16:23:17,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:17,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:17,326 INFO L229 MonitoredProcess]: Starting monitored process 9 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:23:17,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 16:23:17,328 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:23:17,338 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:17,338 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:17,338 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2025-04-26 16:23:17,338 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:17,367 INFO L402 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2025-04-26 16:23:17,367 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2025-04-26 16:23:17,401 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:17,406 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 16:23:17,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:17,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:17,409 INFO L229 MonitoredProcess]: Starting monitored process 10 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:23:17,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 16:23:17,411 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:23:17,421 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:17,421 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:17,421 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:17,421 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:17,423 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:17,423 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:17,428 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:17,436 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 16:23:17,436 INFO L437 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-04-26 16:23:17,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:17,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:17,438 INFO L229 MonitoredProcess]: Starting monitored process 11 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:23:17,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 16:23:17,440 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:17,455 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 16:23:17,455 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:23:17,455 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:17,455 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(end, start) = 1*end - 1*start Supporting invariants [] [2025-04-26 16:23:17,461 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 16:23:17,461 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:23:17,471 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:17,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:23:17,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:23:17,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:17,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:17,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:17,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:17,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:17,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:17,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:17,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:17,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:17,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:17,517 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:23:17,518 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:23:17,518 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 84 states and 189 transitions. cyclomatic complexity: 115 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (in total 13), 4 states have internal predecessors, (13), 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:23:17,540 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 84 states and 189 transitions. cyclomatic complexity: 115. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (in total 13), 4 states have internal predecessors, (13), 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 264 states and 609 transitions. Complement of second has 5 states. [2025-04-26 16:23:17,540 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:23:17,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (in total 13), 4 states have internal predecessors, (13), 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:23:17,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2025-04-26 16:23:17,541 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 36 transitions. Stem has 9 letters. Loop has 4 letters. [2025-04-26 16:23:17,541 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:17,541 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 36 transitions. Stem has 13 letters. Loop has 4 letters. [2025-04-26 16:23:17,541 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:17,541 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 36 transitions. Stem has 9 letters. Loop has 8 letters. [2025-04-26 16:23:17,541 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:17,542 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 264 states and 609 transitions. [2025-04-26 16:23:17,544 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 32 [2025-04-26 16:23:17,546 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 264 states to 173 states and 401 transitions. [2025-04-26 16:23:17,546 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 67 [2025-04-26 16:23:17,546 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 80 [2025-04-26 16:23:17,546 INFO L74 IsDeterministic]: Start isDeterministic. Operand 173 states and 401 transitions. [2025-04-26 16:23:17,546 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:17,546 INFO L218 hiAutomatonCegarLoop]: Abstraction has 173 states and 401 transitions. [2025-04-26 16:23:17,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states and 401 transitions. [2025-04-26 16:23:17,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 161. [2025-04-26 16:23:17,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 161 states have (on average 2.3664596273291925) internal successors, (in total 381), 160 states have internal predecessors, (381), 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:23:17,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 381 transitions. [2025-04-26 16:23:17,555 INFO L240 hiAutomatonCegarLoop]: Abstraction has 161 states and 381 transitions. [2025-04-26 16:23:17,555 INFO L438 stractBuchiCegarLoop]: Abstraction has 161 states and 381 transitions. [2025-04-26 16:23:17,555 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:23:17,555 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 161 states and 381 transitions. [2025-04-26 16:23:17,556 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 32 [2025-04-26 16:23:17,556 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:17,556 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:17,556 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:17,556 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:23:17,559 INFO L752 eck$LassoCheckResult]: Stem: "[63] $Ultimate##0-->L54: Formula: (= v_end_7 v_start_7) InVars {end=v_end_7, start=v_start_7} OutVars{end=v_end_7, start=v_start_7} AuxVars[] AssignedVars[]" "[42] L54-->L55: Formula: (and (= v_v_old_3 v_last_4) (= (select v_A_5 0) v_v_old_3)) InVars {A=v_A_5, last=v_last_4, v_old=v_v_old_3} OutVars{A=v_A_5, last=v_last_4, v_old=v_v_old_3} AuxVars[] AssignedVars[]" "[55] L55-->L56: Formula: (= v_i_11 0) InVars {i=v_i_11} OutVars{i=v_i_11} AuxVars[] AssignedVars[]" "[46] L56-->L57: Formula: v_ok_4 InVars {ok=v_ok_4} OutVars{ok=v_ok_4} AuxVars[] AssignedVars[]" "[87] L57-->L23: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[84] L57-1-->L39: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0]" "[69] L23-->L24: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[71] L24-->L25: Formula: (<= v_last_1 (select v_A_1 v_i_2)) InVars {A=v_A_1, last=v_last_1, i=v_i_2} OutVars{A=v_A_1, last=v_last_1, i=v_i_2} AuxVars[] AssignedVars[]" "[73] L25-->L25-1: Formula: (and (= (select v_A_6 v_i_12) (select v_queue_3 v_end_9)) (= (+ v_end_9 1) v_end_8)) InVars {A=v_A_6, i=v_i_12, end=v_end_9, queue=v_queue_3} OutVars{A=v_A_6, i=v_i_12, end=v_end_8, queue=v_queue_3} AuxVars[] AssignedVars[end]" "[75] L25-1-->L24-2: Formula: (= (select v_A_3 v_i_4) v_last_2) InVars {A=v_A_3, i=v_i_4} OutVars{A=v_A_3, last=v_last_2, i=v_i_4} AuxVars[] AssignedVars[last]" [2025-04-26 16:23:17,559 INFO L754 eck$LassoCheckResult]: Loop: "[77] L39-->L40: Formula: (or (< v_start_1 v_end_4) (< v_i_9 v_N_3)) InVars {i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} OutVars{i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} AuxVars[] AssignedVars[]" "[79] L40-->L40-1: Formula: (and (< v_start_13 v_end_12) (= v_start_12 (+ v_start_13 1)) (= (select v_queue_7 v_start_13) v_new_6)) InVars {queue=v_queue_7, end=v_end_12, start=v_start_13} OutVars{end=v_end_12, start=v_start_12, new=v_new_6, queue=v_queue_7} AuxVars[] AssignedVars[start, new]" "[80] L40-1-->L46: Formula: (or (and (<= v_v_old_1 v_new_2) v_ok_2 v_ok_1) (and (or (not v_ok_2) (< v_new_2 v_v_old_1)) (not v_ok_1))) InVars {ok=v_ok_2, v_old=v_v_old_1, new=v_new_2} OutVars{ok=v_ok_1, v_old=v_v_old_1, new=v_new_2} AuxVars[] AssignedVars[ok]" "[81] L46-->L39: Formula: (= v_v_old_2 v_new_3) InVars {new=v_new_3} OutVars{v_old=v_v_old_2, new=v_new_3} AuxVars[] AssignedVars[v_old]" [2025-04-26 16:23:17,559 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:17,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1915145924, now seen corresponding path program 1 times [2025-04-26 16:23:17,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:17,560 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509375057] [2025-04-26 16:23:17,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:17,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:17,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:23:17,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:23:17,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:17,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:17,565 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:17,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:23:17,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:23:17,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:17,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:17,573 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:17,574 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:17,574 INFO L85 PathProgramCache]: Analyzing trace with hash 3295908, now seen corresponding path program 3 times [2025-04-26 16:23:17,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:17,574 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355504444] [2025-04-26 16:23:17,574 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:23:17,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:17,580 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:17,584 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:17,584 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:23:17,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:17,584 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:17,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:17,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:17,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:17,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:17,590 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:17,592 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:17,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1358823399, now seen corresponding path program 1 times [2025-04-26 16:23:17,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:17,592 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523449874] [2025-04-26 16:23:17,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:17,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:17,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:23:17,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:23:17,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:17,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:17,599 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:17,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:23:17,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:23:17,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:17,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:17,609 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:17,747 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:17,748 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:17,748 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:17,748 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:17,748 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:17,748 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:17,748 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:17,748 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:17,748 INFO L132 ssoRankerPreferences]: Filename of dumped script: inc-subseq-array.wvr.bpl_petrified1_Iteration5_Lasso [2025-04-26 16:23:17,748 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:17,748 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:17,750 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:17,752 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:17,758 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:17,760 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:17,803 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:17,805 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:17,960 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:17,961 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:17,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:17,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:17,964 INFO L229 MonitoredProcess]: Starting monitored process 12 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:23:17,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 16:23:17,967 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:23:17,978 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:17,979 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:17,979 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:17,979 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:17,980 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:17,980 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:17,983 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:17,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:17,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:17,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:17,994 INFO L229 MonitoredProcess]: Starting monitored process 13 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:23:17,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 16:23:17,998 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:23:18,008 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:18,008 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:18,008 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:18,008 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:18,009 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:18,009 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:18,012 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:18,017 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 16:23:18,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:18,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:18,020 INFO L229 MonitoredProcess]: Starting monitored process 14 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:23:18,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 16:23:18,022 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:23:18,032 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:18,032 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:18,032 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:18,032 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:18,033 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:18,033 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:18,035 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:18,041 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:18,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:18,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:18,043 INFO L229 MonitoredProcess]: Starting monitored process 15 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:23:18,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 16:23:18,044 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:23:18,054 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:18,054 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:18,054 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:18,054 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:18,056 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:18,056 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:18,060 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:18,070 INFO L436 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-04-26 16:23:18,071 INFO L437 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-04-26 16:23:18,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:18,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:18,072 INFO L229 MonitoredProcess]: Starting monitored process 16 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:23:18,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 16:23:18,075 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:18,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:18,091 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:23:18,091 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:18,092 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(start, end) = -1*start + 1*end Supporting invariants [] [2025-04-26 16:23:18,097 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-04-26 16:23:18,098 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:23:18,108 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:18,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:23:18,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:23:18,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:18,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:18,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:18,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:18,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:18,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:18,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:18,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:18,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:18,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:18,147 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:23:18,147 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:23:18,147 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 161 states and 381 transitions. cyclomatic complexity: 239 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (in total 14), 4 states have internal predecessors, (14), 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:23:18,170 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 161 states and 381 transitions. cyclomatic complexity: 239. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (in total 14), 4 states have internal predecessors, (14), 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 484 states and 1154 transitions. Complement of second has 5 states. [2025-04-26 16:23:18,171 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:23:18,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (in total 14), 4 states have internal predecessors, (14), 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:23:18,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2025-04-26 16:23:18,172 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 38 transitions. Stem has 10 letters. Loop has 4 letters. [2025-04-26 16:23:18,172 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:18,172 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 38 transitions. Stem has 14 letters. Loop has 4 letters. [2025-04-26 16:23:18,172 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:18,172 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 38 transitions. Stem has 10 letters. Loop has 8 letters. [2025-04-26 16:23:18,172 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:18,172 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 484 states and 1154 transitions. [2025-04-26 16:23:18,179 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 36 [2025-04-26 16:23:18,183 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 484 states to 350 states and 812 transitions. [2025-04-26 16:23:18,183 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 107 [2025-04-26 16:23:18,185 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 114 [2025-04-26 16:23:18,185 INFO L74 IsDeterministic]: Start isDeterministic. Operand 350 states and 812 transitions. [2025-04-26 16:23:18,185 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:18,185 INFO L218 hiAutomatonCegarLoop]: Abstraction has 350 states and 812 transitions. [2025-04-26 16:23:18,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states and 812 transitions. [2025-04-26 16:23:18,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 182. [2025-04-26 16:23:18,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 182 states have (on average 2.32967032967033) internal successors, (in total 424), 181 states have internal predecessors, (424), 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:23:18,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 424 transitions. [2025-04-26 16:23:18,197 INFO L240 hiAutomatonCegarLoop]: Abstraction has 182 states and 424 transitions. [2025-04-26 16:23:18,197 INFO L438 stractBuchiCegarLoop]: Abstraction has 182 states and 424 transitions. [2025-04-26 16:23:18,197 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 16:23:18,197 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 182 states and 424 transitions. [2025-04-26 16:23:18,201 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 36 [2025-04-26 16:23:18,201 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:18,201 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:18,201 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:18,201 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:23:18,202 INFO L752 eck$LassoCheckResult]: Stem: "[63] $Ultimate##0-->L54: Formula: (= v_end_7 v_start_7) InVars {end=v_end_7, start=v_start_7} OutVars{end=v_end_7, start=v_start_7} AuxVars[] AssignedVars[]" "[42] L54-->L55: Formula: (and (= v_v_old_3 v_last_4) (= (select v_A_5 0) v_v_old_3)) InVars {A=v_A_5, last=v_last_4, v_old=v_v_old_3} OutVars{A=v_A_5, last=v_last_4, v_old=v_v_old_3} AuxVars[] AssignedVars[]" "[55] L55-->L56: Formula: (= v_i_11 0) InVars {i=v_i_11} OutVars{i=v_i_11} AuxVars[] AssignedVars[]" "[46] L56-->L57: Formula: v_ok_4 InVars {ok=v_ok_4} OutVars{ok=v_ok_4} AuxVars[] AssignedVars[]" "[87] L57-->L23: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[84] L57-1-->L39: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0]" "[69] L23-->L24: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[71] L24-->L25: Formula: (<= v_last_1 (select v_A_1 v_i_2)) InVars {A=v_A_1, last=v_last_1, i=v_i_2} OutVars{A=v_A_1, last=v_last_1, i=v_i_2} AuxVars[] AssignedVars[]" "[73] L25-->L25-1: Formula: (and (= (select v_A_6 v_i_12) (select v_queue_3 v_end_9)) (= (+ v_end_9 1) v_end_8)) InVars {A=v_A_6, i=v_i_12, end=v_end_9, queue=v_queue_3} OutVars{A=v_A_6, i=v_i_12, end=v_end_8, queue=v_queue_3} AuxVars[] AssignedVars[end]" "[77] L39-->L40: Formula: (or (< v_start_1 v_end_4) (< v_i_9 v_N_3)) InVars {i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} OutVars{i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} AuxVars[] AssignedVars[]" [2025-04-26 16:23:18,202 INFO L754 eck$LassoCheckResult]: Loop: "[79] L40-->L40-1: Formula: (and (< v_start_13 v_end_12) (= v_start_12 (+ v_start_13 1)) (= (select v_queue_7 v_start_13) v_new_6)) InVars {queue=v_queue_7, end=v_end_12, start=v_start_13} OutVars{end=v_end_12, start=v_start_12, new=v_new_6, queue=v_queue_7} AuxVars[] AssignedVars[start, new]" "[80] L40-1-->L46: Formula: (or (and (<= v_v_old_1 v_new_2) v_ok_2 v_ok_1) (and (or (not v_ok_2) (< v_new_2 v_v_old_1)) (not v_ok_1))) InVars {ok=v_ok_2, v_old=v_v_old_1, new=v_new_2} OutVars{ok=v_ok_1, v_old=v_v_old_1, new=v_new_2} AuxVars[] AssignedVars[ok]" "[81] L46-->L39: Formula: (= v_v_old_2 v_new_3) InVars {new=v_new_3} OutVars{v_old=v_v_old_2, new=v_new_3} AuxVars[] AssignedVars[v_old]" "[77] L39-->L40: Formula: (or (< v_start_1 v_end_4) (< v_i_9 v_N_3)) InVars {i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} OutVars{i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} AuxVars[] AssignedVars[]" [2025-04-26 16:23:18,203 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:18,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1915145926, now seen corresponding path program 1 times [2025-04-26 16:23:18,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:18,203 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759530340] [2025-04-26 16:23:18,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:18,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:18,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:23:18,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:23:18,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:18,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:18,209 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:18,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:23:18,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:23:18,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:18,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:18,213 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:18,213 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:18,213 INFO L85 PathProgramCache]: Analyzing trace with hash 3356478, now seen corresponding path program 4 times [2025-04-26 16:23:18,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:18,214 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635399094] [2025-04-26 16:23:18,214 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:23:18,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:18,216 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 4 statements into 2 equivalence classes. [2025-04-26 16:23:18,217 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:18,217 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 16:23:18,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:18,217 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:18,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:18,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:18,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:18,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:18,220 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:18,220 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:18,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1360731011, now seen corresponding path program 2 times [2025-04-26 16:23:18,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:18,220 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657289389] [2025-04-26 16:23:18,220 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:23:18,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:18,222 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-26 16:23:18,226 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:23:18,226 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:23:18,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:18,226 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:18,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:23:18,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:23:18,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:18,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:18,233 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:18,372 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:18,372 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:18,372 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:18,372 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:18,372 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:18,372 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:18,372 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:18,372 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:18,372 INFO L132 ssoRankerPreferences]: Filename of dumped script: inc-subseq-array.wvr.bpl_petrified1_Iteration6_Lasso [2025-04-26 16:23:18,372 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:18,372 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:18,374 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:18,377 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:18,379 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:18,381 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:18,595 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:18,595 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:18,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:18,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:18,600 INFO L229 MonitoredProcess]: Starting monitored process 17 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:23:18,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 16:23:18,604 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:23:18,614 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:18,614 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:18,614 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:18,614 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:18,615 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:18,615 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:18,618 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:18,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-04-26 16:23:18,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:18,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:18,628 INFO L229 MonitoredProcess]: Starting monitored process 18 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:23:18,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 16:23:18,630 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:23:18,639 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:18,639 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:18,640 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:18,640 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:18,641 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:18,641 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:18,643 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:18,649 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-04-26 16:23:18,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:18,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:18,651 INFO L229 MonitoredProcess]: Starting monitored process 19 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:23:18,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-04-26 16:23:18,654 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:23:18,663 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:18,664 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:18,664 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:18,664 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:18,665 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:18,665 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:18,667 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:18,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-04-26 16:23:18,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:18,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:18,675 INFO L229 MonitoredProcess]: Starting monitored process 20 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:23:18,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-04-26 16:23:18,678 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:23:18,687 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:18,687 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:18,688 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:23:18,688 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:18,693 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2025-04-26 16:23:18,693 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:23:18,718 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:18,734 INFO L436 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-04-26 16:23:18,734 INFO L437 ModelExtractionUtils]: 14 out of 26 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-04-26 16:23:18,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:18,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:18,736 INFO L229 MonitoredProcess]: Starting monitored process 21 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:23:18,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-04-26 16:23:18,737 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:18,753 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-04-26 16:23:18,754 INFO L439 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2025-04-26 16:23:18,754 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:18,754 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(start, end) = -1*start + 1*end Supporting invariants [] [2025-04-26 16:23:18,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:18,761 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:23:18,774 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:18,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:23:18,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:23:18,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:18,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:18,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:18,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:18,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:18,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:18,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:18,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:18,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:18,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:18,816 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:23:18,816 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:23:18,817 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 182 states and 424 transitions. cyclomatic complexity: 265 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (in total 14), 3 states have internal predecessors, (14), 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:23:18,843 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 182 states and 424 transitions. cyclomatic complexity: 265. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (in total 14), 3 states have internal predecessors, (14), 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 573 states and 1311 transitions. Complement of second has 5 states. [2025-04-26 16:23:18,845 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:23:18,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (in total 14), 3 states have internal predecessors, (14), 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:23:18,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2025-04-26 16:23:18,845 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 38 transitions. Stem has 10 letters. Loop has 4 letters. [2025-04-26 16:23:18,846 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:18,846 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 38 transitions. Stem has 14 letters. Loop has 4 letters. [2025-04-26 16:23:18,846 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:18,846 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 38 transitions. Stem has 10 letters. Loop has 8 letters. [2025-04-26 16:23:18,846 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:18,846 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 573 states and 1311 transitions. [2025-04-26 16:23:18,852 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 36 [2025-04-26 16:23:18,855 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 573 states to 404 states and 918 transitions. [2025-04-26 16:23:18,855 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 115 [2025-04-26 16:23:18,857 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 127 [2025-04-26 16:23:18,857 INFO L74 IsDeterministic]: Start isDeterministic. Operand 404 states and 918 transitions. [2025-04-26 16:23:18,857 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:18,857 INFO L218 hiAutomatonCegarLoop]: Abstraction has 404 states and 918 transitions. [2025-04-26 16:23:18,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states and 918 transitions. [2025-04-26 16:23:18,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 204. [2025-04-26 16:23:18,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 204 states have (on average 2.343137254901961) internal successors, (in total 478), 203 states have internal predecessors, (478), 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:23:18,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 478 transitions. [2025-04-26 16:23:18,868 INFO L240 hiAutomatonCegarLoop]: Abstraction has 204 states and 478 transitions. [2025-04-26 16:23:18,868 INFO L438 stractBuchiCegarLoop]: Abstraction has 204 states and 478 transitions. [2025-04-26 16:23:18,868 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 16:23:18,868 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 204 states and 478 transitions. [2025-04-26 16:23:18,869 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 36 [2025-04-26 16:23:18,869 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:18,869 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:18,869 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:18,869 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:23:18,870 INFO L752 eck$LassoCheckResult]: Stem: "[63] $Ultimate##0-->L54: Formula: (= v_end_7 v_start_7) InVars {end=v_end_7, start=v_start_7} OutVars{end=v_end_7, start=v_start_7} AuxVars[] AssignedVars[]" "[42] L54-->L55: Formula: (and (= v_v_old_3 v_last_4) (= (select v_A_5 0) v_v_old_3)) InVars {A=v_A_5, last=v_last_4, v_old=v_v_old_3} OutVars{A=v_A_5, last=v_last_4, v_old=v_v_old_3} AuxVars[] AssignedVars[]" "[55] L55-->L56: Formula: (= v_i_11 0) InVars {i=v_i_11} OutVars{i=v_i_11} AuxVars[] AssignedVars[]" "[46] L56-->L57: Formula: v_ok_4 InVars {ok=v_ok_4} OutVars{ok=v_ok_4} AuxVars[] AssignedVars[]" "[87] L57-->L23: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[84] L57-1-->L39: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0]" "[69] L23-->L24: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[71] L24-->L25: Formula: (<= v_last_1 (select v_A_1 v_i_2)) InVars {A=v_A_1, last=v_last_1, i=v_i_2} OutVars{A=v_A_1, last=v_last_1, i=v_i_2} AuxVars[] AssignedVars[]" "[77] L39-->L40: Formula: (or (< v_start_1 v_end_4) (< v_i_9 v_N_3)) InVars {i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} OutVars{i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} AuxVars[] AssignedVars[]" "[73] L25-->L25-1: Formula: (and (= (select v_A_6 v_i_12) (select v_queue_3 v_end_9)) (= (+ v_end_9 1) v_end_8)) InVars {A=v_A_6, i=v_i_12, end=v_end_9, queue=v_queue_3} OutVars{A=v_A_6, i=v_i_12, end=v_end_8, queue=v_queue_3} AuxVars[] AssignedVars[end]" "[79] L40-->L40-1: Formula: (and (< v_start_13 v_end_12) (= v_start_12 (+ v_start_13 1)) (= (select v_queue_7 v_start_13) v_new_6)) InVars {queue=v_queue_7, end=v_end_12, start=v_start_13} OutVars{end=v_end_12, start=v_start_12, new=v_new_6, queue=v_queue_7} AuxVars[] AssignedVars[start, new]" [2025-04-26 16:23:18,870 INFO L754 eck$LassoCheckResult]: Loop: "[80] L40-1-->L46: Formula: (or (and (<= v_v_old_1 v_new_2) v_ok_2 v_ok_1) (and (or (not v_ok_2) (< v_new_2 v_v_old_1)) (not v_ok_1))) InVars {ok=v_ok_2, v_old=v_v_old_1, new=v_new_2} OutVars{ok=v_ok_1, v_old=v_v_old_1, new=v_new_2} AuxVars[] AssignedVars[ok]" "[81] L46-->L39: Formula: (= v_v_old_2 v_new_3) InVars {new=v_new_3} OutVars{v_old=v_v_old_2, new=v_new_3} AuxVars[] AssignedVars[v_old]" "[77] L39-->L40: Formula: (or (< v_start_1 v_end_4) (< v_i_9 v_N_3)) InVars {i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} OutVars{i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} AuxVars[] AssignedVars[]" "[79] L40-->L40-1: Formula: (and (< v_start_13 v_end_12) (= v_start_12 (+ v_start_13 1)) (= (select v_queue_7 v_start_13) v_new_6)) InVars {queue=v_queue_7, end=v_end_12, start=v_start_13} OutVars{end=v_end_12, start=v_start_12, new=v_new_6, queue=v_queue_7} AuxVars[] AssignedVars[start, new]" [2025-04-26 16:23:18,870 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:18,870 INFO L85 PathProgramCache]: Analyzing trace with hash -760014639, now seen corresponding path program 1 times [2025-04-26 16:23:18,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:18,870 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030826393] [2025-04-26 16:23:18,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:18,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:18,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:23:18,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:23:18,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:18,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:18,875 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:18,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:23:18,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:23:18,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:18,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:18,879 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:18,880 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:18,880 INFO L85 PathProgramCache]: Analyzing trace with hash 3387108, now seen corresponding path program 5 times [2025-04-26 16:23:18,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:18,880 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536982037] [2025-04-26 16:23:18,880 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-26 16:23:18,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:18,882 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:18,883 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:18,883 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:23:18,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:18,883 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:18,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:18,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:18,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:18,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:18,886 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:18,886 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:18,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1626480716, now seen corresponding path program 3 times [2025-04-26 16:23:18,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:18,886 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543247502] [2025-04-26 16:23:18,886 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:23:18,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:18,888 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 2 equivalence classes. [2025-04-26 16:23:18,894 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:23:18,894 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-26 16:23:18,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:18,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:23:18,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:23:18,937 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543247502] [2025-04-26 16:23:18,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543247502] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:23:18,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:23:18,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 16:23:18,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612356735] [2025-04-26 16:23:18,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:23:19,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:23:19,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 16:23:19,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-26 16:23:19,003 INFO L87 Difference]: Start difference. First operand 204 states and 478 transitions. cyclomatic complexity: 299 Second operand has 5 states, 4 states have (on average 3.75) internal successors, (in total 15), 4 states have internal predecessors, (15), 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:23:19,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:23:19,028 INFO L93 Difference]: Finished difference Result 423 states and 956 transitions. [2025-04-26 16:23:19,028 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 423 states and 956 transitions. [2025-04-26 16:23:19,031 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 32 [2025-04-26 16:23:19,033 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 423 states to 309 states and 704 transitions. [2025-04-26 16:23:19,034 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 85 [2025-04-26 16:23:19,034 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 85 [2025-04-26 16:23:19,034 INFO L74 IsDeterministic]: Start isDeterministic. Operand 309 states and 704 transitions. [2025-04-26 16:23:19,034 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:19,034 INFO L218 hiAutomatonCegarLoop]: Abstraction has 309 states and 704 transitions. [2025-04-26 16:23:19,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states and 704 transitions. [2025-04-26 16:23:19,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 249. [2025-04-26 16:23:19,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 249 states have (on average 2.3453815261044175) internal successors, (in total 584), 248 states have internal predecessors, (584), 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:23:19,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 584 transitions. [2025-04-26 16:23:19,043 INFO L240 hiAutomatonCegarLoop]: Abstraction has 249 states and 584 transitions. [2025-04-26 16:23:19,045 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 16:23:19,046 INFO L438 stractBuchiCegarLoop]: Abstraction has 249 states and 584 transitions. [2025-04-26 16:23:19,046 INFO L340 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-04-26 16:23:19,046 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 249 states and 584 transitions. [2025-04-26 16:23:19,047 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 32 [2025-04-26 16:23:19,047 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:19,047 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:19,047 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:19,047 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:23:19,048 INFO L752 eck$LassoCheckResult]: Stem: "[63] $Ultimate##0-->L54: Formula: (= v_end_7 v_start_7) InVars {end=v_end_7, start=v_start_7} OutVars{end=v_end_7, start=v_start_7} AuxVars[] AssignedVars[]" "[42] L54-->L55: Formula: (and (= v_v_old_3 v_last_4) (= (select v_A_5 0) v_v_old_3)) InVars {A=v_A_5, last=v_last_4, v_old=v_v_old_3} OutVars{A=v_A_5, last=v_last_4, v_old=v_v_old_3} AuxVars[] AssignedVars[]" "[55] L55-->L56: Formula: (= v_i_11 0) InVars {i=v_i_11} OutVars{i=v_i_11} AuxVars[] AssignedVars[]" "[46] L56-->L57: Formula: v_ok_4 InVars {ok=v_ok_4} OutVars{ok=v_ok_4} AuxVars[] AssignedVars[]" "[87] L57-->L23: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[84] L57-1-->L39: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0]" "[69] L23-->L24: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[71] L24-->L25: Formula: (<= v_last_1 (select v_A_1 v_i_2)) InVars {A=v_A_1, last=v_last_1, i=v_i_2} OutVars{A=v_A_1, last=v_last_1, i=v_i_2} AuxVars[] AssignedVars[]" "[73] L25-->L25-1: Formula: (and (= (select v_A_6 v_i_12) (select v_queue_3 v_end_9)) (= (+ v_end_9 1) v_end_8)) InVars {A=v_A_6, i=v_i_12, end=v_end_9, queue=v_queue_3} OutVars{A=v_A_6, i=v_i_12, end=v_end_8, queue=v_queue_3} AuxVars[] AssignedVars[end]" "[75] L25-1-->L24-2: Formula: (= (select v_A_3 v_i_4) v_last_2) InVars {A=v_A_3, i=v_i_4} OutVars{A=v_A_3, last=v_last_2, i=v_i_4} AuxVars[] AssignedVars[last]" "[74] L24-2-->L23: Formula: (= v_i_6 (+ v_i_7 1)) InVars {i=v_i_7} OutVars{i=v_i_6} AuxVars[] AssignedVars[i]" "[69] L23-->L24: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[71] L24-->L25: Formula: (<= v_last_1 (select v_A_1 v_i_2)) InVars {A=v_A_1, last=v_last_1, i=v_i_2} OutVars{A=v_A_1, last=v_last_1, i=v_i_2} AuxVars[] AssignedVars[]" "[77] L39-->L40: Formula: (or (< v_start_1 v_end_4) (< v_i_9 v_N_3)) InVars {i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} OutVars{i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} AuxVars[] AssignedVars[]" "[73] L25-->L25-1: Formula: (and (= (select v_A_6 v_i_12) (select v_queue_3 v_end_9)) (= (+ v_end_9 1) v_end_8)) InVars {A=v_A_6, i=v_i_12, end=v_end_9, queue=v_queue_3} OutVars{A=v_A_6, i=v_i_12, end=v_end_8, queue=v_queue_3} AuxVars[] AssignedVars[end]" [2025-04-26 16:23:19,048 INFO L754 eck$LassoCheckResult]: Loop: "[79] L40-->L40-1: Formula: (and (< v_start_13 v_end_12) (= v_start_12 (+ v_start_13 1)) (= (select v_queue_7 v_start_13) v_new_6)) InVars {queue=v_queue_7, end=v_end_12, start=v_start_13} OutVars{end=v_end_12, start=v_start_12, new=v_new_6, queue=v_queue_7} AuxVars[] AssignedVars[start, new]" "[80] L40-1-->L46: Formula: (or (and (<= v_v_old_1 v_new_2) v_ok_2 v_ok_1) (and (or (not v_ok_2) (< v_new_2 v_v_old_1)) (not v_ok_1))) InVars {ok=v_ok_2, v_old=v_v_old_1, new=v_new_2} OutVars{ok=v_ok_1, v_old=v_v_old_1, new=v_new_2} AuxVars[] AssignedVars[ok]" "[81] L46-->L39: Formula: (= v_v_old_2 v_new_3) InVars {new=v_new_3} OutVars{v_old=v_v_old_2, new=v_new_3} AuxVars[] AssignedVars[v_old]" "[77] L39-->L40: Formula: (or (< v_start_1 v_end_4) (< v_i_9 v_N_3)) InVars {i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} OutVars{i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} AuxVars[] AssignedVars[]" [2025-04-26 16:23:19,048 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:19,048 INFO L85 PathProgramCache]: Analyzing trace with hash -829224764, now seen corresponding path program 1 times [2025-04-26 16:23:19,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:19,048 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678673843] [2025-04-26 16:23:19,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:19,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:19,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:23:19,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:23:19,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:19,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:19,058 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:19,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:23:19,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:23:19,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:19,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:19,066 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:19,067 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:19,067 INFO L85 PathProgramCache]: Analyzing trace with hash 3356478, now seen corresponding path program 6 times [2025-04-26 16:23:19,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:19,067 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009128472] [2025-04-26 16:23:19,067 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-26 16:23:19,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:19,071 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:19,073 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:19,073 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-26 16:23:19,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:19,073 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:19,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:19,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:19,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:19,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:19,076 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:19,076 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:19,076 INFO L85 PathProgramCache]: Analyzing trace with hash -927062399, now seen corresponding path program 1 times [2025-04-26 16:23:19,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:19,076 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564706480] [2025-04-26 16:23:19,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:19,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:19,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 16:23:19,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 16:23:19,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:19,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:19,087 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:19,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 16:23:19,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 16:23:19,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:19,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:19,096 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:19,272 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:19,272 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:19,272 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:19,272 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:19,272 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:19,272 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:19,272 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:19,272 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:19,272 INFO L132 ssoRankerPreferences]: Filename of dumped script: inc-subseq-array.wvr.bpl_petrified1_Iteration8_Lasso [2025-04-26 16:23:19,272 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:19,272 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:19,275 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:19,277 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:19,347 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:19,349 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:19,515 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:19,516 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:19,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:19,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:19,517 INFO L229 MonitoredProcess]: Starting monitored process 22 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:23:19,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-04-26 16:23:19,520 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:23:19,530 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:19,531 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:19,531 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:19,531 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:19,532 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:19,532 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:19,534 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:19,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-04-26 16:23:19,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:19,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:19,541 INFO L229 MonitoredProcess]: Starting monitored process 23 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:23:19,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-04-26 16:23:19,546 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:23:19,556 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:19,556 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:19,556 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:23:19,556 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:19,561 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2025-04-26 16:23:19,561 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:23:19,576 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:19,594 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 16:23:19,594 INFO L437 ModelExtractionUtils]: 13 out of 26 variables were initially zero. Simplification set additionally 10 variables to zero. [2025-04-26 16:23:19,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:19,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:19,597 INFO L229 MonitoredProcess]: Starting monitored process 24 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:23:19,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-04-26 16:23:19,599 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:19,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:19,615 INFO L439 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2025-04-26 16:23:19,615 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:19,615 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(end, start) = 1*end - 1*start Supporting invariants [] [2025-04-26 16:23:19,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:19,622 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:23:19,630 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:19,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:23:19,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:23:19,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:19,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:19,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:19,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:19,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:19,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:19,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:19,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:19,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:19,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:19,677 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:23:19,677 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:23:19,678 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 249 states and 584 transitions. cyclomatic complexity: 361 Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (in total 17), 3 states have internal predecessors, (17), 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:23:19,695 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 249 states and 584 transitions. cyclomatic complexity: 361. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (in total 17), 3 states have internal predecessors, (17), 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 403 states and 908 transitions. Complement of second has 5 states. [2025-04-26 16:23:19,696 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:23:19,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (in total 17), 3 states have internal predecessors, (17), 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:23:19,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2025-04-26 16:23:19,697 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 29 transitions. Stem has 15 letters. Loop has 4 letters. [2025-04-26 16:23:19,697 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:19,697 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:23:19,707 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:19,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:23:19,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:23:19,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:19,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:19,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:19,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:19,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:19,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:19,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:19,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:19,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:19,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:19,750 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:23:19,750 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:23:19,751 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 249 states and 584 transitions. cyclomatic complexity: 361 Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (in total 17), 3 states have internal predecessors, (17), 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:23:19,777 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 249 states and 584 transitions. cyclomatic complexity: 361. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (in total 17), 3 states have internal predecessors, (17), 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 483 states and 1086 transitions. Complement of second has 7 states. [2025-04-26 16:23:19,780 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:23:19,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (in total 17), 3 states have internal predecessors, (17), 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:23:19,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2025-04-26 16:23:19,781 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 37 transitions. Stem has 15 letters. Loop has 4 letters. [2025-04-26 16:23:19,781 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:19,781 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:23:19,796 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:19,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:23:19,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:23:19,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:19,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:19,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:19,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:19,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:19,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:19,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:19,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:19,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:19,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:19,838 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:23:19,839 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:23:19,839 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 249 states and 584 transitions. cyclomatic complexity: 361 Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (in total 17), 3 states have internal predecessors, (17), 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:23:19,859 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 249 states and 584 transitions. cyclomatic complexity: 361. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (in total 17), 3 states have internal predecessors, (17), 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 588 states and 1370 transitions. Complement of second has 5 states. [2025-04-26 16:23:19,860 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:23:19,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (in total 17), 3 states have internal predecessors, (17), 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:23:19,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2025-04-26 16:23:19,860 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 46 transitions. Stem has 15 letters. Loop has 4 letters. [2025-04-26 16:23:19,860 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:19,860 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 46 transitions. Stem has 19 letters. Loop has 4 letters. [2025-04-26 16:23:19,860 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:19,860 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 46 transitions. Stem has 15 letters. Loop has 8 letters. [2025-04-26 16:23:19,861 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:19,861 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 588 states and 1370 transitions. [2025-04-26 16:23:19,865 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:23:19,866 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 588 states to 0 states and 0 transitions. [2025-04-26 16:23:19,866 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:23:19,866 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:23:19,866 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:23:19,866 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:23:19,866 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:23:19,866 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:23:19,866 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:23:19,866 INFO L340 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-04-26 16:23:19,866 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:23:19,866 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:23:19,866 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:23:19,871 INFO L201 PluginConnector]: Adding new model inc-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:23:19 BoogieIcfgContainer [2025-04-26 16:23:19,871 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:23:19,871 INFO L158 Benchmark]: Toolchain (without parser) took 4773.17ms. Allocated memory was 155.2MB in the beginning and 142.6MB in the end (delta: -12.6MB). Free memory was 86.5MB in the beginning and 61.9MB in the end (delta: 24.6MB). Peak memory consumption was 16.4MB. Max. memory is 8.0GB. [2025-04-26 16:23:19,872 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.19ms. Allocated memory is still 155.2MB. Free memory is still 87.5MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:23:19,872 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.66ms. Allocated memory is still 155.2MB. Free memory was 86.5MB in the beginning and 83.9MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:23:19,872 INFO L158 Benchmark]: Boogie Preprocessor took 26.00ms. Allocated memory is still 155.2MB. Free memory was 83.9MB in the beginning and 82.9MB in the end (delta: 996.4kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:23:19,872 INFO L158 Benchmark]: RCFGBuilder took 180.03ms. Allocated memory is still 155.2MB. Free memory was 82.9MB in the beginning and 73.1MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:23:19,872 INFO L158 Benchmark]: BuchiAutomizer took 4524.90ms. Allocated memory was 155.2MB in the beginning and 142.6MB in the end (delta: -12.6MB). Free memory was 72.9MB in the beginning and 61.9MB in the end (delta: 11.0MB). Peak memory consumption was 3.9MB. Max. memory is 8.0GB. [2025-04-26 16:23:19,873 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.19ms. Allocated memory is still 155.2MB. Free memory is still 87.5MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.66ms. Allocated memory is still 155.2MB. Free memory was 86.5MB in the beginning and 83.9MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 26.00ms. Allocated memory is still 155.2MB. Free memory was 83.9MB in the beginning and 82.9MB in the end (delta: 996.4kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 180.03ms. Allocated memory is still 155.2MB. Free memory was 82.9MB in the beginning and 73.1MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 4524.90ms. Allocated memory was 155.2MB in the beginning and 142.6MB in the end (delta: -12.6MB). Free memory was 72.9MB in the beginning and 61.9MB in the end (delta: 11.0MB). Peak memory consumption was 3.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.4s and 9 iterations. TraceHistogramMax:2. Analysis of lassos took 3.3s. Construction of modules took 0.1s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 5. Automata minimization 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 549 StatesRemovedByMinimization, 7 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 [4, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 288 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 281 mSDsluCounter, 295 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 120 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 194 IncrementalHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 175 mSDtfsCounter, 194 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN0 SILU0 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital81 mio100 ax100 hnf100 lsp96 ukn80 mio100 lsp58 div100 bol117 ite100 ukn100 eq163 hnf90 smp100 dnf199 smp67 tf100 neg100 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 76ms VariablesStem: 6 VariablesLoop: 6 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 8 terminating modules (3 trivial, 4 deterministic, 1 nondeterministic). One deterministic module has affine ranking function N + -1 * i and consists of 4 locations. One deterministic module has affine ranking function end + -1 * start and consists of 3 locations. One deterministic module has affine ranking function end + -1 * start and consists of 3 locations. One deterministic module has affine ranking function end + -1 * start and consists of 3 locations. One nondeterministic module has affine ranking function end + -1 * start and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:23:19,884 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...