/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/1_thr/adfg_1.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:56:23,685 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:56:23,734 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:56:23,739 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:56:23,739 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:56:23,739 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:23,739 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:56:23,760 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:56:23,761 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:56:23,761 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:56:23,761 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:56:23,761 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:56:23,761 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:56:23,761 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:56:23,761 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:56:23,762 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:56:23,762 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:56:23,762 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:56:23,762 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:56:23,762 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:56:23,762 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:56:23,762 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:56:23,762 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:56:23,762 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:56:23,762 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:56:23,762 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:56:23,762 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:56:23,762 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:56:23,762 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:56:23,764 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:56:23,764 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:56:23,764 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:56:23,764 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:56:23,765 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:56:23,765 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:56:23,765 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:56:23,765 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:56:23,765 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:56:23,765 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:56:23,765 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:56:23,765 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:56:23,765 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:56:23,765 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:56:23,982 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:56:23,989 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:56:23,990 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:56:23,991 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:56:23,993 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:56:23,995 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/1_thr/adfg_1.c.bpl [2025-04-26 16:56:23,996 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/1_thr/adfg_1.c.bpl' [2025-04-26 16:56:24,009 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:56:24,010 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:56:24,011 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:56:24,011 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:56:24,012 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:56:24,018 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "adfg_1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:24" (1/1) ... [2025-04-26 16:56:24,037 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "adfg_1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:24" (1/1) ... [2025-04-26 16:56:24,041 INFO L138 Inliner]: procedures = 2, calls = 1, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:56:24,042 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:56:24,043 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:56:24,043 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:56:24,043 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:56:24,048 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "adfg_1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:24" (1/1) ... [2025-04-26 16:56:24,049 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "adfg_1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:24" (1/1) ... [2025-04-26 16:56:24,049 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "adfg_1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:24" (1/1) ... [2025-04-26 16:56:24,049 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "adfg_1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:24" (1/1) ... [2025-04-26 16:56:24,052 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "adfg_1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:24" (1/1) ... [2025-04-26 16:56:24,052 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "adfg_1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:24" (1/1) ... [2025-04-26 16:56:24,057 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "adfg_1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:24" (1/1) ... [2025-04-26 16:56:24,057 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "adfg_1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:24" (1/1) ... [2025-04-26 16:56:24,057 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "adfg_1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:24" (1/1) ... [2025-04-26 16:56:24,068 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:56:24,069 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:56:24,069 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:56:24,069 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:56:24,069 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "adfg_1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:24" (1/1) ... [2025-04-26 16:56:24,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:56:24,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:24,094 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:24,098 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:24,117 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:56:24,117 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:56:24,117 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:56:24,117 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:56:24,117 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:56:24,117 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:56:24,118 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:24,155 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:56:24,156 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:56:24,223 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:56:24,223 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:56:24,231 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:56:24,231 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:56:24,232 INFO L201 PluginConnector]: Adding new model adfg_1.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:56:24 BoogieIcfgContainer [2025-04-26 16:56:24,232 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:56:24,232 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:56:24,232 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:56:24,238 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:56:24,239 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:56:24,239 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "adfg_1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:24" (1/2) ... [2025-04-26 16:56:24,240 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7fe96622 and model type adfg_1.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:56:24, skipping insertion in model container [2025-04-26 16:56:24,240 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:56:24,240 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "adfg_1.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:56:24" (2/2) ... [2025-04-26 16:56:24,241 INFO L376 chiAutomizerObserver]: Analyzing ICFG adfg_1.c.bpl [2025-04-26 16:56:24,276 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-04-26 16:56:24,323 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:56:24,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:56:24,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:24,325 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:24,327 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:24,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 16 places, 16 transitions, 39 flow [2025-04-26 16:56:24,378 INFO L116 PetriNetUnfolderBase]: 3/14 cut-off events. [2025-04-26 16:56:24,379 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-26 16:56:24,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19 conditions, 14 events. 3/14 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 12 event pairs, 0 based on Foata normal form. 0/11 useless extension candidates. Maximal degree in co-relation 11. Up to 4 conditions per place. [2025-04-26 16:56:24,381 INFO L82 GeneralOperation]: Start removeDead. Operand has 16 places, 16 transitions, 39 flow [2025-04-26 16:56:24,384 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 15 places, 14 transitions, 34 flow [2025-04-26 16:56:24,384 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 15 places, 14 transitions, 34 flow [2025-04-26 16:56:24,388 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:56:24,394 WARN L140 AmpleReduction]: Number of pruned transitions: 0 [2025-04-26 16:56:24,394 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 16:56:24,394 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 0 [2025-04-26 16:56:24,394 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:11 [2025-04-26 16:56:24,394 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:0 [2025-04-26 16:56:24,394 WARN L145 AmpleReduction]: Times succ was already a loop node:2 [2025-04-26 16:56:24,394 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 16:56:24,394 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:56:24,396 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (in total 14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:24,400 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:56:24,400 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:56:24,400 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:56:24,400 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:56:24,400 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:56:24,401 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:56:24,401 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:56:24,401 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:56:24,402 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (in total 14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:24,409 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-04-26 16:56:24,410 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:24,410 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:24,412 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:56:24,412 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:56:24,413 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:56:24,413 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (in total 14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:24,413 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-04-26 16:56:24,413 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:24,413 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:24,413 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:56:24,413 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:56:24,418 INFO L752 eck$LassoCheckResult]: Stem: "[52] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[39] $Ultimate##0-->L22: Formula: (<= 1 v_b_2) InVars {b=v_b_2} OutVars{b=v_b_2} AuxVars[] AssignedVars[]" "[41] L22-->L30-2: Formula: (= v_t_2 1) InVars {} OutVars{t=v_t_2} AuxVars[] AssignedVars[t]" [2025-04-26 16:56:24,419 INFO L754 eck$LassoCheckResult]: Loop: "[44] L30-2-->L30: Formula: (<= v_x1_4 v_n_2) InVars {x1=v_x1_4, n=v_n_2} OutVars{x1=v_x1_4, n=v_n_2} AuxVars[] AssignedVars[]" "[46] L30-->L32: Formula: (<= 1 v_b_4) InVars {b=v_b_4} OutVars{b=v_b_4} AuxVars[] AssignedVars[]" "[48] L32-->L30-2: Formula: (= v_x1_5 (+ v_x1_6 v_t_4)) InVars {x1=v_x1_6, t=v_t_4} OutVars{x1=v_x1_5, t=v_t_4} AuxVars[] AssignedVars[x1]" [2025-04-26 16:56:24,422 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:24,422 INFO L85 PathProgramCache]: Analyzing trace with hash 81013, now seen corresponding path program 1 times [2025-04-26 16:56:24,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:24,428 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126993724] [2025-04-26 16:56:24,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:24,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:24,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:24,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:24,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:24,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:24,479 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:24,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:24,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:24,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:24,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:24,489 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:24,495 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:24,496 INFO L85 PathProgramCache]: Analyzing trace with hash 73549, now seen corresponding path program 1 times [2025-04-26 16:56:24,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:24,496 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236015381] [2025-04-26 16:56:24,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:24,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:24,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:24,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:24,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:24,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:24,503 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:24,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:24,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:24,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:24,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:24,511 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:24,512 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:24,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1881465255, now seen corresponding path program 1 times [2025-04-26 16:56:24,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:24,512 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358331994] [2025-04-26 16:56:24,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:24,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:24,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:56:24,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:56:24,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:24,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:24,517 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:24,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:56:24,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:56:24,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:24,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:24,521 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:24,599 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:24,599 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:24,600 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:24,600 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:24,600 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:56:24,600 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:24,600 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:24,600 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:24,600 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_1.c.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:56:24,600 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:24,600 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:24,610 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:24,620 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:24,624 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:24,664 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:24,664 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:56:24,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:24,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:24,667 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:24,670 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:24,670 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:24,671 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:24,691 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:24,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:24,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:24,693 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:24,695 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:24,696 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:56:24,696 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:24,843 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:56:24,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:24,849 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:24,850 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:24,850 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:24,850 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:24,850 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:24,850 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:24,850 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:24,850 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:24,850 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_1.c.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:56:24,850 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:24,850 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:24,852 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:24,856 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:24,862 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:24,898 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:24,901 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:24,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:24,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:24,904 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:24,904 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:24,905 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:24,916 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:24,916 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:24,916 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:24,917 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:24,936 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:24,936 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:24,943 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:24,948 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:24,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:24,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:24,950 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:24,951 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:24,953 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:24,963 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:24,963 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:24,963 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:24,963 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:24,970 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:24,970 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:24,976 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:24,982 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:56:24,983 INFO L437 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:56:24,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:24,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:25,010 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:25,012 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:25,013 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:25,031 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:25,032 INFO L439 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-04-26 16:56:25,032 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:25,032 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, n) = -2*x1 + 2*n + 1 Supporting invariants [1*t - 1 >= 0] [2025-04-26 16:56:25,039 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:25,046 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:56:25,082 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:25,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:25,103 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,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:25,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:25,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-26 16:56:25,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:25,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:25,118 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,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:25,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:25,118 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:56:25,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:25,156 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:25,195 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:25,197 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (in total 14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) 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:25,299 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (in total 14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0). 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 36 states and 43 transitions. Complement of second has 7 states. [2025-04-26 16:56:25,300 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:25,302 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:25,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2025-04-26 16:56:25,306 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 3 letters. Loop has 3 letters. [2025-04-26 16:56:25,306 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:25,306 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 6 letters. Loop has 3 letters. [2025-04-26 16:56:25,306 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:25,306 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 3 letters. Loop has 6 letters. [2025-04-26 16:56:25,306 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:25,307 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 43 transitions. [2025-04-26 16:56:25,308 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2025-04-26 16:56:25,309 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 18 states and 23 transitions. [2025-04-26 16:56:25,310 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2025-04-26 16:56:25,310 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2025-04-26 16:56:25,310 INFO L74 IsDeterministic]: Start isDeterministic. Operand 18 states and 23 transitions. [2025-04-26 16:56:25,310 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:25,310 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 23 transitions. [2025-04-26 16:56:25,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 23 transitions. [2025-04-26 16:56:25,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 13. [2025-04-26 16:56:25,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (in total 17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:25,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2025-04-26 16:56:25,324 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 17 transitions. [2025-04-26 16:56:25,324 INFO L438 stractBuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2025-04-26 16:56:25,324 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:56:25,324 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2025-04-26 16:56:25,325 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-04-26 16:56:25,325 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:25,325 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:25,325 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:56:25,325 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:56:25,325 INFO L752 eck$LassoCheckResult]: Stem: "[52] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[40] $Ultimate##0-->L26: Formula: (< v_b_3 1) InVars {b=v_b_3} OutVars{b=v_b_3} AuxVars[] AssignedVars[]" "[42] L26-->L30-2: Formula: (= (+ v_t_3 1) 0) InVars {} OutVars{t=v_t_3} AuxVars[] AssignedVars[t]" [2025-04-26 16:56:25,326 INFO L754 eck$LassoCheckResult]: Loop: "[44] L30-2-->L30: Formula: (<= v_x1_4 v_n_2) InVars {x1=v_x1_4, n=v_n_2} OutVars{x1=v_x1_4, n=v_n_2} AuxVars[] AssignedVars[]" "[47] L30-->L36: Formula: (< v_b_1 1) InVars {b=v_b_1} OutVars{b=v_b_1} AuxVars[] AssignedVars[]" "[49] L36-->L30-2: Formula: (= v_x1_2 (+ v_x1_1 v_t_1)) InVars {x1=v_x1_2, t=v_t_1} OutVars{x1=v_x1_1, t=v_t_1} AuxVars[] AssignedVars[x1]" [2025-04-26 16:56:25,326 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:25,326 INFO L85 PathProgramCache]: Analyzing trace with hash 81045, now seen corresponding path program 1 times [2025-04-26 16:56:25,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:25,326 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299339575] [2025-04-26 16:56:25,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:25,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:25,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:25,329 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,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:25,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:25,329 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:25,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:25,330 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,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:25,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:25,331 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:25,331 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:25,331 INFO L85 PathProgramCache]: Analyzing trace with hash 73581, now seen corresponding path program 1 times [2025-04-26 16:56:25,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:25,331 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46117195] [2025-04-26 16:56:25,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:25,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:25,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:25,333 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,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:25,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:25,334 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:25,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:25,335 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,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:25,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:25,335 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:25,336 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:25,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1880511911, now seen corresponding path program 1 times [2025-04-26 16:56:25,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:25,336 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73036859] [2025-04-26 16:56:25,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:25,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:25,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:56:25,338 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,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:25,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:25,339 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:25,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:56:25,340 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,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:25,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:25,341 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:25,374 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:25,375 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:25,375 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:25,375 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:25,375 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:56:25,375 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:25,375 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:25,375 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:25,375 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_1.c.bpl_petrified1_Iteration2_Lasso [2025-04-26 16:56:25,375 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:25,375 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:25,376 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:25,381 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:25,388 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:25,418 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:25,418 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:56:25,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:25,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:25,420 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:25,422 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:25,423 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:25,423 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:25,434 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:56:25,434 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:25,441 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:25,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:25,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:25,443 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:25,444 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:25,445 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:25,445 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:25,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:25,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:25,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:25,465 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:25,465 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:25,469 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:56:25,469 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:25,598 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:56:25,604 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:25,605 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:25,605 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:25,605 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:25,605 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:25,605 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:25,605 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:25,605 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:25,605 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:25,605 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_1.c.bpl_petrified1_Iteration2_Lasso [2025-04-26 16:56:25,605 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:25,605 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:25,606 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:25,609 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:25,622 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:25,654 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:25,654 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:25,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:25,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:25,656 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:25,657 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:25,658 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:25,668 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:25,669 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:25,669 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:25,669 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:25,671 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:25,671 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:25,675 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:25,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:25,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:25,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:25,683 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:25,684 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:25,686 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:25,696 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:25,697 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:25,697 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:25,697 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:25,702 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:25,703 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:25,707 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:25,714 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:56:25,714 INFO L437 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:56:25,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:25,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:25,717 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:25,719 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:25,720 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:25,736 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:25,736 INFO L439 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-04-26 16:56:25,736 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:25,736 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, n) = -2*x1 + 2*n + 1 Supporting invariants [-1*t - 1 >= 0] [2025-04-26 16:56:25,742 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-04-26 16:56:25,745 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:56:25,769 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:25,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:25,773 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,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:25,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:25,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-26 16:56:25,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:25,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:25,780 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,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:25,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:25,780 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:56:25,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:25,803 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:25,804 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:25,804 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 6 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:25,834 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 6. 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 25 states and 32 transitions. Complement of second has 5 states. [2025-04-26 16:56:25,835 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:56:25,838 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:25,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2025-04-26 16:56:25,838 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 3 letters. Loop has 3 letters. [2025-04-26 16:56:25,838 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:25,838 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 6 letters. Loop has 3 letters. [2025-04-26 16:56:25,838 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:25,838 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 3 letters. Loop has 6 letters. [2025-04-26 16:56:25,838 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:25,838 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 32 transitions. [2025-04-26 16:56:25,839 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2025-04-26 16:56:25,839 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 23 states and 30 transitions. [2025-04-26 16:56:25,839 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2025-04-26 16:56:25,839 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2025-04-26 16:56:25,840 INFO L74 IsDeterministic]: Start isDeterministic. Operand 23 states and 30 transitions. [2025-04-26 16:56:25,840 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:25,840 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23 states and 30 transitions. [2025-04-26 16:56:25,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 30 transitions. [2025-04-26 16:56:25,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 18. [2025-04-26 16:56:25,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (in total 24), 17 states have internal predecessors, (24), 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,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2025-04-26 16:56:25,841 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 24 transitions. [2025-04-26 16:56:25,841 INFO L438 stractBuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2025-04-26 16:56:25,841 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:56:25,841 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 24 transitions. [2025-04-26 16:56:25,844 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-04-26 16:56:25,844 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:25,844 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:25,844 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:56:25,844 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:56:25,844 INFO L752 eck$LassoCheckResult]: Stem: "[52] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[39] $Ultimate##0-->L22: Formula: (<= 1 v_b_2) InVars {b=v_b_2} OutVars{b=v_b_2} AuxVars[] AssignedVars[]" "[41] L22-->L30-2: Formula: (= v_t_2 1) InVars {} OutVars{t=v_t_2} AuxVars[] AssignedVars[t]" "[44] L30-2-->L30: Formula: (<= v_x1_4 v_n_2) InVars {x1=v_x1_4, n=v_n_2} OutVars{x1=v_x1_4, n=v_n_2} AuxVars[] AssignedVars[]" "[47] L30-->L36: Formula: (< v_b_1 1) InVars {b=v_b_1} OutVars{b=v_b_1} AuxVars[] AssignedVars[]" [2025-04-26 16:56:25,845 INFO L754 eck$LassoCheckResult]: Loop: "[49] L36-->L30-2: Formula: (= v_x1_2 (+ v_x1_1 v_t_1)) InVars {x1=v_x1_2, t=v_t_1} OutVars{x1=v_x1_1, t=v_t_1} AuxVars[] AssignedVars[x1]" "[44] L30-2-->L30: Formula: (<= v_x1_4 v_n_2) InVars {x1=v_x1_4, n=v_n_2} OutVars{x1=v_x1_4, n=v_n_2} AuxVars[] AssignedVars[]" "[47] L30-->L36: Formula: (< v_b_1 1) InVars {b=v_b_1} OutVars{b=v_b_1} AuxVars[] AssignedVars[]" [2025-04-26 16:56:25,845 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:25,845 INFO L85 PathProgramCache]: Analyzing trace with hash 77854904, now seen corresponding path program 1 times [2025-04-26 16:56:25,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:25,845 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076023027] [2025-04-26 16:56:25,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:25,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:25,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:56:25,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:56:25,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:25,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:25,878 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:25,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:56:25,879 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076023027] [2025-04-26 16:56:25,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076023027] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:56:25,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:56:25,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:56:25,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037532471] [2025-04-26 16:56:25,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:56:25,882 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:56:25,883 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:25,883 INFO L85 PathProgramCache]: Analyzing trace with hash 78291, now seen corresponding path program 2 times [2025-04-26 16:56:25,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:25,883 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647766176] [2025-04-26 16:56:25,883 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:56:25,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:25,886 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:25,890 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:25,891 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:56:25,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:25,891 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:25,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:25,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:25,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:25,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:25,899 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:25,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:56:25,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:56:25,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:56:25,919 INFO L87 Difference]: Start difference. First operand 18 states and 24 transitions. cyclomatic complexity: 9 Second operand has 3 states, 2 states have (on average 2.5) 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:25,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:56:25,930 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2025-04-26 16:56:25,930 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 21 transitions. [2025-04-26 16:56:25,930 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-04-26 16:56:25,930 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 11 states and 13 transitions. [2025-04-26 16:56:25,931 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-04-26 16:56:25,931 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-04-26 16:56:25,931 INFO L74 IsDeterministic]: Start isDeterministic. Operand 11 states and 13 transitions. [2025-04-26 16:56:25,931 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:25,931 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11 states and 13 transitions. [2025-04-26 16:56:25,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 13 transitions. [2025-04-26 16:56:25,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2025-04-26 16:56:25,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.2) internal successors, (in total 12), 9 states have internal predecessors, (12), 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,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2025-04-26 16:56:25,932 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 12 transitions. [2025-04-26 16:56:25,933 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:56:25,934 INFO L438 stractBuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2025-04-26 16:56:25,934 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:56:25,934 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2025-04-26 16:56:25,934 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-04-26 16:56:25,934 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:25,934 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:25,934 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:56:25,934 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:56:25,935 INFO L752 eck$LassoCheckResult]: Stem: "[52] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[40] $Ultimate##0-->L26: Formula: (< v_b_3 1) InVars {b=v_b_3} OutVars{b=v_b_3} AuxVars[] AssignedVars[]" "[42] L26-->L30-2: Formula: (= (+ v_t_3 1) 0) InVars {} OutVars{t=v_t_3} AuxVars[] AssignedVars[t]" "[44] L30-2-->L30: Formula: (<= v_x1_4 v_n_2) InVars {x1=v_x1_4, n=v_n_2} OutVars{x1=v_x1_4, n=v_n_2} AuxVars[] AssignedVars[]" [2025-04-26 16:56:25,935 INFO L754 eck$LassoCheckResult]: Loop: "[46] L30-->L32: Formula: (<= 1 v_b_4) InVars {b=v_b_4} OutVars{b=v_b_4} AuxVars[] AssignedVars[]" "[48] L32-->L30-2: Formula: (= v_x1_5 (+ v_x1_6 v_t_4)) InVars {x1=v_x1_6, t=v_t_4} OutVars{x1=v_x1_5, t=v_t_4} AuxVars[] AssignedVars[x1]" "[44] L30-2-->L30: Formula: (<= v_x1_4 v_n_2) InVars {x1=v_x1_4, n=v_n_2} OutVars{x1=v_x1_4, n=v_n_2} AuxVars[] AssignedVars[]" [2025-04-26 16:56:25,935 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:25,935 INFO L85 PathProgramCache]: Analyzing trace with hash 2512439, now seen corresponding path program 1 times [2025-04-26 16:56:25,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:25,935 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884305131] [2025-04-26 16:56:25,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:25,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:25,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:25,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:25,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:25,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:25,939 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:25,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:25,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:25,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:25,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:25,943 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:25,943 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:25,943 INFO L85 PathProgramCache]: Analyzing trace with hash 75529, now seen corresponding path program 2 times [2025-04-26 16:56:25,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:25,943 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926525536] [2025-04-26 16:56:25,943 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:56:25,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:25,945 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:25,946 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:25,946 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:56:25,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:25,946 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:25,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:25,947 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,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:25,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:25,948 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:25,948 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:25,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1833671955, now seen corresponding path program 1 times [2025-04-26 16:56:25,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:25,948 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991538336] [2025-04-26 16:56:25,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:25,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:25,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:56:25,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:56:25,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:25,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:25,971 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:56:25,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:56:25,971 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991538336] [2025-04-26 16:56:25,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991538336] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:56:25,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:56:25,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 16:56:25,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740533231] [2025-04-26 16:56:25,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:56:25,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:56:25,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:56:25,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:56:25,990 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. cyclomatic complexity: 4 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 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,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:56:25,996 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2025-04-26 16:56:25,996 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8 states and 9 transitions. [2025-04-26 16:56:25,996 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:56:25,996 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8 states to 0 states and 0 transitions. [2025-04-26 16:56:25,997 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:56:25,997 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:56:25,997 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:56:25,997 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:56:25,997 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:56:25,997 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:56:25,997 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:56:25,998 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:56:25,998 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:56:25,998 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:56:25,998 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:56:25,998 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:56:26,010 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:26,011 INFO L201 PluginConnector]: Adding new model adfg_1.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:56:26 BoogieIcfgContainer [2025-04-26 16:56:26,011 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:56:26,012 INFO L158 Benchmark]: Toolchain (without parser) took 2001.33ms. Allocated memory was 167.8MB in the beginning and 125.8MB in the end (delta: -41.9MB). Free memory was 93.3MB in the beginning and 49.8MB in the end (delta: 43.6MB). Peak memory consumption was 1.2MB. Max. memory is 8.0GB. [2025-04-26 16:56:26,012 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.67ms. Allocated memory is still 167.8MB. Free memory is still 94.3MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:56:26,012 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.28ms. Allocated memory is still 167.8MB. Free memory was 93.3MB in the beginning and 91.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:56:26,012 INFO L158 Benchmark]: Boogie Preprocessor took 24.83ms. Allocated memory is still 167.8MB. Free memory was 91.5MB in the beginning and 90.6MB in the end (delta: 986.5kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:56:26,013 INFO L158 Benchmark]: RCFGBuilder took 163.37ms. Allocated memory is still 167.8MB. Free memory was 90.6MB in the beginning and 81.7MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:56:26,013 INFO L158 Benchmark]: BuchiAutomizer took 1778.84ms. Allocated memory was 167.8MB in the beginning and 125.8MB in the end (delta: -41.9MB). Free memory was 81.7MB in the beginning and 49.8MB in the end (delta: 32.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:56:26,015 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.67ms. Allocated memory is still 167.8MB. Free memory is still 94.3MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.28ms. Allocated memory is still 167.8MB. Free memory was 93.3MB in the beginning and 91.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 24.83ms. Allocated memory is still 167.8MB. Free memory was 91.5MB in the beginning and 90.6MB in the end (delta: 986.5kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 163.37ms. Allocated memory is still 167.8MB. Free memory was 90.6MB in the beginning and 81.7MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 1778.84ms. Allocated memory was 167.8MB in the beginning and 125.8MB in the end (delta: -41.9MB). Free memory was 81.7MB in the beginning and 49.8MB in the end (delta: 32.0MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.6s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 1.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 11 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 42 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 42 mSDsluCounter, 50 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 29 IncrementalHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 39 mSDtfsCounter, 29 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN1 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital23 mio100 ax100 hnf100 lsp56 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq184 hnf95 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 40ms VariablesStem: 1 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s InitialAbstractionConstructionTime: 0.0s InitialAbstraction: Time to compute Ample Reduction [ms]: 75, Number of transitions in reduction automaton: 14, Number of states in reduction automaton: 12, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (2 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 2 * n + -2 * x1 + 1 and consists of 4 locations. One deterministic module has affine ranking function 2 * n + -2 * x1 + 1 and consists of 3 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:26,028 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...