/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/gemcutter/Termination.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i /storage/cav23-termute-examples/2_thr/adfg_2_seq_1.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:56:24,798 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:56:24,850 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:56:24,855 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:56:24,856 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:56:24,856 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:56:24,856 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:56:24,875 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:56:24,877 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:56:24,877 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:56:24,878 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:56:24,878 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:56:24,878 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:56:24,878 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:56:24,879 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:56:24,879 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:56:24,879 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:56:24,879 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:56:24,879 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:56:24,879 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:56:24,879 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:56:24,879 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:56:24,879 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:56:24,879 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:56:24,879 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:56:24,879 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:56:24,879 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:56:24,879 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:56:24,879 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:56:24,879 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:56:24,879 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:56:24,879 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:56:24,879 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:56:24,880 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:56:24,880 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:56:24,880 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:56:24,880 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:56:24,880 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:56:24,880 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:56:24,880 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:56:24,880 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:56:24,880 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:56:24,880 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:56:25,090 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:56:25,099 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:56:25,100 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:56:25,101 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:56:25,103 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:56:25,104 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/2_thr/adfg_2_seq_1.c.bpl [2025-04-26 16:56:25,106 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/2_thr/adfg_2_seq_1.c.bpl' [2025-04-26 16:56:25,121 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:56:25,125 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:56:25,126 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:56:25,126 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:56:25,126 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:56:25,133 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "adfg_2_seq_1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:25" (1/1) ... [2025-04-26 16:56:25,156 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "adfg_2_seq_1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:25" (1/1) ... [2025-04-26 16:56:25,162 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:56:25,163 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:56:25,163 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:56:25,163 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:56:25,163 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:56:25,169 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "adfg_2_seq_1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:25" (1/1) ... [2025-04-26 16:56:25,169 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "adfg_2_seq_1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:25" (1/1) ... [2025-04-26 16:56:25,171 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "adfg_2_seq_1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:25" (1/1) ... [2025-04-26 16:56:25,172 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "adfg_2_seq_1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:25" (1/1) ... [2025-04-26 16:56:25,175 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "adfg_2_seq_1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:25" (1/1) ... [2025-04-26 16:56:25,176 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "adfg_2_seq_1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:25" (1/1) ... [2025-04-26 16:56:25,180 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "adfg_2_seq_1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:25" (1/1) ... [2025-04-26 16:56:25,180 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "adfg_2_seq_1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:25" (1/1) ... [2025-04-26 16:56:25,181 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "adfg_2_seq_1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:25" (1/1) ... [2025-04-26 16:56:25,189 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:56:25,191 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:56:25,192 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:56:25,192 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:56:25,192 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "adfg_2_seq_1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:25" (1/1) ... [2025-04-26 16:56:25,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:56:25,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:25,217 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:25,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 16:56:25,236 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:56:25,236 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:56:25,236 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:56:25,236 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:56:25,236 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:56:25,236 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:56:25,236 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:56:25,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:56:25,237 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:56:25,237 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:56:25,273 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:56:25,275 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:56:25,345 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:56:25,346 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:56:25,352 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:56:25,352 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:56:25,353 INFO L201 PluginConnector]: Adding new model adfg_2_seq_1.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:56:25 BoogieIcfgContainer [2025-04-26 16:56:25,353 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:56:25,353 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:56:25,353 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:56:25,357 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:56:25,357 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:56:25,357 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "adfg_2_seq_1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:25" (1/2) ... [2025-04-26 16:56:25,358 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@77098cf7 and model type adfg_2_seq_1.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:56:25, skipping insertion in model container [2025-04-26 16:56:25,358 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:56:25,358 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "adfg_2_seq_1.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:56:25" (2/2) ... [2025-04-26 16:56:25,359 INFO L376 chiAutomizerObserver]: Analyzing ICFG adfg_2_seq_1.c.bpl [2025-04-26 16:56:25,402 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 16:56:25,437 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:56:25,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:56:25,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:25,441 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:25,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 16:56:25,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 44 transitions, 102 flow [2025-04-26 16:56:25,509 INFO L116 PetriNetUnfolderBase]: 10/40 cut-off events. [2025-04-26 16:56:25,511 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 16:56:25,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 40 events. 10/40 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 84 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 38. Up to 4 conditions per place. [2025-04-26 16:56:25,514 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 44 transitions, 102 flow [2025-04-26 16:56:25,517 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 40 transitions, 92 flow [2025-04-26 16:56:25,517 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 37 places, 40 transitions, 92 flow [2025-04-26 16:56:25,522 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:56:25,705 WARN L140 AmpleReduction]: Number of pruned transitions: 120 [2025-04-26 16:56:25,705 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 16:56:25,705 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 48 [2025-04-26 16:56:25,705 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:35 [2025-04-26 16:56:25,705 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:96 [2025-04-26 16:56:25,706 WARN L145 AmpleReduction]: Times succ was already a loop node:41 [2025-04-26 16:56:25,706 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:58 [2025-04-26 16:56:25,706 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:56:25,708 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 180 states, 179 states have (on average 1.8268156424581006) internal successors, (in total 327), 179 states have internal predecessors, (327), 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:56:25,715 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:56:25,715 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:56:25,715 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:56:25,715 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:56:25,715 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:56:25,716 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:56:25,716 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:56:25,716 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:56:25,717 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 180 states, 179 states have (on average 1.8268156424581006) internal successors, (in total 327), 179 states have internal predecessors, (327), 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:56:25,732 INFO L131 ngComponentsAnalysis]: Automaton has 29 accepting balls. 136 [2025-04-26 16:56:25,732 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:25,732 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:25,737 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:56:25,737 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:56:25,737 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:56:25,738 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 180 states, 179 states have (on average 1.8268156424581006) internal successors, (in total 327), 179 states have internal predecessors, (327), 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:56:25,742 INFO L131 ngComponentsAnalysis]: Automaton has 29 accepting balls. 136 [2025-04-26 16:56:25,742 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:25,742 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:25,743 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:56:25,743 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:56:25,747 INFO L752 eck$LassoCheckResult]: Stem: "[155] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[118] $Ultimate##0-->L27: Formula: (<= 1 v_b_1) InVars {b=v_b_1} OutVars{b=v_b_1} AuxVars[] AssignedVars[]" "[120] L27-->L35-2: Formula: (= v_t_1 1) InVars {} OutVars{t=v_t_1} AuxVars[] AssignedVars[t]" [2025-04-26 16:56:25,747 INFO L754 eck$LassoCheckResult]: Loop: "[123] L35-2-->L35: Formula: (<= v_x1_1 v_n_2) InVars {x1=v_x1_1, n=v_n_2} OutVars{x1=v_x1_1, n=v_n_2} AuxVars[] AssignedVars[]" "[125] L35-->L37: Formula: (<= 1 v_b_3) InVars {b=v_b_3} OutVars{b=v_b_3} AuxVars[] AssignedVars[]" "[129] L37-->L35-2: Formula: (= (+ v_x1_3 v_t_3) v_x1_2) InVars {x1=v_x1_3, t=v_t_3} OutVars{x1=v_x1_2, t=v_t_3} AuxVars[] AssignedVars[x1]" [2025-04-26 16:56:25,750 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:25,750 INFO L85 PathProgramCache]: Analyzing trace with hash 182524, now seen corresponding path program 1 times [2025-04-26 16:56:25,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:25,756 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277435672] [2025-04-26 16:56:25,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:25,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:25,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:25,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:25,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:25,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:25,810 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:25,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:25,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:25,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:25,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:25,824 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:25,827 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:25,827 INFO L85 PathProgramCache]: Analyzing trace with hash 151998, now seen corresponding path program 1 times [2025-04-26 16:56:25,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:25,827 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688212855] [2025-04-26 16:56:25,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:25,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:25,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:25,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:25,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:25,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:25,835 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:25,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:25,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:25,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:25,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:25,838 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:25,841 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:25,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1142727395, now seen corresponding path program 1 times [2025-04-26 16:56:25,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:25,842 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934233806] [2025-04-26 16:56:25,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:25,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:25,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:56:25,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:56:25,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:25,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:25,849 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:25,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:56:25,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:56:25,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:25,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:25,857 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:25,978 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:25,981 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:25,981 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:25,981 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:25,981 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:56:25,981 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:25,981 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:25,981 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:25,981 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_2_seq_1.c.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:56:25,981 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:25,982 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:25,997 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:26,006 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:26,013 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:26,085 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:26,086 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:56:26,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:26,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:26,089 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:56:26,091 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:56:26,092 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:26,092 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:26,114 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:56:26,115 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {b=1} Honda state: {b=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:56:26,122 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:56:26,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:26,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:26,124 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:56:26,127 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:56:26,128 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:26,128 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:26,141 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:56:26,141 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork0_thidvar0=0} Honda state: {thread1Thread1of1ForFork0_thidvar0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:56:26,148 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:56:26,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:26,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:26,150 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:56:26,153 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:56:26,154 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:26,154 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:26,173 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:56:26,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:26,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:26,175 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:56:26,176 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:56:26,180 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:56:26,181 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:26,328 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:56:26,334 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:56:26,334 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:26,334 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:26,335 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:26,335 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:26,335 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:26,335 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:26,335 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:26,335 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:26,335 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_2_seq_1.c.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:56:26,335 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:26,335 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:26,336 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:26,340 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:26,347 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:26,379 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:26,382 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:26,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:26,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:26,384 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:56:26,386 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:56:26,387 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:56:26,402 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:26,402 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:26,402 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:26,402 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:26,416 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:26,416 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:26,433 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:26,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 16:56:26,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:26,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:26,451 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:56:26,452 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:56:26,453 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:56:26,464 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:26,464 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:26,464 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:26,464 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:26,467 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:26,468 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:26,478 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:26,483 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:56:26,484 INFO L437 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:56:26,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:26,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:26,488 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:56:26,489 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:56:26,490 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:26,508 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:56:26,509 INFO L439 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-04-26 16:56:26,509 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:26,509 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(t, x1, n) = 1*t - 2*x1 + 2*n Supporting invariants [1*t - 1 >= 0] [2025-04-26 16:56:26,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:26,523 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:56:26,556 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:26,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:26,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:26,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:26,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:26,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-26 16:56:26,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:26,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:26,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:26,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:26,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:26,575 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:56:26,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:26,601 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:56:26,614 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:56:26,616 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 180 states, 179 states have (on average 1.8268156424581006) internal successors, (in total 327), 179 states have internal predecessors, (327), 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) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 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:56:26,742 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 180 states, 179 states have (on average 1.8268156424581006) internal successors, (in total 327), 179 states have internal predecessors, (327), 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). Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 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 679 states and 1237 transitions. Complement of second has 8 states. [2025-04-26 16:56:26,745 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 2 accepting loop states [2025-04-26 16:56:26,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 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:56:26,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions. [2025-04-26 16:56:26,755 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 90 transitions. Stem has 3 letters. Loop has 3 letters. [2025-04-26 16:56:26,755 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:26,756 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 90 transitions. Stem has 6 letters. Loop has 3 letters. [2025-04-26 16:56:26,756 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:26,756 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 90 transitions. Stem has 3 letters. Loop has 6 letters. [2025-04-26 16:56:26,756 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:26,756 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 679 states and 1237 transitions. [2025-04-26 16:56:26,768 INFO L131 ngComponentsAnalysis]: Automaton has 76 accepting balls. 348 [2025-04-26 16:56:26,774 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 679 states to 520 states and 945 transitions. [2025-04-26 16:56:26,774 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 450 [2025-04-26 16:56:26,775 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 482 [2025-04-26 16:56:26,776 INFO L74 IsDeterministic]: Start isDeterministic. Operand 520 states and 945 transitions. [2025-04-26 16:56:26,776 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:26,776 INFO L218 hiAutomatonCegarLoop]: Abstraction has 520 states and 945 transitions. [2025-04-26 16:56:26,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states and 945 transitions. [2025-04-26 16:56:26,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 237. [2025-04-26 16:56:26,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 237 states have (on average 1.8818565400843883) internal successors, (in total 446), 236 states have internal predecessors, (446), 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:56:26,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 446 transitions. [2025-04-26 16:56:26,811 INFO L240 hiAutomatonCegarLoop]: Abstraction has 237 states and 446 transitions. [2025-04-26 16:56:26,811 INFO L438 stractBuchiCegarLoop]: Abstraction has 237 states and 446 transitions. [2025-04-26 16:56:26,811 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:56:26,811 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 237 states and 446 transitions. [2025-04-26 16:56:26,812 INFO L131 ngComponentsAnalysis]: Automaton has 29 accepting balls. 136 [2025-04-26 16:56:26,812 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:26,812 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:26,812 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:56:26,812 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:56:26,813 INFO L752 eck$LassoCheckResult]: Stem: "[155] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[119] $Ultimate##0-->L31: Formula: (< v_b_2 1) InVars {b=v_b_2} OutVars{b=v_b_2} AuxVars[] AssignedVars[]" "[121] L31-->L35-2: Formula: (= (+ v_t_2 1) 0) InVars {} OutVars{t=v_t_2} AuxVars[] AssignedVars[t]" [2025-04-26 16:56:26,813 INFO L754 eck$LassoCheckResult]: Loop: "[123] L35-2-->L35: Formula: (<= v_x1_1 v_n_2) InVars {x1=v_x1_1, n=v_n_2} OutVars{x1=v_x1_1, n=v_n_2} AuxVars[] AssignedVars[]" "[125] L35-->L37: Formula: (<= 1 v_b_3) InVars {b=v_b_3} OutVars{b=v_b_3} AuxVars[] AssignedVars[]" "[129] L37-->L35-2: Formula: (= (+ v_x1_3 v_t_3) v_x1_2) InVars {x1=v_x1_3, t=v_t_3} OutVars{x1=v_x1_2, t=v_t_3} AuxVars[] AssignedVars[x1]" [2025-04-26 16:56:26,813 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:26,813 INFO L85 PathProgramCache]: Analyzing trace with hash 182556, now seen corresponding path program 1 times [2025-04-26 16:56:26,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:26,813 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146237706] [2025-04-26 16:56:26,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:26,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:26,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:26,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:26,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:26,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:26,817 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:26,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:26,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:26,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:26,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:26,819 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:26,819 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:26,820 INFO L85 PathProgramCache]: Analyzing trace with hash 151998, now seen corresponding path program 2 times [2025-04-26 16:56:26,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:26,820 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133760662] [2025-04-26 16:56:26,820 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:56:26,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:26,823 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:26,825 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:26,825 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:56:26,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:26,825 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:26,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:26,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:26,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:26,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:26,830 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:26,830 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:26,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1143680707, now seen corresponding path program 1 times [2025-04-26 16:56:26,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:26,830 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098058604] [2025-04-26 16:56:26,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:26,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:26,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:56:26,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:56:26,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:26,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:26,855 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:56:26,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:56:26,856 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098058604] [2025-04-26 16:56:26,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098058604] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:56:26,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:56:26,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 16:56:26,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113239934] [2025-04-26 16:56:26,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:56:26,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:56:26,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:56:26,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:56:26,882 INFO L87 Difference]: Start difference. First operand 237 states and 446 transitions. cyclomatic complexity: 245 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 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:56:26,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:56:26,920 INFO L93 Difference]: Finished difference Result 302 states and 523 transitions. [2025-04-26 16:56:26,920 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 302 states and 523 transitions. [2025-04-26 16:56:26,926 INFO L131 ngComponentsAnalysis]: Automaton has 51 accepting balls. 172 [2025-04-26 16:56:26,927 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 302 states to 295 states and 515 transitions. [2025-04-26 16:56:26,927 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 261 [2025-04-26 16:56:26,928 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 264 [2025-04-26 16:56:26,928 INFO L74 IsDeterministic]: Start isDeterministic. Operand 295 states and 515 transitions. [2025-04-26 16:56:26,928 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:26,928 INFO L218 hiAutomatonCegarLoop]: Abstraction has 295 states and 515 transitions. [2025-04-26 16:56:26,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states and 515 transitions. [2025-04-26 16:56:26,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 263. [2025-04-26 16:56:26,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 263 states have (on average 1.7642585551330798) internal successors, (in total 464), 262 states have internal predecessors, (464), 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:56:26,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 464 transitions. [2025-04-26 16:56:26,939 INFO L240 hiAutomatonCegarLoop]: Abstraction has 263 states and 464 transitions. [2025-04-26 16:56:26,939 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:56:26,940 INFO L438 stractBuchiCegarLoop]: Abstraction has 263 states and 464 transitions. [2025-04-26 16:56:26,940 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:56:26,940 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 263 states and 464 transitions. [2025-04-26 16:56:26,941 INFO L131 ngComponentsAnalysis]: Automaton has 45 accepting balls. 158 [2025-04-26 16:56:26,941 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:26,941 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:26,941 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:56:26,941 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:56:26,942 INFO L752 eck$LassoCheckResult]: Stem: "[155] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[119] $Ultimate##0-->L31: Formula: (< v_b_2 1) InVars {b=v_b_2} OutVars{b=v_b_2} AuxVars[] AssignedVars[]" "[121] L31-->L35-2: Formula: (= (+ v_t_2 1) 0) InVars {} OutVars{t=v_t_2} AuxVars[] AssignedVars[t]" [2025-04-26 16:56:26,942 INFO L754 eck$LassoCheckResult]: Loop: "[123] L35-2-->L35: Formula: (<= v_x1_1 v_n_2) InVars {x1=v_x1_1, n=v_n_2} OutVars{x1=v_x1_1, n=v_n_2} AuxVars[] AssignedVars[]" "[126] L35-->L41: Formula: (< v_b_4 1) InVars {b=v_b_4} OutVars{b=v_b_4} AuxVars[] AssignedVars[]" "[130] L41-->L35-2: Formula: (= (+ v_x1_4 v_t_4) v_x1_5) InVars {x1=v_x1_5, t=v_t_4} OutVars{x1=v_x1_4, t=v_t_4} AuxVars[] AssignedVars[x1]" [2025-04-26 16:56:26,942 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:26,942 INFO L85 PathProgramCache]: Analyzing trace with hash 182556, now seen corresponding path program 2 times [2025-04-26 16:56:26,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:26,942 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611000796] [2025-04-26 16:56:26,942 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:56:26,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:26,945 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:26,947 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:26,948 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:56:26,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:26,948 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:26,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:26,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:26,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:26,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:26,950 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:26,950 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:26,950 INFO L85 PathProgramCache]: Analyzing trace with hash 152030, now seen corresponding path program 1 times [2025-04-26 16:56:26,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:26,950 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848474972] [2025-04-26 16:56:26,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:26,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:26,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:26,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:26,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:26,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:26,953 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:26,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:26,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:26,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:26,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:26,955 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:26,955 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:26,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1143680739, now seen corresponding path program 1 times [2025-04-26 16:56:26,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:26,955 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607703171] [2025-04-26 16:56:26,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:26,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:26,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:56:26,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:56:26,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:26,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:26,958 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:26,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:56:26,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:56:26,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:26,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:26,961 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:26,991 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:26,991 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:26,991 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:26,991 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:26,991 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:56:26,991 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:26,991 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:26,991 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:26,991 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_2_seq_1.c.bpl_petrified1_Iteration3_Lasso [2025-04-26 16:56:26,991 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:26,991 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:26,992 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:26,994 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:26,997 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:27,040 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:27,040 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:56:27,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:27,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:27,043 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:56:27,044 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:56:27,046 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:27,046 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:27,057 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:56:27,057 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork0_thidvar0=0} Honda state: {thread1Thread1of1ForFork0_thidvar0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:56:27,062 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:56:27,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:27,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:27,064 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:56:27,065 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:56:27,066 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:27,066 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:27,085 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:56:27,086 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {b=0} Honda state: {b=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:56:27,091 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:56:27,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:27,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:27,093 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:56:27,095 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:56:27,096 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:27,096 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:27,114 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:56:27,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:27,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:27,117 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:56:27,118 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:56:27,120 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:56:27,120 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:27,247 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:56:27,253 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:56:27,253 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:27,253 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:27,253 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:27,253 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:27,253 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:27,253 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:27,254 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:27,254 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:27,254 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_2_seq_1.c.bpl_petrified1_Iteration3_Lasso [2025-04-26 16:56:27,254 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:27,254 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:27,254 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:27,257 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:27,259 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:27,296 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:27,296 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:27,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:27,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:27,298 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:56:27,300 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:56:27,302 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:56:27,312 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:27,312 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:27,312 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:27,312 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:27,315 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:27,315 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:27,322 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:27,328 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 16:56:27,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:27,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:27,330 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:56:27,332 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:56:27,333 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:56:27,343 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:27,344 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:27,344 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:27,344 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:27,346 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:27,346 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:27,348 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:27,355 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:27,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:27,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:27,357 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:56:27,359 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:56:27,360 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:56:27,370 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:27,370 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:27,370 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:27,370 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:27,372 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:27,372 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:27,377 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:27,383 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:56:27,383 INFO L437 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:56:27,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:27,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:27,385 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:56:27,386 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:56:27,387 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:27,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:27,403 INFO L439 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-04-26 16:56:27,403 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:27,403 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(n, x1) = 2*n - 2*x1 + 1 Supporting invariants [-1*t - 1 >= 0] [2025-04-26 16:56:27,412 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:56:27,415 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:56:27,434 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:27,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:27,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:27,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:27,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:27,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-26 16:56:27,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:27,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:27,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:27,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:27,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:27,446 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:56:27,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:27,467 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:56:27,468 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:56:27,468 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 263 states and 464 transitions. cyclomatic complexity: 252 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 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:56:27,547 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 263 states and 464 transitions. cyclomatic complexity: 252. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 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 836 transitions. Complement of second has 6 states. [2025-04-26 16:56:27,548 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:56:27,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 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:56:27,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2025-04-26 16:56:27,549 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 76 transitions. Stem has 3 letters. Loop has 3 letters. [2025-04-26 16:56:27,549 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:27,549 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 76 transitions. Stem has 6 letters. Loop has 3 letters. [2025-04-26 16:56:27,549 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:27,549 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 76 transitions. Stem has 3 letters. Loop has 6 letters. [2025-04-26 16:56:27,549 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:27,549 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 484 states and 836 transitions. [2025-04-26 16:56:27,554 INFO L131 ngComponentsAnalysis]: Automaton has 63 accepting balls. 218 [2025-04-26 16:56:27,557 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 484 states to 383 states and 660 transitions. [2025-04-26 16:56:27,557 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 309 [2025-04-26 16:56:27,558 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 321 [2025-04-26 16:56:27,558 INFO L74 IsDeterministic]: Start isDeterministic. Operand 383 states and 660 transitions. [2025-04-26 16:56:27,558 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:27,558 INFO L218 hiAutomatonCegarLoop]: Abstraction has 383 states and 660 transitions. [2025-04-26 16:56:27,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states and 660 transitions. [2025-04-26 16:56:27,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 301. [2025-04-26 16:56:27,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 301 states have (on average 1.7674418604651163) internal successors, (in total 532), 300 states have internal predecessors, (532), 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:56:27,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 532 transitions. [2025-04-26 16:56:27,571 INFO L240 hiAutomatonCegarLoop]: Abstraction has 301 states and 532 transitions. [2025-04-26 16:56:27,571 INFO L438 stractBuchiCegarLoop]: Abstraction has 301 states and 532 transitions. [2025-04-26 16:56:27,571 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:56:27,571 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 301 states and 532 transitions. [2025-04-26 16:56:27,572 INFO L131 ngComponentsAnalysis]: Automaton has 45 accepting balls. 158 [2025-04-26 16:56:27,572 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:27,572 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:27,573 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:56:27,573 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:56:27,573 INFO L752 eck$LassoCheckResult]: Stem: "[155] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[118] $Ultimate##0-->L27: Formula: (<= 1 v_b_1) InVars {b=v_b_1} OutVars{b=v_b_1} AuxVars[] AssignedVars[]" "[120] L27-->L35-2: Formula: (= v_t_1 1) InVars {} OutVars{t=v_t_1} AuxVars[] AssignedVars[t]" "[122] L35-2-->L44: Formula: (< v_n_3 v_x1_6) InVars {x1=v_x1_6, n=v_n_3} OutVars{x1=v_x1_6, n=v_n_3} AuxVars[] AssignedVars[]" "[124] L44-->L47-2: Formula: (= v_t1_2 v_t_5) InVars {t=v_t_5} OutVars{t1=v_t1_2, t=v_t_5} AuxVars[] AssignedVars[t1]" [2025-04-26 16:56:27,573 INFO L754 eck$LassoCheckResult]: Loop: "[128] L47-2-->L47: Formula: (<= v_x3_4 v_n_4) InVars {n=v_n_4, x3=v_x3_4} OutVars{n=v_n_4, x3=v_x3_4} AuxVars[] AssignedVars[]" "[133] L47-->L49: Formula: (<= 1 v_b_5) InVars {b=v_b_5} OutVars{b=v_b_5} AuxVars[] AssignedVars[]" "[137] L49-->L47-2: Formula: (= v_x3_5 (+ v_x3_6 v_t1_3)) InVars {t1=v_t1_3, x3=v_x3_6} OutVars{t1=v_t1_3, x3=v_x3_5} AuxVars[] AssignedVars[x3]" [2025-04-26 16:56:27,573 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:27,573 INFO L85 PathProgramCache]: Analyzing trace with hash 175409470, now seen corresponding path program 1 times [2025-04-26 16:56:27,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:27,573 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719320644] [2025-04-26 16:56:27,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:27,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:27,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:56:27,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:56:27,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:27,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:27,577 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:27,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:56:27,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:56:27,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:27,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:27,579 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:27,579 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:27,580 INFO L85 PathProgramCache]: Analyzing trace with hash 157059, now seen corresponding path program 1 times [2025-04-26 16:56:27,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:27,580 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462929961] [2025-04-26 16:56:27,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:27,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:27,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:27,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:27,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:27,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:27,582 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:27,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:27,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:27,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:27,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:27,588 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:27,588 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:27,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1351551194, now seen corresponding path program 1 times [2025-04-26 16:56:27,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:27,588 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057246199] [2025-04-26 16:56:27,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:27,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:27,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:56:27,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:56:27,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:27,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:27,592 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:27,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:56:27,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:56:27,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:27,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:27,601 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:27,646 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:27,646 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:27,646 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:27,646 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:27,646 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:56:27,646 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:27,647 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:27,647 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:27,647 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_2_seq_1.c.bpl_petrified1_Iteration4_Lasso [2025-04-26 16:56:27,647 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:27,647 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:27,647 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:27,654 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:27,656 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:27,658 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:27,703 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:27,703 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:56:27,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:27,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:27,705 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:56:27,706 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:56:27,708 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:27,708 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:27,725 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:56:27,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:27,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:27,727 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:56:27,728 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:56:27,729 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:56:27,729 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:27,866 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:56:27,872 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:56:27,873 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:27,873 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:27,873 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:27,873 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:27,873 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:27,873 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:27,873 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:27,873 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:27,873 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_2_seq_1.c.bpl_petrified1_Iteration4_Lasso [2025-04-26 16:56:27,873 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:27,873 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:27,874 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:27,881 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:27,885 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:27,888 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:27,929 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:27,929 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:27,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:27,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:27,932 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:56:27,934 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:56:27,935 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:56:27,945 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:27,946 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:27,946 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:27,946 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:27,948 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:27,948 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:27,953 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:27,960 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 16:56:27,960 INFO L437 ModelExtractionUtils]: 5 out of 16 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:56:27,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:27,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:27,962 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:56:27,964 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:56:27,965 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:27,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:27,981 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 2. [2025-04-26 16:56:27,981 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:27,981 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, x3) = 1*x1 - 1*x3 Supporting invariants [1*t1 - 1 >= 0, 1*x1 - 1*n - 1 >= 0] [2025-04-26 16:56:27,987 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-04-26 16:56:27,990 INFO L156 tatePredicateManager]: 0 out of 2 supporting invariants were superfluous and have been removed [2025-04-26 16:56:28,009 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:28,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:56:28,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:56:28,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:28,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:28,018 WARN L254 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:56:28,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:28,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:28,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:28,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:28,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:28,058 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-26 16:56:28,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:28,085 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:56:28,086 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2025-04-26 16:56:28,086 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 301 states and 532 transitions. cyclomatic complexity: 288 Second operand has 5 states, 5 states have (on average 1.6) internal successors, (in total 8), 5 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:56:28,179 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 301 states and 532 transitions. cyclomatic complexity: 288. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (in total 8), 5 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) Result 605 states and 1110 transitions. Complement of second has 10 states. [2025-04-26 16:56:28,180 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 3 stem states 2 non-accepting loop states 2 accepting loop states [2025-04-26 16:56:28,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (in total 8), 5 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:56:28,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 94 transitions. [2025-04-26 16:56:28,180 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 7 states and 94 transitions. Stem has 5 letters. Loop has 3 letters. [2025-04-26 16:56:28,181 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:28,181 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 7 states and 94 transitions. Stem has 8 letters. Loop has 3 letters. [2025-04-26 16:56:28,181 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:28,181 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 7 states and 94 transitions. Stem has 5 letters. Loop has 6 letters. [2025-04-26 16:56:28,181 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:28,181 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 605 states and 1110 transitions. [2025-04-26 16:56:28,184 INFO L131 ngComponentsAnalysis]: Automaton has 58 accepting balls. 192 [2025-04-26 16:56:28,187 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 605 states to 496 states and 883 transitions. [2025-04-26 16:56:28,187 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 340 [2025-04-26 16:56:28,187 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 404 [2025-04-26 16:56:28,188 INFO L74 IsDeterministic]: Start isDeterministic. Operand 496 states and 883 transitions. [2025-04-26 16:56:28,188 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:28,188 INFO L218 hiAutomatonCegarLoop]: Abstraction has 496 states and 883 transitions. [2025-04-26 16:56:28,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states and 883 transitions. [2025-04-26 16:56:28,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 313. [2025-04-26 16:56:28,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 313 states have (on average 1.817891373801917) internal successors, (in total 569), 312 states have internal predecessors, (569), 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:56:28,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 569 transitions. [2025-04-26 16:56:28,194 INFO L240 hiAutomatonCegarLoop]: Abstraction has 313 states and 569 transitions. [2025-04-26 16:56:28,194 INFO L438 stractBuchiCegarLoop]: Abstraction has 313 states and 569 transitions. [2025-04-26 16:56:28,194 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:56:28,194 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 313 states and 569 transitions. [2025-04-26 16:56:28,196 INFO L131 ngComponentsAnalysis]: Automaton has 39 accepting balls. 131 [2025-04-26 16:56:28,196 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:28,196 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:28,197 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:56:28,197 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:56:28,197 INFO L752 eck$LassoCheckResult]: Stem: "[155] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[118] $Ultimate##0-->L27: Formula: (<= 1 v_b_1) InVars {b=v_b_1} OutVars{b=v_b_1} AuxVars[] AssignedVars[]" "[158] L16-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[139] $Ultimate##0-->L67: Formula: (<= 1 v_b_7) InVars {b=v_b_7} OutVars{b=v_b_7} AuxVars[] AssignedVars[]" "[141] L67-->L75-2: Formula: (= v_t_6 1) InVars {} OutVars{t=v_t_6} AuxVars[] AssignedVars[t]" [2025-04-26 16:56:28,197 INFO L754 eck$LassoCheckResult]: Loop: "[144] L75-2-->L75: Formula: (<= v_x2_2 v_n_6) InVars {x2=v_x2_2, n=v_n_6} OutVars{x2=v_x2_2, n=v_n_6} AuxVars[] AssignedVars[]" "[147] L75-->L77: Formula: (<= 1 v_b_9) InVars {b=v_b_9} OutVars{b=v_b_9} AuxVars[] AssignedVars[]" "[151] L77-->L75-2: Formula: (= v_x2_3 (+ v_x2_4 v_t_8)) InVars {t=v_t_8, x2=v_x2_4} OutVars{t=v_t_8, x2=v_x2_3} AuxVars[] AssignedVars[x2]" [2025-04-26 16:56:28,197 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:28,197 INFO L85 PathProgramCache]: Analyzing trace with hash 175446532, now seen corresponding path program 1 times [2025-04-26 16:56:28,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:28,198 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233588132] [2025-04-26 16:56:28,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:28,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:28,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:56:28,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:56:28,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:28,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:28,204 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:28,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:56:28,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:56:28,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:28,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:28,206 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:28,206 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:28,206 INFO L85 PathProgramCache]: Analyzing trace with hash 172883, now seen corresponding path program 1 times [2025-04-26 16:56:28,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:28,206 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013861064] [2025-04-26 16:56:28,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:28,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:28,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:28,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:28,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:28,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:28,210 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:28,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:28,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:28,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:28,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:28,212 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:28,212 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:28,212 INFO L85 PathProgramCache]: Analyzing trace with hash -247421328, now seen corresponding path program 1 times [2025-04-26 16:56:28,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:28,212 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30213611] [2025-04-26 16:56:28,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:28,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:28,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:56:28,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:56:28,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:28,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:28,216 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:28,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:56:28,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:56:28,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:28,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:28,220 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:28,260 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:28,260 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:28,260 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:28,260 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:28,260 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:56:28,260 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:28,260 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:28,260 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:28,260 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_2_seq_1.c.bpl_petrified1_Iteration5_Lasso [2025-04-26 16:56:28,260 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:28,260 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:28,261 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:28,264 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:28,269 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:28,272 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:28,275 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:28,313 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:28,313 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:56:28,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:28,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:28,316 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:56:28,318 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:56:28,319 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:28,319 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:28,329 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:56:28,329 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread2Thread1of1ForFork1_thidvar0=0} Honda state: {thread2Thread1of1ForFork1_thidvar0=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:56:28,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:28,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:28,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:28,337 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:56:28,337 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:56:28,338 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:28,338 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:28,355 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-04-26 16:56:28,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:28,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:28,358 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:56:28,359 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:56:28,359 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:56:28,359 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:28,509 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:56:28,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-04-26 16:56:28,515 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:28,515 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:28,515 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:28,515 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:28,515 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:28,515 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:28,515 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:28,515 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:28,515 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_2_seq_1.c.bpl_petrified1_Iteration5_Lasso [2025-04-26 16:56:28,515 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:28,516 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:28,516 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:28,521 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:28,526 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:28,529 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:28,531 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:28,565 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:28,565 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:28,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:28,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:28,567 INFO L229 MonitoredProcess]: Starting monitored process 25 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:56:28,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-04-26 16:56:28,570 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:56:28,580 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:28,580 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:28,580 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:28,580 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:28,582 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:28,582 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:28,584 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:28,590 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-04-26 16:56:28,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:28,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:28,592 INFO L229 MonitoredProcess]: Starting monitored process 26 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:56:28,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-04-26 16:56:28,595 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:56:28,605 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:28,605 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:28,605 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:28,605 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:28,609 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:28,609 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:28,614 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:28,617 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:56:28,618 INFO L437 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:56:28,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:28,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:28,620 INFO L229 MonitoredProcess]: Starting monitored process 27 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:56:28,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-04-26 16:56:28,621 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:28,636 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-04-26 16:56:28,637 INFO L439 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-04-26 16:56:28,637 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:28,637 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(t, n, x2) = 1*t + 2*n - 2*x2 Supporting invariants [1*t - 1 >= 0] [2025-04-26 16:56:28,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-04-26 16:56:28,645 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:56:28,663 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:28,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:56:28,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:56:28,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:28,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:28,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-26 16:56:28,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:28,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:28,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:28,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:28,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:28,683 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:56:28,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:28,707 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:56:28,708 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:56:28,708 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 313 states and 569 transitions. cyclomatic complexity: 313 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 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:56:28,772 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 313 states and 569 transitions. cyclomatic complexity: 313. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 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) Result 769 states and 1408 transitions. Complement of second has 7 states. [2025-04-26 16:56:28,773 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:56:28,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 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:56:28,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2025-04-26 16:56:28,774 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 93 transitions. Stem has 5 letters. Loop has 3 letters. [2025-04-26 16:56:28,774 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:28,774 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 93 transitions. Stem has 8 letters. Loop has 3 letters. [2025-04-26 16:56:28,774 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:28,774 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 93 transitions. Stem has 5 letters. Loop has 6 letters. [2025-04-26 16:56:28,774 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:28,774 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 769 states and 1408 transitions. [2025-04-26 16:56:28,778 INFO L131 ngComponentsAnalysis]: Automaton has 77 accepting balls. 255 [2025-04-26 16:56:28,780 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 769 states to 594 states and 1049 transitions. [2025-04-26 16:56:28,780 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 385 [2025-04-26 16:56:28,781 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 417 [2025-04-26 16:56:28,781 INFO L74 IsDeterministic]: Start isDeterministic. Operand 594 states and 1049 transitions. [2025-04-26 16:56:28,781 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:28,781 INFO L218 hiAutomatonCegarLoop]: Abstraction has 594 states and 1049 transitions. [2025-04-26 16:56:28,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states and 1049 transitions. [2025-04-26 16:56:28,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 394. [2025-04-26 16:56:28,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 394 states have (on average 1.8071065989847717) internal successors, (in total 712), 393 states have internal predecessors, (712), 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:56:28,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 712 transitions. [2025-04-26 16:56:28,788 INFO L240 hiAutomatonCegarLoop]: Abstraction has 394 states and 712 transitions. [2025-04-26 16:56:28,788 INFO L438 stractBuchiCegarLoop]: Abstraction has 394 states and 712 transitions. [2025-04-26 16:56:28,788 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 16:56:28,788 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 394 states and 712 transitions. [2025-04-26 16:56:28,789 INFO L131 ngComponentsAnalysis]: Automaton has 36 accepting balls. 117 [2025-04-26 16:56:28,789 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:28,789 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:28,789 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:56:28,790 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:56:28,790 INFO L752 eck$LassoCheckResult]: Stem: "[155] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[118] $Ultimate##0-->L27: Formula: (<= 1 v_b_1) InVars {b=v_b_1} OutVars{b=v_b_1} AuxVars[] AssignedVars[]" "[158] L16-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[140] $Ultimate##0-->L71: Formula: (< v_b_8 1) InVars {b=v_b_8} OutVars{b=v_b_8} AuxVars[] AssignedVars[]" "[142] L71-->L75-2: Formula: (= (+ v_t_7 1) 0) InVars {} OutVars{t=v_t_7} AuxVars[] AssignedVars[t]" [2025-04-26 16:56:28,790 INFO L754 eck$LassoCheckResult]: Loop: "[144] L75-2-->L75: Formula: (<= v_x2_2 v_n_6) InVars {x2=v_x2_2, n=v_n_6} OutVars{x2=v_x2_2, n=v_n_6} AuxVars[] AssignedVars[]" "[148] L75-->L81: Formula: (< v_b_10 1) InVars {b=v_b_10} OutVars{b=v_b_10} AuxVars[] AssignedVars[]" "[152] L81-->L75-2: Formula: (= v_x2_6 (+ v_x2_5 v_t_9)) InVars {t=v_t_9, x2=v_x2_6} OutVars{t=v_t_9, x2=v_x2_5} AuxVars[] AssignedVars[x2]" [2025-04-26 16:56:28,790 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:28,790 INFO L85 PathProgramCache]: Analyzing trace with hash 175446564, now seen corresponding path program 1 times [2025-04-26 16:56:28,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:28,790 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941652922] [2025-04-26 16:56:28,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:28,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:28,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:56:28,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:56:28,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:28,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:28,800 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:56:28,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:56:28,800 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941652922] [2025-04-26 16:56:28,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941652922] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:56:28,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:56:28,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 16:56:28,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672606012] [2025-04-26 16:56:28,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:56:28,801 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:56:28,801 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:28,801 INFO L85 PathProgramCache]: Analyzing trace with hash 172915, now seen corresponding path program 1 times [2025-04-26 16:56:28,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:28,801 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096478921] [2025-04-26 16:56:28,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:28,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:28,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:28,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:28,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:28,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:28,803 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:28,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:28,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:28,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:28,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:28,809 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:28,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:56:28,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:56:28,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:56:28,822 INFO L87 Difference]: Start difference. First operand 394 states and 712 transitions. cyclomatic complexity: 388 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 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:56:28,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:56:28,838 INFO L93 Difference]: Finished difference Result 357 states and 612 transitions. [2025-04-26 16:56:28,838 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 357 states and 612 transitions. [2025-04-26 16:56:28,867 INFO L131 ngComponentsAnalysis]: Automaton has 30 accepting balls. 87 [2025-04-26 16:56:28,870 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 357 states to 332 states and 556 transitions. [2025-04-26 16:56:28,870 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 171 [2025-04-26 16:56:28,870 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 171 [2025-04-26 16:56:28,870 INFO L74 IsDeterministic]: Start isDeterministic. Operand 332 states and 556 transitions. [2025-04-26 16:56:28,870 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:28,870 INFO L218 hiAutomatonCegarLoop]: Abstraction has 332 states and 556 transitions. [2025-04-26 16:56:28,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states and 556 transitions. [2025-04-26 16:56:28,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 318. [2025-04-26 16:56:28,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 318 states have (on average 1.679245283018868) internal successors, (in total 534), 317 states have internal predecessors, (534), 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:56:28,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 534 transitions. [2025-04-26 16:56:28,877 INFO L240 hiAutomatonCegarLoop]: Abstraction has 318 states and 534 transitions. [2025-04-26 16:56:28,878 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:56:28,879 INFO L438 stractBuchiCegarLoop]: Abstraction has 318 states and 534 transitions. [2025-04-26 16:56:28,879 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 16:56:28,879 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 318 states and 534 transitions. [2025-04-26 16:56:28,880 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 73 [2025-04-26 16:56:28,880 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:28,880 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:28,880 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:56:28,880 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:56:28,881 INFO L752 eck$LassoCheckResult]: Stem: "[155] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[119] $Ultimate##0-->L31: Formula: (< v_b_2 1) InVars {b=v_b_2} OutVars{b=v_b_2} AuxVars[] AssignedVars[]" "[121] L31-->L35-2: Formula: (= (+ v_t_2 1) 0) InVars {} OutVars{t=v_t_2} AuxVars[] AssignedVars[t]" "[122] L35-2-->L44: Formula: (< v_n_3 v_x1_6) InVars {x1=v_x1_6, n=v_n_3} OutVars{x1=v_x1_6, n=v_n_3} AuxVars[] AssignedVars[]" "[124] L44-->L47-2: Formula: (= v_t1_2 v_t_5) InVars {t=v_t_5} OutVars{t1=v_t1_2, t=v_t_5} AuxVars[] AssignedVars[t1]" [2025-04-26 16:56:28,881 INFO L754 eck$LassoCheckResult]: Loop: "[128] L47-2-->L47: Formula: (<= v_x3_4 v_n_4) InVars {n=v_n_4, x3=v_x3_4} OutVars{n=v_n_4, x3=v_x3_4} AuxVars[] AssignedVars[]" "[134] L47-->L53: Formula: (< v_b_6 1) InVars {b=v_b_6} OutVars{b=v_b_6} AuxVars[] AssignedVars[]" "[138] L53-->L47-2: Formula: (= (+ v_x3_1 v_t1_1) v_x3_2) InVars {t1=v_t1_1, x3=v_x3_2} OutVars{t1=v_t1_1, x3=v_x3_1} AuxVars[] AssignedVars[x3]" [2025-04-26 16:56:28,882 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:28,882 INFO L85 PathProgramCache]: Analyzing trace with hash 175440222, now seen corresponding path program 1 times [2025-04-26 16:56:28,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:28,882 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913785099] [2025-04-26 16:56:28,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:28,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:28,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:56:28,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:56:28,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:28,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:28,885 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:28,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:56:28,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:56:28,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:28,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:28,890 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:28,891 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:28,891 INFO L85 PathProgramCache]: Analyzing trace with hash 157091, now seen corresponding path program 1 times [2025-04-26 16:56:28,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:28,891 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983540220] [2025-04-26 16:56:28,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:28,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:28,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:28,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:28,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:28,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:28,893 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:28,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:28,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:28,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:28,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:28,898 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:28,899 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:28,899 INFO L85 PathProgramCache]: Analyzing trace with hash -435418330, now seen corresponding path program 1 times [2025-04-26 16:56:28,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:28,899 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345144394] [2025-04-26 16:56:28,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:28,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:28,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:56:28,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:56:28,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:28,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:28,902 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:28,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:56:28,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:56:28,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:28,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:28,906 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:28,949 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:28,949 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:28,949 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:28,949 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:28,949 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:56:28,949 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:28,949 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:28,950 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:28,950 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_2_seq_1.c.bpl_petrified1_Iteration7_Lasso [2025-04-26 16:56:28,950 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:28,950 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:28,950 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:28,952 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:28,954 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:28,956 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:28,991 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:28,991 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:56:28,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:28,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:28,993 INFO L229 MonitoredProcess]: Starting monitored process 28 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:56:28,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-04-26 16:56:28,995 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:28,995 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:29,013 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:56:29,013 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {t=0} Honda state: {t=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:56:29,018 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-04-26 16:56:29,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:29,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:29,020 INFO L229 MonitoredProcess]: Starting monitored process 29 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:56:29,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-04-26 16:56:29,022 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:29,022 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:29,033 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:56:29,033 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork0_thidvar0=0} Honda state: {thread1Thread1of1ForFork0_thidvar0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:56:29,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-04-26 16:56:29,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:29,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:29,041 INFO L229 MonitoredProcess]: Starting monitored process 30 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:56:29,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-04-26 16:56:29,044 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:29,044 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:29,061 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:56:29,061 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {b=0} Honda state: {b=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:56:29,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:29,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:29,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:29,069 INFO L229 MonitoredProcess]: Starting monitored process 31 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:56:29,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-04-26 16:56:29,072 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:29,072 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:29,091 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-04-26 16:56:29,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:29,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:29,093 INFO L229 MonitoredProcess]: Starting monitored process 32 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:56:29,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-04-26 16:56:29,096 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:56:29,096 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:29,221 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:56:29,227 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2025-04-26 16:56:29,227 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:29,227 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:29,227 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:29,227 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:29,227 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:29,227 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:29,227 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:29,227 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:29,227 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_2_seq_1.c.bpl_petrified1_Iteration7_Lasso [2025-04-26 16:56:29,227 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:29,228 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:29,228 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:29,230 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:29,232 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:29,238 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:29,265 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:29,265 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:29,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:29,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:29,267 INFO L229 MonitoredProcess]: Starting monitored process 33 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:56:29,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-04-26 16:56:29,268 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:56:29,278 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:29,278 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:29,278 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:29,278 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:29,279 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:29,279 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:29,282 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:29,287 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2025-04-26 16:56:29,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:29,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:29,289 INFO L229 MonitoredProcess]: Starting monitored process 34 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:56:29,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-04-26 16:56:29,291 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:56:29,301 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:29,301 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:29,301 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:29,301 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:29,302 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:29,302 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:29,307 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:29,313 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2025-04-26 16:56:29,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:29,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:29,315 INFO L229 MonitoredProcess]: Starting monitored process 35 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:56:29,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-04-26 16:56:29,317 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:56:29,328 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:29,328 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:29,328 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:29,328 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:29,330 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:29,330 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:29,335 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:29,344 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 16:56:29,344 INFO L437 ModelExtractionUtils]: 5 out of 16 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:56:29,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:29,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:29,346 INFO L229 MonitoredProcess]: Starting monitored process 36 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:56:29,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-04-26 16:56:29,348 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:29,364 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2025-04-26 16:56:29,364 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 2. [2025-04-26 16:56:29,364 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:29,364 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, x3) = 1*x1 - 1*x3 Supporting invariants [-1*t1 - 1 >= 0, 1*x1 - 1*n - 1 >= 0] [2025-04-26 16:56:29,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:29,376 INFO L156 tatePredicateManager]: 0 out of 2 supporting invariants were superfluous and have been removed [2025-04-26 16:56:29,394 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:29,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:56:29,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:56:29,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:29,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:29,400 WARN L254 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:56:29,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:29,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:29,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:29,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:29,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:29,434 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-26 16:56:29,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:29,462 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:56:29,462 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2025-04-26 16:56:29,462 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 318 states and 534 transitions. cyclomatic complexity: 271 Second operand has 5 states, 5 states have (on average 1.6) internal successors, (in total 8), 5 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:56:29,542 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 318 states and 534 transitions. cyclomatic complexity: 271. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (in total 8), 5 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) Result 442 states and 777 transitions. Complement of second has 10 states. [2025-04-26 16:56:29,542 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 3 stem states 2 non-accepting loop states 2 accepting loop states [2025-04-26 16:56:29,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (in total 8), 5 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:56:29,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2025-04-26 16:56:29,543 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 7 states and 76 transitions. Stem has 5 letters. Loop has 3 letters. [2025-04-26 16:56:29,543 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:29,543 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 7 states and 76 transitions. Stem has 8 letters. Loop has 3 letters. [2025-04-26 16:56:29,543 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:29,543 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 7 states and 76 transitions. Stem has 5 letters. Loop has 6 letters. [2025-04-26 16:56:29,543 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:29,544 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 442 states and 777 transitions. [2025-04-26 16:56:29,545 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 60 [2025-04-26 16:56:29,547 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 442 states to 380 states and 652 transitions. [2025-04-26 16:56:29,547 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 152 [2025-04-26 16:56:29,547 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 174 [2025-04-26 16:56:29,547 INFO L74 IsDeterministic]: Start isDeterministic. Operand 380 states and 652 transitions. [2025-04-26 16:56:29,548 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:29,548 INFO L218 hiAutomatonCegarLoop]: Abstraction has 380 states and 652 transitions. [2025-04-26 16:56:29,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states and 652 transitions. [2025-04-26 16:56:29,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 330. [2025-04-26 16:56:29,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 330 states have (on average 1.7) internal successors, (in total 561), 329 states have internal predecessors, (561), 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:56:29,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 561 transitions. [2025-04-26 16:56:29,553 INFO L240 hiAutomatonCegarLoop]: Abstraction has 330 states and 561 transitions. [2025-04-26 16:56:29,553 INFO L438 stractBuchiCegarLoop]: Abstraction has 330 states and 561 transitions. [2025-04-26 16:56:29,553 INFO L340 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-04-26 16:56:29,553 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 330 states and 561 transitions. [2025-04-26 16:56:29,554 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 46 [2025-04-26 16:56:29,554 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:29,554 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:29,554 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:56:29,554 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:56:29,555 INFO L752 eck$LassoCheckResult]: Stem: "[155] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[119] $Ultimate##0-->L31: Formula: (< v_b_2 1) InVars {b=v_b_2} OutVars{b=v_b_2} AuxVars[] AssignedVars[]" "[158] L16-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[140] $Ultimate##0-->L71: Formula: (< v_b_8 1) InVars {b=v_b_8} OutVars{b=v_b_8} AuxVars[] AssignedVars[]" "[142] L71-->L75-2: Formula: (= (+ v_t_7 1) 0) InVars {} OutVars{t=v_t_7} AuxVars[] AssignedVars[t]" [2025-04-26 16:56:29,555 INFO L754 eck$LassoCheckResult]: Loop: "[144] L75-2-->L75: Formula: (<= v_x2_2 v_n_6) InVars {x2=v_x2_2, n=v_n_6} OutVars{x2=v_x2_2, n=v_n_6} AuxVars[] AssignedVars[]" "[148] L75-->L81: Formula: (< v_b_10 1) InVars {b=v_b_10} OutVars{b=v_b_10} AuxVars[] AssignedVars[]" "[152] L81-->L75-2: Formula: (= v_x2_6 (+ v_x2_5 v_t_9)) InVars {t=v_t_9, x2=v_x2_6} OutVars{t=v_t_9, x2=v_x2_5} AuxVars[] AssignedVars[x2]" [2025-04-26 16:56:29,555 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:29,555 INFO L85 PathProgramCache]: Analyzing trace with hash 175476355, now seen corresponding path program 1 times [2025-04-26 16:56:29,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:29,555 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080447310] [2025-04-26 16:56:29,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:29,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:29,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:56:29,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:56:29,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:29,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:29,558 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:29,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:56:29,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:56:29,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:29,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:29,559 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:29,560 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:29,560 INFO L85 PathProgramCache]: Analyzing trace with hash 172915, now seen corresponding path program 2 times [2025-04-26 16:56:29,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:29,560 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469389527] [2025-04-26 16:56:29,560 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:56:29,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:29,561 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:29,562 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:29,562 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:56:29,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:29,562 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:29,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:29,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:29,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:29,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:29,563 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:29,564 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:29,564 INFO L85 PathProgramCache]: Analyzing trace with hash 641035697, now seen corresponding path program 1 times [2025-04-26 16:56:29,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:29,564 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014165723] [2025-04-26 16:56:29,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:29,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:29,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:56:29,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:56:29,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:29,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:29,566 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:29,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:56:29,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:56:29,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:29,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:29,569 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:29,600 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:29,600 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:29,601 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:29,601 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:29,601 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:56:29,601 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:29,601 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:29,601 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:29,601 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_2_seq_1.c.bpl_petrified1_Iteration8_Lasso [2025-04-26 16:56:29,601 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:29,601 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:29,601 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:29,605 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:29,607 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:29,611 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:29,613 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:29,650 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:29,650 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:56:29,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:29,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:29,652 INFO L229 MonitoredProcess]: Starting monitored process 37 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:56:29,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-04-26 16:56:29,655 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:29,655 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:29,672 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:56:29,673 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {b=0} Honda state: {b=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:56:29,678 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:29,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:29,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:29,681 INFO L229 MonitoredProcess]: Starting monitored process 38 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:56:29,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2025-04-26 16:56:29,683 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:29,683 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:29,693 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:56:29,694 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork0_thidvar0=0} Honda state: {thread1Thread1of1ForFork0_thidvar0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:56:29,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:29,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:29,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:29,701 INFO L229 MonitoredProcess]: Starting monitored process 39 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:56:29,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2025-04-26 16:56:29,703 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:29,703 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:29,719 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2025-04-26 16:56:29,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:29,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:29,721 INFO L229 MonitoredProcess]: Starting monitored process 40 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:56:29,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2025-04-26 16:56:29,723 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:56:29,723 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:29,843 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:56:29,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2025-04-26 16:56:29,849 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:29,849 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:29,849 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:29,849 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:29,849 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:29,849 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:29,849 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:29,849 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:29,849 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_2_seq_1.c.bpl_petrified1_Iteration8_Lasso [2025-04-26 16:56:29,849 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:29,849 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:29,850 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:29,853 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:29,856 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:29,860 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:29,863 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:29,891 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:29,891 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:29,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:29,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:29,892 INFO L229 MonitoredProcess]: Starting monitored process 41 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:56:29,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2025-04-26 16:56:29,894 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:56:29,903 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:29,904 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:29,904 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:29,904 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:29,905 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:29,905 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:29,907 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:29,912 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2025-04-26 16:56:29,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:29,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:29,914 INFO L229 MonitoredProcess]: Starting monitored process 42 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:56:29,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2025-04-26 16:56:29,915 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:56:29,925 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:29,925 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:29,925 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:29,925 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:29,926 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:29,926 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:29,928 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:29,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2025-04-26 16:56:29,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:29,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:29,938 INFO L229 MonitoredProcess]: Starting monitored process 43 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:56:29,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2025-04-26 16:56:29,940 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:56:29,950 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:29,950 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:29,950 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:29,950 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:29,955 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:29,955 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:29,959 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:29,963 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:56:29,963 INFO L437 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:56:29,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:29,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:29,965 INFO L229 MonitoredProcess]: Starting monitored process 44 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:56:29,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2025-04-26 16:56:29,966 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:29,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:29,983 INFO L439 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-04-26 16:56:29,983 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:29,983 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(n, x2) = 2*n - 2*x2 + 1 Supporting invariants [-1*t - 1 >= 0] [2025-04-26 16:56:29,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:29,994 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:56:30,011 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:30,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:56:30,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:56:30,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:30,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:30,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-26 16:56:30,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:30,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:30,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:30,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:30,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:30,026 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:56:30,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:30,043 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:56:30,044 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:56:30,044 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 330 states and 561 transitions. cyclomatic complexity: 286 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 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:56:30,102 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 330 states and 561 transitions. cyclomatic complexity: 286. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 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) Result 532 states and 919 transitions. Complement of second has 6 states. [2025-04-26 16:56:30,103 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:56:30,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 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:56:30,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2025-04-26 16:56:30,105 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 82 transitions. Stem has 5 letters. Loop has 3 letters. [2025-04-26 16:56:30,105 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:30,105 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 82 transitions. Stem has 8 letters. Loop has 3 letters. [2025-04-26 16:56:30,105 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:30,105 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 82 transitions. Stem has 5 letters. Loop has 6 letters. [2025-04-26 16:56:30,105 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:30,105 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 532 states and 919 transitions. [2025-04-26 16:56:30,113 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 48 [2025-04-26 16:56:30,115 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 532 states to 433 states and 737 transitions. [2025-04-26 16:56:30,116 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 156 [2025-04-26 16:56:30,116 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 166 [2025-04-26 16:56:30,116 INFO L74 IsDeterministic]: Start isDeterministic. Operand 433 states and 737 transitions. [2025-04-26 16:56:30,116 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:30,116 INFO L218 hiAutomatonCegarLoop]: Abstraction has 433 states and 737 transitions. [2025-04-26 16:56:30,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states and 737 transitions. [2025-04-26 16:56:30,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 402. [2025-04-26 16:56:30,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 402 states have (on average 1.699004975124378) internal successors, (in total 683), 401 states have internal predecessors, (683), 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:56:30,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 683 transitions. [2025-04-26 16:56:30,122 INFO L240 hiAutomatonCegarLoop]: Abstraction has 402 states and 683 transitions. [2025-04-26 16:56:30,122 INFO L438 stractBuchiCegarLoop]: Abstraction has 402 states and 683 transitions. [2025-04-26 16:56:30,122 INFO L340 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-04-26 16:56:30,122 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 402 states and 683 transitions. [2025-04-26 16:56:30,124 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 34 [2025-04-26 16:56:30,124 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:30,124 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:30,124 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 16:56:30,124 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:56:30,124 INFO L752 eck$LassoCheckResult]: Stem: "[155] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[118] $Ultimate##0-->L27: Formula: (<= 1 v_b_1) InVars {b=v_b_1} OutVars{b=v_b_1} AuxVars[] AssignedVars[]" "[120] L27-->L35-2: Formula: (= v_t_1 1) InVars {} OutVars{t=v_t_1} AuxVars[] AssignedVars[t]" "[122] L35-2-->L44: Formula: (< v_n_3 v_x1_6) InVars {x1=v_x1_6, n=v_n_3} OutVars{x1=v_x1_6, n=v_n_3} AuxVars[] AssignedVars[]" "[124] L44-->L47-2: Formula: (= v_t1_2 v_t_5) InVars {t=v_t_5} OutVars{t1=v_t1_2, t=v_t_5} AuxVars[] AssignedVars[t1]" "[127] L47-2-->L56-1: Formula: (< v_n_1 v_x3_3) InVars {n=v_n_1, x3=v_x3_3} OutVars{n=v_n_1, x3=v_x3_3} AuxVars[] AssignedVars[]" [2025-04-26 16:56:30,124 INFO L754 eck$LassoCheckResult]: Loop: "[132] L56-1-->L58: Formula: (< v_z1_1 0) InVars {z1=v_z1_1} OutVars{z1=v_z1_1} AuxVars[] AssignedVars[]" "[136] L58-->L56-1: Formula: (= v_z1_2 (+ v_z1_3 1)) InVars {z1=v_z1_3} OutVars{z1=v_z1_2} AuxVars[] AssignedVars[z1]" [2025-04-26 16:56:30,125 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:30,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1142726401, now seen corresponding path program 1 times [2025-04-26 16:56:30,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:30,125 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702599767] [2025-04-26 16:56:30,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:30,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:30,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:56:30,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:56:30,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:30,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:30,128 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:30,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:56:30,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:56:30,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:30,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:30,134 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:30,135 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:30,135 INFO L85 PathProgramCache]: Analyzing trace with hash 5189, now seen corresponding path program 1 times [2025-04-26 16:56:30,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:30,135 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495280056] [2025-04-26 16:56:30,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:30,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:30,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:30,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:30,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:30,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:30,139 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:30,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:30,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:30,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:30,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:30,141 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:30,141 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:30,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1351552187, now seen corresponding path program 1 times [2025-04-26 16:56:30,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:30,141 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733719628] [2025-04-26 16:56:30,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:30,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:30,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:56:30,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:56:30,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:30,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:30,148 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:30,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:56:30,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:56:30,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:30,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:30,151 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:30,161 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:30,161 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:30,161 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:30,161 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:30,161 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:56:30,161 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:30,161 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:30,161 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:30,161 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_2_seq_1.c.bpl_petrified1_Iteration9_Loop [2025-04-26 16:56:30,161 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:30,161 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:30,161 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:30,180 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:30,180 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:56:30,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:30,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:30,182 INFO L229 MonitoredProcess]: Starting monitored process 45 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:56:30,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2025-04-26 16:56:30,184 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:30,184 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:30,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:30,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:30,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:30,202 INFO L229 MonitoredProcess]: Starting monitored process 46 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:56:30,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2025-04-26 16:56:30,204 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:56:30,204 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:30,225 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:56:30,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2025-04-26 16:56:30,229 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:30,229 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:30,230 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:30,230 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:30,230 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:30,230 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:30,230 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:30,230 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:30,230 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_2_seq_1.c.bpl_petrified1_Iteration9_Loop [2025-04-26 16:56:30,230 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:30,230 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:30,230 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:30,249 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:30,249 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:30,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:30,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:30,251 INFO L229 MonitoredProcess]: Starting monitored process 47 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:56:30,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2025-04-26 16:56:30,252 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:56:30,262 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:30,262 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:56:30,262 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:30,262 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:30,262 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:30,263 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:56:30,263 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:56:30,264 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:30,266 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:56:30,266 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:56:30,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:30,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:30,268 INFO L229 MonitoredProcess]: Starting monitored process 48 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:56:30,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2025-04-26 16:56:30,269 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:30,272 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2025-04-26 16:56:30,272 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:56:30,272 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:30,273 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z1) = -1*z1 Supporting invariants [] [2025-04-26 16:56:30,278 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2025-04-26 16:56:30,279 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:56:30,291 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:30,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:56:30,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:56:30,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:30,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:30,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:30,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:30,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:30,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:30,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:30,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:30,311 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:30,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:30,318 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:56:30,319 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:56:30,319 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 402 states and 683 transitions. cyclomatic complexity: 347 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 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:56:30,337 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 402 states and 683 transitions. cyclomatic complexity: 347. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 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) Result 566 states and 1012 transitions. Complement of second has 6 states. [2025-04-26 16:56:30,337 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:56:30,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 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:56:30,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 68 transitions. [2025-04-26 16:56:30,338 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 68 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 16:56:30,339 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:30,339 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 68 transitions. Stem has 8 letters. Loop has 2 letters. [2025-04-26 16:56:30,339 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:30,339 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 68 transitions. Stem has 6 letters. Loop has 4 letters. [2025-04-26 16:56:30,339 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:30,339 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 566 states and 1012 transitions. [2025-04-26 16:56:30,343 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2025-04-26 16:56:30,344 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 566 states to 352 states and 607 transitions. [2025-04-26 16:56:30,344 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 87 [2025-04-26 16:56:30,344 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95 [2025-04-26 16:56:30,344 INFO L74 IsDeterministic]: Start isDeterministic. Operand 352 states and 607 transitions. [2025-04-26 16:56:30,344 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:30,344 INFO L218 hiAutomatonCegarLoop]: Abstraction has 352 states and 607 transitions. [2025-04-26 16:56:30,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states and 607 transitions. [2025-04-26 16:56:30,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 338. [2025-04-26 16:56:30,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 338 states have (on average 1.7366863905325445) internal successors, (in total 587), 337 states have internal predecessors, (587), 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:56:30,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 587 transitions. [2025-04-26 16:56:30,349 INFO L240 hiAutomatonCegarLoop]: Abstraction has 338 states and 587 transitions. [2025-04-26 16:56:30,349 INFO L438 stractBuchiCegarLoop]: Abstraction has 338 states and 587 transitions. [2025-04-26 16:56:30,349 INFO L340 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-04-26 16:56:30,349 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 338 states and 587 transitions. [2025-04-26 16:56:30,350 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2025-04-26 16:56:30,350 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:30,350 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:30,351 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:56:30,351 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:56:30,351 INFO L752 eck$LassoCheckResult]: Stem: "[155] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[118] $Ultimate##0-->L27: Formula: (<= 1 v_b_1) InVars {b=v_b_1} OutVars{b=v_b_1} AuxVars[] AssignedVars[]" "[120] L27-->L35-2: Formula: (= v_t_1 1) InVars {} OutVars{t=v_t_1} AuxVars[] AssignedVars[t]" "[122] L35-2-->L44: Formula: (< v_n_3 v_x1_6) InVars {x1=v_x1_6, n=v_n_3} OutVars{x1=v_x1_6, n=v_n_3} AuxVars[] AssignedVars[]" "[158] L16-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[139] $Ultimate##0-->L67: Formula: (<= 1 v_b_7) InVars {b=v_b_7} OutVars{b=v_b_7} AuxVars[] AssignedVars[]" "[124] L44-->L47-2: Formula: (= v_t1_2 v_t_5) InVars {t=v_t_5} OutVars{t1=v_t1_2, t=v_t_5} AuxVars[] AssignedVars[t1]" "[127] L47-2-->L56-1: Formula: (< v_n_1 v_x3_3) InVars {n=v_n_1, x3=v_x3_3} OutVars{n=v_n_1, x3=v_x3_3} AuxVars[] AssignedVars[]" "[131] L56-1-->thread1FINAL: Formula: (<= 0 v_z1_4) InVars {z1=v_z1_4} OutVars{z1=v_z1_4} AuxVars[] AssignedVars[]" "[141] L67-->L75-2: Formula: (= v_t_6 1) InVars {} OutVars{t=v_t_6} AuxVars[] AssignedVars[t]" "[143] L75-2-->L84-1: Formula: (< v_n_5 v_x2_1) InVars {x2=v_x2_1, n=v_n_5} OutVars{x2=v_x2_1, n=v_n_5} AuxVars[] AssignedVars[]" [2025-04-26 16:56:30,352 INFO L754 eck$LassoCheckResult]: Loop: "[146] L84-1-->L86: Formula: (< v_z2_1 0) InVars {z2=v_z2_1} OutVars{z2=v_z2_1} AuxVars[] AssignedVars[]" "[150] L86-->L84-1: Formula: (= v_z2_2 (+ v_z2_3 1)) InVars {z2=v_z2_3} OutVars{z2=v_z2_2} AuxVars[] AssignedVars[z2]" [2025-04-26 16:56:30,352 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:30,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1673575095, now seen corresponding path program 1 times [2025-04-26 16:56:30,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:30,352 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920067127] [2025-04-26 16:56:30,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:30,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:30,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:56:30,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:56:30,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:30,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:30,355 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:30,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:56:30,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:56:30,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:30,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:30,358 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:30,358 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:30,358 INFO L85 PathProgramCache]: Analyzing trace with hash 5637, now seen corresponding path program 1 times [2025-04-26 16:56:30,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:30,358 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835799797] [2025-04-26 16:56:30,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:30,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:30,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:30,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:30,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:30,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:30,359 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:30,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:30,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:30,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:30,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:30,360 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:30,361 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:30,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1987902267, now seen corresponding path program 1 times [2025-04-26 16:56:30,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:30,361 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969018570] [2025-04-26 16:56:30,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:30,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:30,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:56:30,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:56:30,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:30,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:30,363 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:30,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:56:30,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:56:30,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:30,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:30,366 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:30,379 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:30,379 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:30,379 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:30,379 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:30,379 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:56:30,379 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:30,379 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:30,379 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:30,379 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_2_seq_1.c.bpl_petrified1_Iteration10_Loop [2025-04-26 16:56:30,379 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:30,379 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:30,380 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:30,389 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:30,389 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:56:30,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:30,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:30,391 INFO L229 MonitoredProcess]: Starting monitored process 49 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:56:30,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2025-04-26 16:56:30,394 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:30,394 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:30,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2025-04-26 16:56:30,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:30,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:30,412 INFO L229 MonitoredProcess]: Starting monitored process 50 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:56:30,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2025-04-26 16:56:30,414 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:56:30,414 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:30,434 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:56:30,438 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2025-04-26 16:56:30,438 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:30,438 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:30,438 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:30,438 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:30,438 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:30,438 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:30,438 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:30,438 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:30,438 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_2_seq_1.c.bpl_petrified1_Iteration10_Loop [2025-04-26 16:56:30,438 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:30,438 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:30,439 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:30,449 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:30,449 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:30,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:30,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:30,451 INFO L229 MonitoredProcess]: Starting monitored process 51 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:56:30,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2025-04-26 16:56:30,453 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:56:30,462 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:30,462 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:56:30,462 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:30,462 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:30,462 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:30,463 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:56:30,463 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:56:30,464 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:30,466 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:56:30,466 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:56:30,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:30,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:30,469 INFO L229 MonitoredProcess]: Starting monitored process 52 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:56:30,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2025-04-26 16:56:30,471 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:30,474 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:30,475 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:56:30,475 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:30,475 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z2) = -1*z2 Supporting invariants [] [2025-04-26 16:56:30,481 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2025-04-26 16:56:30,481 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:56:30,488 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:30,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:56:30,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:56:30,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:30,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:30,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:30,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:30,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:30,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:30,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:30,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:30,513 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:30,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:30,522 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:56:30,522 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:56:30,522 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 338 states and 587 transitions. cyclomatic complexity: 294 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 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:56:30,539 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 338 states and 587 transitions. cyclomatic complexity: 294. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 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 455 states and 800 transitions. Complement of second has 6 states. [2025-04-26 16:56:30,539 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:56:30,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 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:56:30,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2025-04-26 16:56:30,539 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 82 transitions. Stem has 11 letters. Loop has 2 letters. [2025-04-26 16:56:30,540 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:30,540 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 82 transitions. Stem has 13 letters. Loop has 2 letters. [2025-04-26 16:56:30,540 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:30,540 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 82 transitions. Stem has 11 letters. Loop has 4 letters. [2025-04-26 16:56:30,540 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:30,540 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 455 states and 800 transitions. [2025-04-26 16:56:30,542 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:56:30,542 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 455 states to 0 states and 0 transitions. [2025-04-26 16:56:30,542 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:56:30,542 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:56:30,542 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:56:30,542 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:56:30,542 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:56:30,542 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:56:30,542 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:56:30,542 INFO L340 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-04-26 16:56:30,542 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:56:30,542 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:56:30,542 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:56:30,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:30,577 INFO L201 PluginConnector]: Adding new model adfg_2_seq_1.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:56:30 BoogieIcfgContainer [2025-04-26 16:56:30,577 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:56:30,577 INFO L158 Benchmark]: Toolchain (without parser) took 5455.79ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 86.3MB in the beginning and 74.9MB in the end (delta: 11.4MB). Peak memory consumption was 5.9MB. Max. memory is 8.0GB. [2025-04-26 16:56:30,578 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.89ms. Allocated memory is still 159.4MB. Free memory is still 87.1MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:56:30,578 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.18ms. Allocated memory is still 159.4MB. Free memory was 86.3MB in the beginning and 84.3MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:56:30,578 INFO L158 Benchmark]: Boogie Preprocessor took 25.85ms. Allocated memory is still 159.4MB. Free memory was 84.3MB in the beginning and 83.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:56:30,578 INFO L158 Benchmark]: RCFGBuilder took 161.45ms. Allocated memory is still 159.4MB. Free memory was 83.3MB in the beginning and 73.5MB in the end (delta: 9.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 16:56:30,578 INFO L158 Benchmark]: BuchiAutomizer took 5223.38ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 73.5MB in the beginning and 74.9MB in the end (delta: -1.4MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:56:30,579 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.89ms. Allocated memory is still 159.4MB. Free memory is still 87.1MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.18ms. Allocated memory is still 159.4MB. Free memory was 86.3MB in the beginning and 84.3MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 25.85ms. Allocated memory is still 159.4MB. Free memory was 84.3MB in the beginning and 83.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 161.45ms. Allocated memory is still 159.4MB. Free memory was 83.3MB in the beginning and 73.5MB in the end (delta: 9.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 5223.38ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 73.5MB in the beginning and 74.9MB in the end (delta: -1.4MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.1s and 11 iterations. TraceHistogramMax:1. Analysis of lassos took 3.4s. Construction of modules took 0.2s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 9. Automata minimization 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 889 StatesRemovedByMinimization, 9 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 [8, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 661 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 659 mSDsluCounter, 913 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 386 mSDsCounter, 49 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 361 IncrementalHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 49 mSolverCounterUnsat, 527 mSDtfsCounter, 361 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc1 concLT0 SILN1 SILU0 SILI0 SILT0 lasso6 LassoPreprocessingBenchmarks: Lassos: inital24 mio100 ax100 hnf100 lsp65 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq169 hnf94 smp100 dnf100 smp100 tf102 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 50ms VariablesStem: 1 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 10 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 8 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.2s InitialAbstractionConstructionTime: 0.2s InitialAbstraction: Time to compute Ample Reduction [ms]: 272, Number of transitions in reduction automaton: 327, Number of states in reduction automaton: 180, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 10 terminating modules (2 trivial, 8 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 2 * n + -2 * x1 + t and consists of 5 locations. One deterministic module has affine ranking function 2 * n + -2 * x1 + 1 and consists of 4 locations. One deterministic module has affine ranking function -1 * x3 + x1 and consists of 7 locations. One deterministic module has affine ranking function 2 * n + -2 * x2 + t and consists of 4 locations. One deterministic module has affine ranking function -1 * x3 + x1 and consists of 7 locations. One deterministic module has affine ranking function 2 * n + -2 * x2 + 1 and consists of 4 locations. One deterministic module has affine ranking function -1 * z1 and consists of 4 locations. One deterministic module has affine ranking function -1 * z2 and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 3 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:56:30,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...