/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf --buchiautomizer.automaton.type.for.concurrent.programs PARTIAL_ORDER_BA -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i /storage/cav23-termute-examples/2_thr/adfg_2_seq_1.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-601be74-m [2025-02-17 22:48:34,205 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-17 22:48:34,264 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf [2025-02-17 22:48:34,268 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-17 22:48:34,268 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-17 22:48:34,291 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-17 22:48:34,292 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-17 22:48:34,292 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-17 22:48:34,292 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-17 22:48:34,292 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-17 22:48:34,293 INFO L153 SettingsManager]: * Use SBE=true [2025-02-17 22:48:34,293 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-17 22:48:34,293 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-17 22:48:34,293 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-17 22:48:34,293 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-17 22:48:34,293 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-17 22:48:34,293 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-17 22:48:34,293 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-17 22:48:34,294 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-17 22:48:34,294 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-17 22:48:34,294 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-17 22:48:34,294 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-17 22:48:34,294 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-17 22:48:34,294 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-17 22:48:34,294 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-17 22:48:34,294 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-17 22:48:34,294 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-17 22:48:34,294 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-17 22:48:34,294 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-17 22:48:34,294 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-17 22:48:34,294 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-17 22:48:34,294 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-02-17 22:48:34,294 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-17 22:48:34,294 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-17 22:48:34,294 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-17 22:48:34,294 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-17 22:48:34,295 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> PARTIAL_ORDER_BA [2025-02-17 22:48:34,514 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-17 22:48:34,519 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-17 22:48:34,521 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-17 22:48:34,521 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-02-17 22:48:34,524 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-02-17 22:48:34,525 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/2_thr/adfg_2_seq_1.c.bpl [2025-02-17 22:48:34,526 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/2_thr/adfg_2_seq_1.c.bpl' [2025-02-17 22:48:34,539 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-17 22:48:34,540 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-02-17 22:48:34,541 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-17 22:48:34,541 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-17 22:48:34,541 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-17 22:48:34,548 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "adfg_2_seq_1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:34" (1/1) ... [2025-02-17 22:48:34,552 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "adfg_2_seq_1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:34" (1/1) ... [2025-02-17 22:48:34,557 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-02-17 22:48:34,558 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-17 22:48:34,559 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-17 22:48:34,559 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-17 22:48:34,560 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-17 22:48:34,564 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "adfg_2_seq_1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:34" (1/1) ... [2025-02-17 22:48:34,564 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "adfg_2_seq_1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:34" (1/1) ... [2025-02-17 22:48:34,564 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "adfg_2_seq_1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:34" (1/1) ... [2025-02-17 22:48:34,565 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "adfg_2_seq_1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:34" (1/1) ... [2025-02-17 22:48:34,566 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "adfg_2_seq_1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:34" (1/1) ... [2025-02-17 22:48:34,566 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "adfg_2_seq_1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:34" (1/1) ... [2025-02-17 22:48:34,570 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "adfg_2_seq_1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:34" (1/1) ... [2025-02-17 22:48:34,570 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "adfg_2_seq_1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:34" (1/1) ... [2025-02-17 22:48:34,571 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "adfg_2_seq_1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:34" (1/1) ... [2025-02-17 22:48:34,573 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-17 22:48:34,574 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-02-17 22:48:34,574 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-02-17 22:48:34,574 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-02-17 22:48:34,578 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "adfg_2_seq_1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:34" (1/1) ... [2025-02-17 22:48:34,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:34,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:34,604 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:48:34,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-02-17 22:48:34,629 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-02-17 22:48:34,629 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-17 22:48:34,630 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-17 22:48:34,630 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-02-17 22:48:34,630 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-17 22:48:34,630 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-17 22:48:34,630 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-02-17 22:48:34,630 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-17 22:48:34,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-17 22:48:34,631 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-17 22:48:34,668 INFO L234 CfgBuilder]: Building ICFG [2025-02-17 22:48:34,670 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-17 22:48:34,759 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-17 22:48:34,759 INFO L283 CfgBuilder]: Performing block encoding [2025-02-17 22:48:34,768 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-17 22:48:34,769 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-17 22:48:34,769 INFO L201 PluginConnector]: Adding new model adfg_2_seq_1.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 10:48:34 BoogieIcfgContainer [2025-02-17 22:48:34,769 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-02-17 22:48:34,770 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-17 22:48:34,770 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-17 22:48:34,773 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-17 22:48:34,774 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-17 22:48:34,774 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "adfg_2_seq_1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:34" (1/2) ... [2025-02-17 22:48:34,775 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@42c4e799 and model type adfg_2_seq_1.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.02 10:48:34, skipping insertion in model container [2025-02-17 22:48:34,775 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-17 22:48:34,775 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "adfg_2_seq_1.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 10:48:34" (2/2) ... [2025-02-17 22:48:34,776 INFO L363 chiAutomizerObserver]: Analyzing ICFG adfg_2_seq_1.c.bpl [2025-02-17 22:48:34,825 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-17 22:48:34,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 44 transitions, 102 flow [2025-02-17 22:48:34,897 INFO L124 PetriNetUnfolderBase]: 10/40 cut-off events. [2025-02-17 22:48:34,899 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-17 22:48:34,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 40 events. 10/40 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 84 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 38. Up to 4 conditions per place. [2025-02-17 22:48:34,903 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 44 transitions, 102 flow [2025-02-17 22:48:34,908 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 40 transitions, 92 flow [2025-02-17 22:48:34,914 WARN L98 AmpleReduction]: Starting ample reduction [2025-02-17 22:48:35,318 INFO L100 AmpleReduction]: Finished ample reduction [2025-02-17 22:48:35,318 INFO L101 AmpleReduction]: Number of pruned transitions: 73, Number of non-trivial ample sets: 138 [2025-02-17 22:48:35,319 INFO L103 AmpleReduction]: Number of trivial ample sets caused by loops: 170 [2025-02-17 22:48:35,324 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-17 22:48:35,325 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-17 22:48:35,325 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-17 22:48:35,325 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-17 22:48:35,325 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-17 22:48:35,325 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-17 22:48:35,325 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-17 22:48:35,325 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-17 22:48:35,328 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 180 states, 179 states have (on average 2.089385474860335) internal successors, (374), 179 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:35,345 INFO L131 ngComponentsAnalysis]: Automaton has 29 accepting balls. 136 [2025-02-17 22:48:35,345 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:48:35,345 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:48:35,349 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-17 22:48:35,350 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-17 22:48:35,350 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-17 22:48:35,351 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 180 states, 179 states have (on average 2.089385474860335) internal successors, (374), 179 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:35,356 INFO L131 ngComponentsAnalysis]: Automaton has 29 accepting balls. 136 [2025-02-17 22:48:35,356 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:48:35,356 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:48:35,357 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-17 22:48:35,357 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-17 22:48:35,360 INFO L752 eck$LassoCheckResult]: Stem: "[155] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[118] $Ultimate##0-->L27: Formula: (<= 1 v_b_1) InVars {b=v_b_1} OutVars{b=v_b_1} AuxVars[] AssignedVars[]" "[120] L27-->L35-2: Formula: (= v_t_1 1) InVars {} OutVars{t=v_t_1} AuxVars[] AssignedVars[t]" [2025-02-17 22:48:35,361 INFO L754 eck$LassoCheckResult]: Loop: "[123] L35-2-->L35: Formula: (<= v_x1_1 v_n_2) InVars {x1=v_x1_1, n=v_n_2} OutVars{x1=v_x1_1, n=v_n_2} AuxVars[] AssignedVars[]" "[126] L35-->L41: Formula: (< v_b_4 1) InVars {b=v_b_4} OutVars{b=v_b_4} AuxVars[] AssignedVars[]" "[130] L41-->L35-2: Formula: (= (+ v_x1_4 v_t_4) v_x1_5) InVars {x1=v_x1_5, t=v_t_4} OutVars{x1=v_x1_4, t=v_t_4} AuxVars[] AssignedVars[x1]" [2025-02-17 22:48:35,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:35,364 INFO L85 PathProgramCache]: Analyzing trace with hash 182524, now seen corresponding path program 1 times [2025-02-17 22:48:35,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:35,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419707124] [2025-02-17 22:48:35,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:35,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:35,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:35,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:35,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:35,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:35,422 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:35,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:35,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:35,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:35,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:35,462 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:35,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:35,466 INFO L85 PathProgramCache]: Analyzing trace with hash 152030, now seen corresponding path program 1 times [2025-02-17 22:48:35,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:35,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731262184] [2025-02-17 22:48:35,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:35,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:35,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:35,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:35,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:35,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:35,475 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:35,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:35,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:35,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:35,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:35,479 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:35,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:35,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1142727427, now seen corresponding path program 1 times [2025-02-17 22:48:35,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:35,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034434512] [2025-02-17 22:48:35,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:35,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:35,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:48:35,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:48:35,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:35,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:35,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:48:35,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-17 22:48:35,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034434512] [2025-02-17 22:48:35,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034434512] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-17 22:48:35,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-17 22:48:35,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-17 22:48:35,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997246138] [2025-02-17 22:48:35,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-17 22:48:35,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-17 22:48:35,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-17 22:48:35,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-17 22:48:35,578 INFO L87 Difference]: Start difference. First operand has 180 states, 179 states have (on average 2.089385474860335) internal successors, (374), 179 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:35,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-17 22:48:35,645 INFO L93 Difference]: Finished difference Result 276 states and 543 transitions. [2025-02-17 22:48:35,645 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 276 states and 543 transitions. [2025-02-17 22:48:35,649 INFO L131 ngComponentsAnalysis]: Automaton has 59 accepting balls. 205 [2025-02-17 22:48:35,662 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 276 states to 260 states and 519 transitions. [2025-02-17 22:48:35,662 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 260 [2025-02-17 22:48:35,663 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 260 [2025-02-17 22:48:35,664 INFO L73 IsDeterministic]: Start isDeterministic. Operand 260 states and 519 transitions. [2025-02-17 22:48:35,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-17 22:48:35,666 INFO L218 hiAutomatonCegarLoop]: Abstraction has 260 states and 519 transitions. [2025-02-17 22:48:35,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states and 519 transitions. [2025-02-17 22:48:35,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 246. [2025-02-17 22:48:35,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 246 states have (on average 2.0121951219512195) internal successors, (495), 245 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:35,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 495 transitions. [2025-02-17 22:48:35,726 INFO L240 hiAutomatonCegarLoop]: Abstraction has 246 states and 495 transitions. [2025-02-17 22:48:35,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-17 22:48:35,732 INFO L432 stractBuchiCegarLoop]: Abstraction has 246 states and 495 transitions. [2025-02-17 22:48:35,732 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-17 22:48:35,732 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 246 states and 495 transitions. [2025-02-17 22:48:35,734 INFO L131 ngComponentsAnalysis]: Automaton has 53 accepting balls. 191 [2025-02-17 22:48:35,734 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:48:35,734 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:48:35,739 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-17 22:48:35,739 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-17 22:48:35,739 INFO L752 eck$LassoCheckResult]: Stem: "[155] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[118] $Ultimate##0-->L27: Formula: (<= 1 v_b_1) InVars {b=v_b_1} OutVars{b=v_b_1} AuxVars[] AssignedVars[]" "[120] L27-->L35-2: Formula: (= v_t_1 1) InVars {} OutVars{t=v_t_1} AuxVars[] AssignedVars[t]" [2025-02-17 22:48:35,739 INFO L754 eck$LassoCheckResult]: Loop: "[123] L35-2-->L35: Formula: (<= v_x1_1 v_n_2) InVars {x1=v_x1_1, n=v_n_2} OutVars{x1=v_x1_1, n=v_n_2} AuxVars[] AssignedVars[]" "[125] L35-->L37: Formula: (<= 1 v_b_3) InVars {b=v_b_3} OutVars{b=v_b_3} AuxVars[] AssignedVars[]" "[129] L37-->L35-2: Formula: (= (+ v_x1_3 v_t_3) v_x1_2) InVars {x1=v_x1_3, t=v_t_3} OutVars{x1=v_x1_2, t=v_t_3} AuxVars[] AssignedVars[x1]" [2025-02-17 22:48:35,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:35,740 INFO L85 PathProgramCache]: Analyzing trace with hash 182524, now seen corresponding path program 2 times [2025-02-17 22:48:35,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:35,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638915211] [2025-02-17 22:48:35,740 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-17 22:48:35,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:35,746 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:35,747 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:35,747 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-17 22:48:35,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:35,748 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:35,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:35,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:35,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:35,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:35,751 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:35,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:35,752 INFO L85 PathProgramCache]: Analyzing trace with hash 151998, now seen corresponding path program 1 times [2025-02-17 22:48:35,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:35,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845537050] [2025-02-17 22:48:35,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:35,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:35,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:35,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:35,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:35,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:35,755 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:35,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:35,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:35,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:35,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:35,758 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:35,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:35,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1142727395, now seen corresponding path program 1 times [2025-02-17 22:48:35,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:35,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841865296] [2025-02-17 22:48:35,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:35,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:35,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:48:35,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:48:35,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:35,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:35,766 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:35,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:48:35,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:48:35,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:35,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:35,770 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:35,823 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:35,825 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:35,825 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:35,825 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:35,825 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:48:35,825 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:35,825 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:35,825 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:35,825 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_2_seq_1.c.bpl_petrified1_Iteration2_Lasso [2025-02-17 22:48:35,825 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:35,825 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:35,835 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:35,850 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:35,856 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:35,907 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:35,908 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:48:35,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:35,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:35,913 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:48:35,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-02-17 22:48:35,915 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:48:35,915 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:35,936 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-02-17 22:48:35,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:35,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:35,939 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-02-17 22:48:35,941 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-02-17 22:48:35,942 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:48:35,943 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:36,102 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:48:36,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-02-17 22:48:36,109 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:36,109 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:36,109 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:36,109 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:36,109 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:48:36,109 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:36,109 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:36,109 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:36,109 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_2_seq_1.c.bpl_petrified1_Iteration2_Lasso [2025-02-17 22:48:36,110 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:36,110 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:36,110 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:36,117 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:36,121 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:36,159 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:36,161 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:48:36,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:36,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:36,164 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-02-17 22:48:36,166 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-02-17 22:48:36,167 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-02-17 22:48:36,178 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:48:36,179 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:48:36,179 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:48:36,179 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:48:36,188 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-17 22:48:36,188 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-17 22:48:36,195 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:48:36,201 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:48:36,202 INFO L444 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:48:36,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:36,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:36,205 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-02-17 22:48:36,207 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-02-17 22:48:36,208 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:48:36,219 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-02-17 22:48:36,219 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:48:36,220 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(n, x1) = 2*n - 2*x1 + 1 Supporting invariants [1*t - 1 >= 0] [2025-02-17 22:48:36,225 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-02-17 22:48:36,230 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-02-17 22:48:36,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:36,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:36,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:36,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:36,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:36,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-17 22:48:36,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:36,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:36,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:36,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:36,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:36,281 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-17 22:48:36,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:36,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:48:36,314 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-02-17 22:48:36,315 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 246 states and 495 transitions. cyclomatic complexity: 302 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:36,408 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 246 states and 495 transitions. cyclomatic complexity: 302. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 487 states and 987 transitions. Complement of second has 6 states. [2025-02-17 22:48:36,410 INFO L141 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-02-17 22:48:36,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:36,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2025-02-17 22:48:36,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 83 transitions. Stem has 3 letters. Loop has 3 letters. [2025-02-17 22:48:36,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:36,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 83 transitions. Stem has 6 letters. Loop has 3 letters. [2025-02-17 22:48:36,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:36,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 83 transitions. Stem has 3 letters. Loop has 6 letters. [2025-02-17 22:48:36,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:36,415 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 487 states and 987 transitions. [2025-02-17 22:48:36,421 INFO L131 ngComponentsAnalysis]: Automaton has 76 accepting balls. 263 [2025-02-17 22:48:36,426 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 487 states to 403 states and 813 transitions. [2025-02-17 22:48:36,426 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 345 [2025-02-17 22:48:36,427 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 368 [2025-02-17 22:48:36,427 INFO L73 IsDeterministic]: Start isDeterministic. Operand 403 states and 813 transitions. [2025-02-17 22:48:36,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:48:36,427 INFO L218 hiAutomatonCegarLoop]: Abstraction has 403 states and 813 transitions. [2025-02-17 22:48:36,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states and 813 transitions. [2025-02-17 22:48:36,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 306. [2025-02-17 22:48:36,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 306 states have (on average 2.088235294117647) internal successors, (639), 305 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:36,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 639 transitions. [2025-02-17 22:48:36,441 INFO L240 hiAutomatonCegarLoop]: Abstraction has 306 states and 639 transitions. [2025-02-17 22:48:36,441 INFO L432 stractBuchiCegarLoop]: Abstraction has 306 states and 639 transitions. [2025-02-17 22:48:36,441 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-17 22:48:36,441 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 306 states and 639 transitions. [2025-02-17 22:48:36,442 INFO L131 ngComponentsAnalysis]: Automaton has 58 accepting balls. 203 [2025-02-17 22:48:36,442 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:48:36,442 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:48:36,442 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-17 22:48:36,443 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-17 22:48:36,443 INFO L752 eck$LassoCheckResult]: Stem: "[155] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[119] $Ultimate##0-->L31: Formula: (< v_b_2 1) InVars {b=v_b_2} OutVars{b=v_b_2} AuxVars[] AssignedVars[]" "[121] L31-->L35-2: Formula: (= (+ v_t_2 1) 0) InVars {} OutVars{t=v_t_2} AuxVars[] AssignedVars[t]" [2025-02-17 22:48:36,443 INFO L754 eck$LassoCheckResult]: Loop: "[123] L35-2-->L35: Formula: (<= v_x1_1 v_n_2) InVars {x1=v_x1_1, n=v_n_2} OutVars{x1=v_x1_1, n=v_n_2} AuxVars[] AssignedVars[]" "[126] L35-->L41: Formula: (< v_b_4 1) InVars {b=v_b_4} OutVars{b=v_b_4} AuxVars[] AssignedVars[]" "[130] L41-->L35-2: Formula: (= (+ v_x1_4 v_t_4) v_x1_5) InVars {x1=v_x1_5, t=v_t_4} OutVars{x1=v_x1_4, t=v_t_4} AuxVars[] AssignedVars[x1]" [2025-02-17 22:48:36,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:36,443 INFO L85 PathProgramCache]: Analyzing trace with hash 182556, now seen corresponding path program 1 times [2025-02-17 22:48:36,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:36,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002965692] [2025-02-17 22:48:36,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:36,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:36,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:36,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:36,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:36,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:36,447 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:36,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:36,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:36,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:36,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:36,449 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:36,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:36,449 INFO L85 PathProgramCache]: Analyzing trace with hash 152030, now seen corresponding path program 2 times [2025-02-17 22:48:36,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:36,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417817062] [2025-02-17 22:48:36,449 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-17 22:48:36,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:36,451 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:36,451 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:36,451 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-17 22:48:36,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:36,452 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:36,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:36,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:36,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:36,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:36,454 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:36,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:36,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1143680739, now seen corresponding path program 1 times [2025-02-17 22:48:36,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:36,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780597089] [2025-02-17 22:48:36,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:36,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:36,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:48:36,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:48:36,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:36,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:36,458 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:36,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:48:36,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:48:36,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:36,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:36,461 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:36,501 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:36,501 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:36,501 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:36,501 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:36,501 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:48:36,501 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:36,501 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:36,501 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:36,501 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_2_seq_1.c.bpl_petrified1_Iteration3_Lasso [2025-02-17 22:48:36,501 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:36,501 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:36,502 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:36,508 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:36,510 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:36,540 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:36,540 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:48:36,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:36,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:36,543 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-02-17 22:48:36,544 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-02-17 22:48:36,546 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:48:36,546 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:36,556 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-17 22:48:36,556 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork0_thidvar0=0} Honda state: {thread1Thread1of1ForFork0_thidvar0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-17 22:48:36,562 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-02-17 22:48:36,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:36,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:36,564 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-02-17 22:48:36,565 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-02-17 22:48:36,565 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:48:36,565 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:36,583 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-17 22:48:36,583 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {b=0} Honda state: {b=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-17 22:48:36,588 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-02-17 22:48:36,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:36,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:36,590 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-02-17 22:48:36,591 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-02-17 22:48:36,592 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:48:36,592 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:36,609 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-02-17 22:48:36,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:36,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:36,611 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-02-17 22:48:36,612 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-02-17 22:48:36,612 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:48:36,612 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:36,723 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:48:36,728 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-02-17 22:48:36,729 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:36,729 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:36,729 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:36,729 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:36,729 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:48:36,729 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:36,729 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:36,729 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:36,729 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_2_seq_1.c.bpl_petrified1_Iteration3_Lasso [2025-02-17 22:48:36,729 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:36,729 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:36,730 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:36,733 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:36,735 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:36,771 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:36,771 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:48:36,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:36,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:36,773 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-02-17 22:48:36,774 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-02-17 22:48:36,775 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-02-17 22:48:36,785 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:48:36,786 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:48:36,786 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:48:36,786 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:48:36,787 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-17 22:48:36,787 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-17 22:48:36,790 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-17 22:48:36,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-02-17 22:48:36,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:36,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:36,796 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-02-17 22:48:36,798 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-02-17 22:48:36,799 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-02-17 22:48:36,808 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:48:36,809 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:48:36,809 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:48:36,809 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:48:36,812 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-17 22:48:36,812 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-17 22:48:36,816 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-17 22:48:36,821 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-02-17 22:48:36,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:36,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:36,824 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-02-17 22:48:36,825 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-02-17 22:48:36,826 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-02-17 22:48:36,836 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:48:36,836 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:48:36,836 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:48:36,836 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:48:36,839 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-17 22:48:36,839 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-17 22:48:36,845 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:48:36,852 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-02-17 22:48:36,852 INFO L444 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:48:36,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:36,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:36,854 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-02-17 22:48:36,856 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-02-17 22:48:36,856 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:48:36,866 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-02-17 22:48:36,867 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:48:36,867 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(n, x1) = 2*n - 2*x1 + 1 Supporting invariants [-1*t - 1 >= 0] [2025-02-17 22:48:36,872 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-02-17 22:48:36,875 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-02-17 22:48:36,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:36,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:36,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:36,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:36,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:36,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-17 22:48:36,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:36,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:36,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:36,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:36,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:36,911 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-17 22:48:36,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:36,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:48:36,940 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-02-17 22:48:36,940 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 306 states and 639 transitions. cyclomatic complexity: 397 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:37,024 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 306 states and 639 transitions. cyclomatic complexity: 397. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 770 states and 1604 transitions. Complement of second has 7 states. [2025-02-17 22:48:37,027 INFO L141 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-02-17 22:48:37,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:37,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions. [2025-02-17 22:48:37,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 90 transitions. Stem has 3 letters. Loop has 3 letters. [2025-02-17 22:48:37,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:37,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 90 transitions. Stem has 6 letters. Loop has 3 letters. [2025-02-17 22:48:37,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:37,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 90 transitions. Stem has 3 letters. Loop has 6 letters. [2025-02-17 22:48:37,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:37,028 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 770 states and 1604 transitions. [2025-02-17 22:48:37,033 INFO L131 ngComponentsAnalysis]: Automaton has 105 accepting balls. 339 [2025-02-17 22:48:37,049 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 770 states to 586 states and 1205 transitions. [2025-02-17 22:48:37,049 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 468 [2025-02-17 22:48:37,050 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 513 [2025-02-17 22:48:37,050 INFO L73 IsDeterministic]: Start isDeterministic. Operand 586 states and 1205 transitions. [2025-02-17 22:48:37,050 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:48:37,050 INFO L218 hiAutomatonCegarLoop]: Abstraction has 586 states and 1205 transitions. [2025-02-17 22:48:37,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states and 1205 transitions. [2025-02-17 22:48:37,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 346. [2025-02-17 22:48:37,060 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-02-17 22:48:37,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 346 states have (on average 2.138728323699422) internal successors, (740), 345 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:37,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 740 transitions. [2025-02-17 22:48:37,066 INFO L240 hiAutomatonCegarLoop]: Abstraction has 346 states and 740 transitions. [2025-02-17 22:48:37,066 INFO L432 stractBuchiCegarLoop]: Abstraction has 346 states and 740 transitions. [2025-02-17 22:48:37,066 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-17 22:48:37,066 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 346 states and 740 transitions. [2025-02-17 22:48:37,068 INFO L131 ngComponentsAnalysis]: Automaton has 59 accepting balls. 194 [2025-02-17 22:48:37,068 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:48:37,068 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:48:37,068 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-02-17 22:48:37,068 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-17 22:48:37,068 INFO L752 eck$LassoCheckResult]: Stem: "[155] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[118] $Ultimate##0-->L27: Formula: (<= 1 v_b_1) InVars {b=v_b_1} OutVars{b=v_b_1} AuxVars[] AssignedVars[]" "[120] L27-->L35-2: Formula: (= v_t_1 1) InVars {} OutVars{t=v_t_1} AuxVars[] AssignedVars[t]" "[122] L35-2-->L44: Formula: (< v_n_3 v_x1_6) InVars {x1=v_x1_6, n=v_n_3} OutVars{x1=v_x1_6, n=v_n_3} AuxVars[] AssignedVars[]" "[124] L44-->L47-2: Formula: (= v_t1_2 v_t_5) InVars {t=v_t_5} OutVars{t1=v_t1_2, t=v_t_5} AuxVars[] AssignedVars[t1]" [2025-02-17 22:48:37,068 INFO L754 eck$LassoCheckResult]: Loop: "[128] L47-2-->L47: Formula: (<= v_x3_4 v_n_4) InVars {n=v_n_4, x3=v_x3_4} OutVars{n=v_n_4, x3=v_x3_4} AuxVars[] AssignedVars[]" "[133] L47-->L49: Formula: (<= 1 v_b_5) InVars {b=v_b_5} OutVars{b=v_b_5} AuxVars[] AssignedVars[]" "[137] L49-->L47-2: Formula: (= v_x3_5 (+ v_x3_6 v_t1_3)) InVars {t1=v_t1_3, x3=v_x3_6} OutVars{t1=v_t1_3, x3=v_x3_5} AuxVars[] AssignedVars[x3]" [2025-02-17 22:48:37,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:37,069 INFO L85 PathProgramCache]: Analyzing trace with hash 175409470, now seen corresponding path program 1 times [2025-02-17 22:48:37,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:37,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032800464] [2025-02-17 22:48:37,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:37,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:37,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:48:37,074 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-02-17 22:48:37,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:48:37,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:37,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:37,074 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:37,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:48:37,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:48:37,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:37,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:37,081 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:37,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:37,082 INFO L85 PathProgramCache]: Analyzing trace with hash 157059, now seen corresponding path program 1 times [2025-02-17 22:48:37,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:37,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357274212] [2025-02-17 22:48:37,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:37,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:37,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:37,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:37,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:37,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:37,085 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:37,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:37,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:37,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:37,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:37,087 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:37,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:37,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1351551194, now seen corresponding path program 1 times [2025-02-17 22:48:37,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:37,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497437965] [2025-02-17 22:48:37,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:37,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:37,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:48:37,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:48:37,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:37,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:37,091 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:37,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:48:37,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:48:37,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:37,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:37,094 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:37,139 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:37,140 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:37,140 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:37,140 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:37,140 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:48:37,140 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:37,140 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:37,140 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:37,140 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_2_seq_1.c.bpl_petrified1_Iteration4_Lasso [2025-02-17 22:48:37,140 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:37,140 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:37,140 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:37,147 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:37,149 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:37,152 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:37,185 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:37,185 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:48:37,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:37,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:37,187 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:48:37,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-02-17 22:48:37,188 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:48:37,188 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:37,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-02-17 22:48:37,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:37,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:37,206 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:48:37,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-02-17 22:48:37,207 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:48:37,207 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:37,328 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:48:37,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-02-17 22:48:37,344 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:37,344 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:37,344 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:37,344 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:37,345 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:48:37,345 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:37,345 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:37,345 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:37,345 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_2_seq_1.c.bpl_petrified1_Iteration4_Lasso [2025-02-17 22:48:37,345 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:37,345 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:37,345 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:37,358 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:37,361 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:37,363 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:37,407 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:37,407 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:48:37,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:37,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:37,409 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:48:37,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-02-17 22:48:37,411 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-17 22:48:37,421 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:48:37,421 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:48:37,421 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:48:37,421 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:48:37,423 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-17 22:48:37,423 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-17 22:48:37,428 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:48:37,433 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-02-17 22:48:37,433 INFO L444 ModelExtractionUtils]: 5 out of 16 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-02-17 22:48:37,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:37,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:37,435 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:48:37,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-02-17 22:48:37,437 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:48:37,447 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-02-17 22:48:37,447 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:48:37,447 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(n, t1, x3) = 2*n + 1*t1 - 2*x3 Supporting invariants [1*t1 - 1 >= 0] [2025-02-17 22:48:37,453 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-02-17 22:48:37,455 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-02-17 22:48:37,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:37,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:48:37,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:48:37,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:37,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:37,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:48:37,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:37,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:37,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:37,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:37,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:37,498 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-17 22:48:37,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:37,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:48:37,521 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2025-02-17 22:48:37,521 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 346 states and 740 transitions. cyclomatic complexity: 466 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:37,595 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 346 states and 740 transitions. cyclomatic complexity: 466. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 604 states and 1299 transitions. Complement of second has 9 states. [2025-02-17 22:48:37,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 2 accepting loop states [2025-02-17 22:48:37,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:37,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 83 transitions. [2025-02-17 22:48:37,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 83 transitions. Stem has 5 letters. Loop has 3 letters. [2025-02-17 22:48:37,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:37,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 83 transitions. Stem has 8 letters. Loop has 3 letters. [2025-02-17 22:48:37,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:37,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 83 transitions. Stem has 5 letters. Loop has 6 letters. [2025-02-17 22:48:37,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:37,596 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 604 states and 1299 transitions. [2025-02-17 22:48:37,600 INFO L131 ngComponentsAnalysis]: Automaton has 78 accepting balls. 256 [2025-02-17 22:48:37,605 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 604 states to 560 states and 1197 transitions. [2025-02-17 22:48:37,605 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 389 [2025-02-17 22:48:37,606 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 455 [2025-02-17 22:48:37,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 560 states and 1197 transitions. [2025-02-17 22:48:37,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:48:37,606 INFO L218 hiAutomatonCegarLoop]: Abstraction has 560 states and 1197 transitions. [2025-02-17 22:48:37,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states and 1197 transitions. [2025-02-17 22:48:37,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 437. [2025-02-17 22:48:37,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 437 states have (on average 2.137299771167048) internal successors, (934), 436 states have internal predecessors, (934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:37,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 934 transitions. [2025-02-17 22:48:37,620 INFO L240 hiAutomatonCegarLoop]: Abstraction has 437 states and 934 transitions. [2025-02-17 22:48:37,620 INFO L432 stractBuchiCegarLoop]: Abstraction has 437 states and 934 transitions. [2025-02-17 22:48:37,620 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-02-17 22:48:37,620 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 437 states and 934 transitions. [2025-02-17 22:48:37,621 INFO L131 ngComponentsAnalysis]: Automaton has 65 accepting balls. 220 [2025-02-17 22:48:37,621 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:48:37,621 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:48:37,622 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-02-17 22:48:37,622 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-17 22:48:37,622 INFO L752 eck$LassoCheckResult]: Stem: "[155] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[118] $Ultimate##0-->L27: Formula: (<= 1 v_b_1) InVars {b=v_b_1} OutVars{b=v_b_1} AuxVars[] AssignedVars[]" "[158] L16-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[139] $Ultimate##0-->L67: Formula: (<= 1 v_b_7) InVars {b=v_b_7} OutVars{b=v_b_7} AuxVars[] AssignedVars[]" "[141] L67-->L75-2: Formula: (= v_t_6 1) InVars {} OutVars{t=v_t_6} AuxVars[] AssignedVars[t]" [2025-02-17 22:48:37,622 INFO L754 eck$LassoCheckResult]: Loop: "[144] L75-2-->L75: Formula: (<= v_x2_2 v_n_6) InVars {x2=v_x2_2, n=v_n_6} OutVars{x2=v_x2_2, n=v_n_6} AuxVars[] AssignedVars[]" "[147] L75-->L77: Formula: (<= 1 v_b_9) InVars {b=v_b_9} OutVars{b=v_b_9} AuxVars[] AssignedVars[]" "[151] L77-->L75-2: Formula: (= v_x2_3 (+ v_x2_4 v_t_8)) InVars {t=v_t_8, x2=v_x2_4} OutVars{t=v_t_8, x2=v_x2_3} AuxVars[] AssignedVars[x2]" [2025-02-17 22:48:37,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:37,623 INFO L85 PathProgramCache]: Analyzing trace with hash 175446532, now seen corresponding path program 1 times [2025-02-17 22:48:37,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:37,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115956817] [2025-02-17 22:48:37,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:37,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:37,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:48:37,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:48:37,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:37,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:37,629 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:37,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:48:37,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:48:37,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:37,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:37,631 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:37,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:37,633 INFO L85 PathProgramCache]: Analyzing trace with hash 172883, now seen corresponding path program 1 times [2025-02-17 22:48:37,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:37,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276153234] [2025-02-17 22:48:37,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:37,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:37,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:37,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:37,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:37,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:37,637 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:37,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:37,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:37,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:37,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:37,639 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:37,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:37,639 INFO L85 PathProgramCache]: Analyzing trace with hash -247421328, now seen corresponding path program 1 times [2025-02-17 22:48:37,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:37,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333298576] [2025-02-17 22:48:37,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:37,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:37,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:48:37,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:48:37,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:37,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:37,646 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:37,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:48:37,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:48:37,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:37,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:37,653 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:37,688 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:37,688 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:37,688 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:37,688 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:37,688 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:48:37,688 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:37,688 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:37,688 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:37,689 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_2_seq_1.c.bpl_petrified1_Iteration5_Lasso [2025-02-17 22:48:37,689 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:37,689 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:37,689 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:37,694 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:37,697 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:37,699 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:37,702 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:37,742 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:37,743 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:48:37,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:37,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:37,745 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:48:37,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-02-17 22:48:37,747 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:48:37,747 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:37,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-02-17 22:48:37,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:37,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:37,765 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:48:37,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-02-17 22:48:37,768 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:48:37,768 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:37,918 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:48:37,925 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-02-17 22:48:37,925 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:37,925 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:37,925 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:37,925 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:37,925 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:48:37,925 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:37,925 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:37,925 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:37,925 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_2_seq_1.c.bpl_petrified1_Iteration5_Lasso [2025-02-17 22:48:37,925 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:37,925 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:37,926 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:37,932 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:37,934 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:37,936 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:37,938 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:37,976 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:37,976 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:48:37,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:37,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:37,980 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:48:37,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-02-17 22:48:37,982 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-02-17 22:48:37,992 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:48:37,992 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:48:37,992 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:48:37,992 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:48:37,995 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-17 22:48:37,995 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-17 22:48:37,999 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:48:38,003 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:48:38,003 INFO L444 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-17 22:48:38,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:38,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:38,005 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:48:38,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-02-17 22:48:38,008 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:48:38,019 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-02-17 22:48:38,019 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:48:38,019 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(x2, t, n) = -2*x2 + 1*t + 2*n Supporting invariants [1*t - 1 >= 0] [2025-02-17 22:48:38,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-02-17 22:48:38,028 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-02-17 22:48:38,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:38,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:48:38,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:48:38,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:38,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:38,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-17 22:48:38,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:38,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:38,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:38,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:38,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:38,060 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-17 22:48:38,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:38,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:48:38,086 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-02-17 22:48:38,086 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 437 states and 934 transitions. cyclomatic complexity: 581 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:38,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-02-17 22:48:38,109 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-02-17 22:48:38,180 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 437 states and 934 transitions. cyclomatic complexity: 581. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 906 states and 2020 transitions. Complement of second has 8 states. [2025-02-17 22:48:38,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 2 accepting loop states [2025-02-17 22:48:38,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:38,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions. [2025-02-17 22:48:38,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 90 transitions. Stem has 5 letters. Loop has 3 letters. [2025-02-17 22:48:38,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:38,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 90 transitions. Stem has 8 letters. Loop has 3 letters. [2025-02-17 22:48:38,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:38,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 90 transitions. Stem has 5 letters. Loop has 6 letters. [2025-02-17 22:48:38,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:38,184 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 906 states and 2020 transitions. [2025-02-17 22:48:38,189 INFO L131 ngComponentsAnalysis]: Automaton has 95 accepting balls. 317 [2025-02-17 22:48:38,193 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 906 states to 745 states and 1626 transitions. [2025-02-17 22:48:38,194 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 469 [2025-02-17 22:48:38,195 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 503 [2025-02-17 22:48:38,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 745 states and 1626 transitions. [2025-02-17 22:48:38,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:48:38,195 INFO L218 hiAutomatonCegarLoop]: Abstraction has 745 states and 1626 transitions. [2025-02-17 22:48:38,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states and 1626 transitions. [2025-02-17 22:48:38,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 595. [2025-02-17 22:48:38,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 595 states have (on average 2.196638655462185) internal successors, (1307), 594 states have internal predecessors, (1307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:38,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 1307 transitions. [2025-02-17 22:48:38,208 INFO L240 hiAutomatonCegarLoop]: Abstraction has 595 states and 1307 transitions. [2025-02-17 22:48:38,208 INFO L432 stractBuchiCegarLoop]: Abstraction has 595 states and 1307 transitions. [2025-02-17 22:48:38,208 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-02-17 22:48:38,208 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 595 states and 1307 transitions. [2025-02-17 22:48:38,210 INFO L131 ngComponentsAnalysis]: Automaton has 68 accepting balls. 220 [2025-02-17 22:48:38,210 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:48:38,210 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:48:38,210 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-02-17 22:48:38,210 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-17 22:48:38,211 INFO L752 eck$LassoCheckResult]: Stem: "[155] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[119] $Ultimate##0-->L31: Formula: (< v_b_2 1) InVars {b=v_b_2} OutVars{b=v_b_2} AuxVars[] AssignedVars[]" "[121] L31-->L35-2: Formula: (= (+ v_t_2 1) 0) InVars {} OutVars{t=v_t_2} AuxVars[] AssignedVars[t]" "[122] L35-2-->L44: Formula: (< v_n_3 v_x1_6) InVars {x1=v_x1_6, n=v_n_3} OutVars{x1=v_x1_6, n=v_n_3} AuxVars[] AssignedVars[]" "[124] L44-->L47-2: Formula: (= v_t1_2 v_t_5) InVars {t=v_t_5} OutVars{t1=v_t1_2, t=v_t_5} AuxVars[] AssignedVars[t1]" [2025-02-17 22:48:38,211 INFO L754 eck$LassoCheckResult]: Loop: "[128] L47-2-->L47: Formula: (<= v_x3_4 v_n_4) InVars {n=v_n_4, x3=v_x3_4} OutVars{n=v_n_4, x3=v_x3_4} AuxVars[] AssignedVars[]" "[134] L47-->L53: Formula: (< v_b_6 1) InVars {b=v_b_6} OutVars{b=v_b_6} AuxVars[] AssignedVars[]" "[138] L53-->L47-2: Formula: (= (+ v_x3_1 v_t1_1) v_x3_2) InVars {t1=v_t1_1, x3=v_x3_2} OutVars{t1=v_t1_1, x3=v_x3_1} AuxVars[] AssignedVars[x3]" [2025-02-17 22:48:38,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:38,212 INFO L85 PathProgramCache]: Analyzing trace with hash 175440222, now seen corresponding path program 1 times [2025-02-17 22:48:38,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:38,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232915511] [2025-02-17 22:48:38,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:38,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:38,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:48:38,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:48:38,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:38,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:38,218 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:38,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:48:38,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:48:38,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:38,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:38,220 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:38,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:38,222 INFO L85 PathProgramCache]: Analyzing trace with hash 157091, now seen corresponding path program 1 times [2025-02-17 22:48:38,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:38,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219750229] [2025-02-17 22:48:38,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:38,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:38,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:38,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:38,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:38,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:38,225 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:38,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:38,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:38,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:38,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:38,229 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:38,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:38,231 INFO L85 PathProgramCache]: Analyzing trace with hash -435418330, now seen corresponding path program 1 times [2025-02-17 22:48:38,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:38,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471746818] [2025-02-17 22:48:38,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:38,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:38,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:48:38,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:48:38,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:38,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:38,234 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:38,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:48:38,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:48:38,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:38,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:38,241 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:38,278 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:38,278 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:38,278 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:38,278 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:38,278 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:48:38,278 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:38,278 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:38,278 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:38,278 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_2_seq_1.c.bpl_petrified1_Iteration6_Lasso [2025-02-17 22:48:38,278 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:38,278 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:38,279 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:38,286 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:38,289 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:38,291 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:38,326 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:38,326 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:48:38,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:38,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:38,328 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:48:38,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-02-17 22:48:38,331 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:48:38,331 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:38,347 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-02-17 22:48:38,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:38,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:38,349 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:48:38,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-02-17 22:48:38,351 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:48:38,351 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:38,474 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:48:38,480 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-02-17 22:48:38,480 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:38,480 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:38,480 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:38,480 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:38,480 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:48:38,480 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:38,480 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:38,480 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:38,480 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_2_seq_1.c.bpl_petrified1_Iteration6_Lasso [2025-02-17 22:48:38,480 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:38,480 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:38,481 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:38,491 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:38,493 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:38,498 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:38,525 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:38,525 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:48:38,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:38,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:38,527 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:48:38,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-02-17 22:48:38,528 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-02-17 22:48:38,538 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:48:38,538 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:48:38,538 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:48:38,538 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:48:38,542 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-17 22:48:38,542 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-17 22:48:38,547 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:48:38,554 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-02-17 22:48:38,554 INFO L444 ModelExtractionUtils]: 4 out of 16 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-02-17 22:48:38,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:38,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:38,556 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:48:38,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-02-17 22:48:38,558 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:48:38,570 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-02-17 22:48:38,570 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:48:38,570 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(n, x3) = 2*n - 2*x3 + 1 Supporting invariants [-1*t1 - 1 >= 0] [2025-02-17 22:48:38,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-02-17 22:48:38,579 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-02-17 22:48:38,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:38,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:48:38,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:48:38,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:38,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:38,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:48:38,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:38,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:38,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:38,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:38,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:38,624 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-17 22:48:38,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:38,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:48:38,645 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2025-02-17 22:48:38,646 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 595 states and 1307 transitions. cyclomatic complexity: 820 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:38,716 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 595 states and 1307 transitions. cyclomatic complexity: 820. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 1008 states and 2236 transitions. Complement of second has 9 states. [2025-02-17 22:48:38,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 2 accepting loop states [2025-02-17 22:48:38,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:38,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions. [2025-02-17 22:48:38,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 95 transitions. Stem has 5 letters. Loop has 3 letters. [2025-02-17 22:48:38,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:38,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 95 transitions. Stem has 8 letters. Loop has 3 letters. [2025-02-17 22:48:38,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:38,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 95 transitions. Stem has 5 letters. Loop has 6 letters. [2025-02-17 22:48:38,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:38,717 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1008 states and 2236 transitions. [2025-02-17 22:48:38,723 INFO L131 ngComponentsAnalysis]: Automaton has 85 accepting balls. 252 [2025-02-17 22:48:38,727 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1008 states to 855 states and 1871 transitions. [2025-02-17 22:48:38,727 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 458 [2025-02-17 22:48:38,727 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 539 [2025-02-17 22:48:38,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 855 states and 1871 transitions. [2025-02-17 22:48:38,728 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:48:38,728 INFO L218 hiAutomatonCegarLoop]: Abstraction has 855 states and 1871 transitions. [2025-02-17 22:48:38,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states and 1871 transitions. [2025-02-17 22:48:38,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 630. [2025-02-17 22:48:38,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 630 states have (on average 2.219047619047619) internal successors, (1398), 629 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:38,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 1398 transitions. [2025-02-17 22:48:38,738 INFO L240 hiAutomatonCegarLoop]: Abstraction has 630 states and 1398 transitions. [2025-02-17 22:48:38,738 INFO L432 stractBuchiCegarLoop]: Abstraction has 630 states and 1398 transitions. [2025-02-17 22:48:38,738 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-02-17 22:48:38,738 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 630 states and 1398 transitions. [2025-02-17 22:48:38,740 INFO L131 ngComponentsAnalysis]: Automaton has 66 accepting balls. 204 [2025-02-17 22:48:38,740 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:48:38,740 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:48:38,740 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-02-17 22:48:38,740 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-17 22:48:38,741 INFO L752 eck$LassoCheckResult]: Stem: "[155] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[119] $Ultimate##0-->L31: Formula: (< v_b_2 1) InVars {b=v_b_2} OutVars{b=v_b_2} AuxVars[] AssignedVars[]" "[121] L31-->L35-2: Formula: (= (+ v_t_2 1) 0) InVars {} OutVars{t=v_t_2} AuxVars[] AssignedVars[t]" "[123] L35-2-->L35: Formula: (<= v_x1_1 v_n_2) InVars {x1=v_x1_1, n=v_n_2} OutVars{x1=v_x1_1, n=v_n_2} AuxVars[] AssignedVars[]" "[125] L35-->L37: Formula: (<= 1 v_b_3) InVars {b=v_b_3} OutVars{b=v_b_3} AuxVars[] AssignedVars[]" [2025-02-17 22:48:38,741 INFO L754 eck$LassoCheckResult]: Loop: "[129] L37-->L35-2: Formula: (= (+ v_x1_3 v_t_3) v_x1_2) InVars {x1=v_x1_3, t=v_t_3} OutVars{x1=v_x1_2, t=v_t_3} AuxVars[] AssignedVars[x1]" "[123] L35-2-->L35: Formula: (<= v_x1_1 v_n_2) InVars {x1=v_x1_1, n=v_n_2} OutVars{x1=v_x1_1, n=v_n_2} AuxVars[] AssignedVars[]" "[125] L35-->L37: Formula: (<= 1 v_b_3) InVars {b=v_b_3} OutVars{b=v_b_3} AuxVars[] AssignedVars[]" [2025-02-17 22:48:38,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:38,741 INFO L85 PathProgramCache]: Analyzing trace with hash 175440254, now seen corresponding path program 1 times [2025-02-17 22:48:38,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:38,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335787044] [2025-02-17 22:48:38,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:38,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:38,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:48:38,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:48:38,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:38,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:38,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:48:38,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-17 22:48:38,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335787044] [2025-02-17 22:48:38,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335787044] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-17 22:48:38,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-17 22:48:38,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-17 22:48:38,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744764511] [2025-02-17 22:48:38,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-17 22:48:38,751 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-17 22:48:38,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:38,751 INFO L85 PathProgramCache]: Analyzing trace with hash 157698, now seen corresponding path program 2 times [2025-02-17 22:48:38,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:38,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458425504] [2025-02-17 22:48:38,751 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-17 22:48:38,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:38,752 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:38,753 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:38,753 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-17 22:48:38,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:38,753 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:38,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:38,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:38,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:38,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:38,755 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:38,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-17 22:48:38,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-17 22:48:38,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-17 22:48:38,770 INFO L87 Difference]: Start difference. First operand 630 states and 1398 transitions. cyclomatic complexity: 881 Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:38,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-17 22:48:38,791 INFO L93 Difference]: Finished difference Result 458 states and 990 transitions. [2025-02-17 22:48:38,791 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 458 states and 990 transitions. [2025-02-17 22:48:38,793 INFO L131 ngComponentsAnalysis]: Automaton has 38 accepting balls. 94 [2025-02-17 22:48:38,795 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 458 states to 454 states and 978 transitions. [2025-02-17 22:48:38,795 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 229 [2025-02-17 22:48:38,796 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 229 [2025-02-17 22:48:38,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 454 states and 978 transitions. [2025-02-17 22:48:38,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:48:38,796 INFO L218 hiAutomatonCegarLoop]: Abstraction has 454 states and 978 transitions. [2025-02-17 22:48:38,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states and 978 transitions. [2025-02-17 22:48:38,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 439. [2025-02-17 22:48:38,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 439 states have (on average 2.1708428246013667) internal successors, (953), 438 states have internal predecessors, (953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:38,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 953 transitions. [2025-02-17 22:48:38,803 INFO L240 hiAutomatonCegarLoop]: Abstraction has 439 states and 953 transitions. [2025-02-17 22:48:38,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-17 22:48:38,807 INFO L432 stractBuchiCegarLoop]: Abstraction has 439 states and 953 transitions. [2025-02-17 22:48:38,807 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-02-17 22:48:38,807 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 439 states and 953 transitions. [2025-02-17 22:48:38,809 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 80 [2025-02-17 22:48:38,809 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:48:38,809 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:48:38,809 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-02-17 22:48:38,809 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-17 22:48:38,809 INFO L752 eck$LassoCheckResult]: Stem: "[155] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[119] $Ultimate##0-->L31: Formula: (< v_b_2 1) InVars {b=v_b_2} OutVars{b=v_b_2} AuxVars[] AssignedVars[]" "[158] L16-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[140] $Ultimate##0-->L71: Formula: (< v_b_8 1) InVars {b=v_b_8} OutVars{b=v_b_8} AuxVars[] AssignedVars[]" "[142] L71-->L75-2: Formula: (= (+ v_t_7 1) 0) InVars {} OutVars{t=v_t_7} AuxVars[] AssignedVars[t]" [2025-02-17 22:48:38,809 INFO L754 eck$LassoCheckResult]: Loop: "[144] L75-2-->L75: Formula: (<= v_x2_2 v_n_6) InVars {x2=v_x2_2, n=v_n_6} OutVars{x2=v_x2_2, n=v_n_6} AuxVars[] AssignedVars[]" "[148] L75-->L81: Formula: (< v_b_10 1) InVars {b=v_b_10} OutVars{b=v_b_10} AuxVars[] AssignedVars[]" "[152] L81-->L75-2: Formula: (= v_x2_6 (+ v_x2_5 v_t_9)) InVars {t=v_t_9, x2=v_x2_6} OutVars{t=v_t_9, x2=v_x2_5} AuxVars[] AssignedVars[x2]" [2025-02-17 22:48:38,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:38,809 INFO L85 PathProgramCache]: Analyzing trace with hash 175476355, now seen corresponding path program 1 times [2025-02-17 22:48:38,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:38,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684316029] [2025-02-17 22:48:38,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:38,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:38,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:48:38,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:48:38,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:38,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:38,816 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:38,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:48:38,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:48:38,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:38,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:38,819 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:38,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:38,820 INFO L85 PathProgramCache]: Analyzing trace with hash 172915, now seen corresponding path program 1 times [2025-02-17 22:48:38,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:38,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521885887] [2025-02-17 22:48:38,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:38,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:38,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:38,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:38,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:38,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:38,821 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:38,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:38,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:38,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:38,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:38,825 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:38,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:38,826 INFO L85 PathProgramCache]: Analyzing trace with hash 641035697, now seen corresponding path program 1 times [2025-02-17 22:48:38,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:38,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716231465] [2025-02-17 22:48:38,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:38,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:38,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:48:38,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:48:38,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:38,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:38,828 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:38,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:48:38,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:48:38,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:38,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:38,836 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:38,854 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2025-02-17 22:48:38,877 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:38,877 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:38,877 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:38,877 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:38,877 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:48:38,877 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:38,877 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:38,877 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:38,877 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_2_seq_1.c.bpl_petrified1_Iteration8_Lasso [2025-02-17 22:48:38,877 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:38,877 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:38,878 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:38,886 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:38,887 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:38,889 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:38,890 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:38,925 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:38,925 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:48:38,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:38,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:38,927 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:48:38,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-02-17 22:48:38,929 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:48:38,929 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:38,945 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-02-17 22:48:38,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:38,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:38,947 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:48:38,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-02-17 22:48:38,948 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:48:38,948 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:39,066 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:48:39,072 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-02-17 22:48:39,072 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:39,072 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:39,073 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:39,073 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:39,073 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:48:39,073 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:39,073 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:39,073 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:39,073 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_2_seq_1.c.bpl_petrified1_Iteration8_Lasso [2025-02-17 22:48:39,073 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:39,073 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:39,073 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:39,079 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:39,084 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:39,086 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:39,087 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:39,123 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:39,123 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:48:39,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:39,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:39,125 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:48:39,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-02-17 22:48:39,126 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-02-17 22:48:39,136 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:48:39,136 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:48:39,136 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:48:39,136 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:48:39,138 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-17 22:48:39,138 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-17 22:48:39,140 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-17 22:48:39,146 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-02-17 22:48:39,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:39,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:39,148 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:48:39,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-02-17 22:48:39,152 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-02-17 22:48:39,162 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:48:39,162 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:48:39,162 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:48:39,162 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:48:39,164 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-17 22:48:39,164 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-17 22:48:39,168 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:48:39,172 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:48:39,172 INFO L444 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:48:39,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:39,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:39,174 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:48:39,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-02-17 22:48:39,176 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:48:39,187 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-02-17 22:48:39,188 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:48:39,188 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(n, x2) = 2*n - 2*x2 + 1 Supporting invariants [-1*t - 1 >= 0] [2025-02-17 22:48:39,196 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-02-17 22:48:39,198 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-02-17 22:48:39,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:39,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:48:39,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:48:39,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:39,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:39,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-17 22:48:39,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:39,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:39,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:39,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:39,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:39,226 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-17 22:48:39,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:39,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:48:39,244 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-02-17 22:48:39,244 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 439 states and 953 transitions. cyclomatic complexity: 586 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:39,292 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 439 states and 953 transitions. cyclomatic complexity: 586. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 733 states and 1674 transitions. Complement of second has 6 states. [2025-02-17 22:48:39,292 INFO L141 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-02-17 22:48:39,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:39,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2025-02-17 22:48:39,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 88 transitions. Stem has 5 letters. Loop has 3 letters. [2025-02-17 22:48:39,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:39,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 88 transitions. Stem has 8 letters. Loop has 3 letters. [2025-02-17 22:48:39,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:39,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 88 transitions. Stem has 5 letters. Loop has 6 letters. [2025-02-17 22:48:39,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:39,293 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 733 states and 1674 transitions. [2025-02-17 22:48:39,296 INFO L131 ngComponentsAnalysis]: Automaton has 30 accepting balls. 64 [2025-02-17 22:48:39,300 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 733 states to 573 states and 1293 transitions. [2025-02-17 22:48:39,300 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 219 [2025-02-17 22:48:39,300 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 237 [2025-02-17 22:48:39,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 573 states and 1293 transitions. [2025-02-17 22:48:39,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:48:39,301 INFO L218 hiAutomatonCegarLoop]: Abstraction has 573 states and 1293 transitions. [2025-02-17 22:48:39,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states and 1293 transitions. [2025-02-17 22:48:39,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 522. [2025-02-17 22:48:39,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 522 states have (on average 2.2490421455938696) internal successors, (1174), 521 states have internal predecessors, (1174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:39,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 1174 transitions. [2025-02-17 22:48:39,308 INFO L240 hiAutomatonCegarLoop]: Abstraction has 522 states and 1174 transitions. [2025-02-17 22:48:39,308 INFO L432 stractBuchiCegarLoop]: Abstraction has 522 states and 1174 transitions. [2025-02-17 22:48:39,308 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-02-17 22:48:39,308 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 522 states and 1174 transitions. [2025-02-17 22:48:39,310 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 50 [2025-02-17 22:48:39,311 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:48:39,311 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:48:39,311 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-02-17 22:48:39,311 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:48:39,312 INFO L752 eck$LassoCheckResult]: Stem: "[155] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[118] $Ultimate##0-->L27: Formula: (<= 1 v_b_1) InVars {b=v_b_1} OutVars{b=v_b_1} AuxVars[] AssignedVars[]" "[120] L27-->L35-2: Formula: (= v_t_1 1) InVars {} OutVars{t=v_t_1} AuxVars[] AssignedVars[t]" "[122] L35-2-->L44: Formula: (< v_n_3 v_x1_6) InVars {x1=v_x1_6, n=v_n_3} OutVars{x1=v_x1_6, n=v_n_3} AuxVars[] AssignedVars[]" "[124] L44-->L47-2: Formula: (= v_t1_2 v_t_5) InVars {t=v_t_5} OutVars{t1=v_t1_2, t=v_t_5} AuxVars[] AssignedVars[t1]" "[127] L47-2-->L56-1: Formula: (< v_n_1 v_x3_3) InVars {n=v_n_1, x3=v_x3_3} OutVars{n=v_n_1, x3=v_x3_3} AuxVars[] AssignedVars[]" [2025-02-17 22:48:39,312 INFO L754 eck$LassoCheckResult]: Loop: "[132] L56-1-->L58: Formula: (< v_z1_1 0) InVars {z1=v_z1_1} OutVars{z1=v_z1_1} AuxVars[] AssignedVars[]" "[136] L58-->L56-1: Formula: (= v_z1_2 (+ v_z1_3 1)) InVars {z1=v_z1_3} OutVars{z1=v_z1_2} AuxVars[] AssignedVars[z1]" [2025-02-17 22:48:39,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:39,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1142726401, now seen corresponding path program 1 times [2025-02-17 22:48:39,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:39,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599717044] [2025-02-17 22:48:39,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:39,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:39,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:48:39,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:48:39,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:39,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:39,316 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:39,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:48:39,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:48:39,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:39,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:39,319 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:39,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:39,319 INFO L85 PathProgramCache]: Analyzing trace with hash 5189, now seen corresponding path program 1 times [2025-02-17 22:48:39,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:39,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11238039] [2025-02-17 22:48:39,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:39,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:39,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:48:39,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:48:39,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:39,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:39,321 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:39,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:48:39,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:48:39,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:39,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:39,322 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:39,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:39,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1351552187, now seen corresponding path program 1 times [2025-02-17 22:48:39,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:39,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725970866] [2025-02-17 22:48:39,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:39,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:39,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:48:39,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:48:39,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:39,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:39,326 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:39,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:48:39,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:48:39,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:39,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:39,328 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:39,339 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:39,339 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:39,339 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:39,339 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:39,340 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:48:39,340 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:39,340 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:39,340 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:39,340 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_2_seq_1.c.bpl_petrified1_Iteration9_Loop [2025-02-17 22:48:39,340 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:39,340 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:39,340 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:39,353 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:39,353 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:48:39,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:39,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:39,354 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:48:39,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-02-17 22:48:39,357 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:48:39,357 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:39,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2025-02-17 22:48:39,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:39,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:39,376 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:48:39,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-02-17 22:48:39,383 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:48:39,383 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:39,407 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:48:39,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2025-02-17 22:48:39,411 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:39,411 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:39,411 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:39,411 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:39,411 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:48:39,411 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:39,411 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:39,411 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:39,411 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_2_seq_1.c.bpl_petrified1_Iteration9_Loop [2025-02-17 22:48:39,411 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:39,411 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:39,411 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:39,431 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:39,431 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:48:39,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:39,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:39,433 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:48:39,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-02-17 22:48:39,435 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-02-17 22:48:39,444 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:48:39,445 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:48:39,445 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:48:39,445 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:48:39,445 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:48:39,445 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:48:39,446 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:48:39,447 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:48:39,449 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-17 22:48:39,449 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:48:39,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:39,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:39,451 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:48:39,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-02-17 22:48:39,452 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:48:39,452 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:48:39,452 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:48:39,452 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(z1) = -1*z1 Supporting invariants [] [2025-02-17 22:48:39,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2025-02-17 22:48:39,458 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:48:39,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:39,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:48:39,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:48:39,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:39,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:39,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:48:39,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:39,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:48:39,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:48:39,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:39,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:39,476 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:48:39,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:39,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:48:39,485 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-02-17 22:48:39,485 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 522 states and 1174 transitions. cyclomatic complexity: 733 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:39,505 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 522 states and 1174 transitions. cyclomatic complexity: 733. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 711 states and 1615 transitions. Complement of second has 6 states. [2025-02-17 22:48:39,505 INFO L141 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-02-17 22:48:39,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:39,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2025-02-17 22:48:39,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 75 transitions. Stem has 6 letters. Loop has 2 letters. [2025-02-17 22:48:39,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:39,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 75 transitions. Stem has 8 letters. Loop has 2 letters. [2025-02-17 22:48:39,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:39,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 75 transitions. Stem has 6 letters. Loop has 4 letters. [2025-02-17 22:48:39,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:39,506 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 711 states and 1615 transitions. [2025-02-17 22:48:39,509 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 24 [2025-02-17 22:48:39,511 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 711 states to 475 states and 1054 transitions. [2025-02-17 22:48:39,511 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 148 [2025-02-17 22:48:39,511 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 159 [2025-02-17 22:48:39,512 INFO L73 IsDeterministic]: Start isDeterministic. Operand 475 states and 1054 transitions. [2025-02-17 22:48:39,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:48:39,512 INFO L218 hiAutomatonCegarLoop]: Abstraction has 475 states and 1054 transitions. [2025-02-17 22:48:39,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states and 1054 transitions. [2025-02-17 22:48:39,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 452. [2025-02-17 22:48:39,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 452 states have (on average 2.232300884955752) internal successors, (1009), 451 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:39,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 1009 transitions. [2025-02-17 22:48:39,518 INFO L240 hiAutomatonCegarLoop]: Abstraction has 452 states and 1009 transitions. [2025-02-17 22:48:39,518 INFO L432 stractBuchiCegarLoop]: Abstraction has 452 states and 1009 transitions. [2025-02-17 22:48:39,518 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-02-17 22:48:39,518 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 452 states and 1009 transitions. [2025-02-17 22:48:39,519 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 24 [2025-02-17 22:48:39,519 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:48:39,519 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:48:39,519 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-17 22:48:39,519 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:48:39,520 INFO L752 eck$LassoCheckResult]: Stem: "[155] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[118] $Ultimate##0-->L27: Formula: (<= 1 v_b_1) InVars {b=v_b_1} OutVars{b=v_b_1} AuxVars[] AssignedVars[]" "[158] L16-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[139] $Ultimate##0-->L67: Formula: (<= 1 v_b_7) InVars {b=v_b_7} OutVars{b=v_b_7} AuxVars[] AssignedVars[]" "[141] L67-->L75-2: Formula: (= v_t_6 1) InVars {} OutVars{t=v_t_6} AuxVars[] AssignedVars[t]" "[143] L75-2-->L84-1: Formula: (< v_n_5 v_x2_1) InVars {x2=v_x2_1, n=v_n_5} OutVars{x2=v_x2_1, n=v_n_5} AuxVars[] AssignedVars[]" "[120] L27-->L35-2: Formula: (= v_t_1 1) InVars {} OutVars{t=v_t_1} AuxVars[] AssignedVars[t]" "[146] L84-1-->L86: Formula: (< v_z2_1 0) InVars {z2=v_z2_1} OutVars{z2=v_z2_1} AuxVars[] AssignedVars[]" [2025-02-17 22:48:39,520 INFO L754 eck$LassoCheckResult]: Loop: "[150] L86-->L84-1: Formula: (= v_z2_2 (+ v_z2_3 1)) InVars {z2=v_z2_3} OutVars{z2=v_z2_2} AuxVars[] AssignedVars[z2]" "[146] L84-1-->L86: Formula: (< v_z2_1 0) InVars {z2=v_z2_1} OutVars{z2=v_z2_1} AuxVars[] AssignedVars[]" [2025-02-17 22:48:39,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:39,520 INFO L85 PathProgramCache]: Analyzing trace with hash -247423131, now seen corresponding path program 1 times [2025-02-17 22:48:39,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:39,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408421404] [2025-02-17 22:48:39,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:39,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:39,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:48:39,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:48:39,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:39,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:39,523 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:39,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:48:39,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:48:39,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:39,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:39,525 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:39,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:39,525 INFO L85 PathProgramCache]: Analyzing trace with hash 5757, now seen corresponding path program 1 times [2025-02-17 22:48:39,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:39,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712692872] [2025-02-17 22:48:39,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:39,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:39,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:48:39,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:48:39,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:39,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:39,527 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:39,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:48:39,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:48:39,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:39,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:39,528 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:39,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:39,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1550422815, now seen corresponding path program 1 times [2025-02-17 22:48:39,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:39,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452108401] [2025-02-17 22:48:39,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:39,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:39,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-17 22:48:39,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-17 22:48:39,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:39,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:39,530 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:39,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-17 22:48:39,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-17 22:48:39,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:39,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:39,533 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:39,545 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:39,545 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:39,545 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:39,545 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:39,545 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:48:39,545 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:39,545 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:39,545 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:39,545 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_2_seq_1.c.bpl_petrified1_Iteration10_Loop [2025-02-17 22:48:39,545 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:39,545 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:39,545 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:39,557 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:39,557 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:48:39,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:39,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:39,559 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:48:39,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-02-17 22:48:39,562 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:48:39,562 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:39,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2025-02-17 22:48:39,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:39,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:39,581 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:48:39,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-02-17 22:48:39,583 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:48:39,583 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:39,631 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:48:39,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2025-02-17 22:48:39,635 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:39,635 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:39,635 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:39,635 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:39,635 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:48:39,635 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:39,636 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:39,636 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:39,636 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_2_seq_1.c.bpl_petrified1_Iteration10_Loop [2025-02-17 22:48:39,636 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:39,636 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:39,636 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:39,650 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:39,651 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:48:39,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:39,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:39,653 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:48:39,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-02-17 22:48:39,655 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-02-17 22:48:39,665 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:48:39,666 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:48:39,666 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:48:39,666 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:48:39,666 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:48:39,667 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:48:39,667 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:48:39,668 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:48:39,671 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-02-17 22:48:39,671 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-17 22:48:39,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:39,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:39,673 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:48:39,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2025-02-17 22:48:39,676 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:48:39,676 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:48:39,676 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:48:39,676 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(z2) = -1*z2 Supporting invariants [] [2025-02-17 22:48:39,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2025-02-17 22:48:39,682 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:48:39,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:39,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:48:39,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:48:39,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:39,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:39,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:48:39,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:39,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:48:39,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:48:39,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:39,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:39,704 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:48:39,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:39,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:48:39,715 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-02-17 22:48:39,715 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 452 states and 1009 transitions. cyclomatic complexity: 619 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:39,739 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 452 states and 1009 transitions. cyclomatic complexity: 619. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 666 states and 1473 transitions. Complement of second has 6 states. [2025-02-17 22:48:39,739 INFO L141 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-02-17 22:48:39,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:39,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2025-02-17 22:48:39,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 88 transitions. Stem has 8 letters. Loop has 2 letters. [2025-02-17 22:48:39,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:39,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 88 transitions. Stem has 10 letters. Loop has 2 letters. [2025-02-17 22:48:39,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:39,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 88 transitions. Stem has 8 letters. Loop has 4 letters. [2025-02-17 22:48:39,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:39,740 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 666 states and 1473 transitions. [2025-02-17 22:48:39,757 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-17 22:48:39,757 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 666 states to 0 states and 0 transitions. [2025-02-17 22:48:39,757 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-02-17 22:48:39,758 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-02-17 22:48:39,758 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-02-17 22:48:39,758 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-17 22:48:39,758 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:48:39,758 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:48:39,758 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:48:39,758 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-02-17 22:48:39,758 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-02-17 22:48:39,758 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-17 22:48:39,758 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-02-17 22:48:39,759 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2025-02-17 22:48:39,762 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2025-02-17 22:48:39,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2025-02-17 22:48:39,769 INFO L201 PluginConnector]: Adding new model adfg_2_seq_1.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.02 10:48:39 BoogieIcfgContainer [2025-02-17 22:48:39,769 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-02-17 22:48:39,770 INFO L158 Benchmark]: Toolchain (without parser) took 5229.95ms. Allocated memory was 167.8MB in the beginning and 142.6MB in the end (delta: -25.2MB). Free memory was 95.2MB in the beginning and 101.8MB in the end (delta: -6.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:48:39,771 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.20ms. Allocated memory is still 167.8MB. Free memory is still 96.1MB. There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:48:39,771 INFO L158 Benchmark]: Boogie Procedure Inliner took 17.69ms. Allocated memory is still 167.8MB. Free memory was 94.6MB in the beginning and 93.4MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:48:39,772 INFO L158 Benchmark]: Boogie Preprocessor took 14.08ms. Allocated memory is still 167.8MB. Free memory was 93.4MB in the beginning and 92.5MB in the end (delta: 892.3kB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:48:39,773 INFO L158 Benchmark]: RCFGBuilder took 195.21ms. Allocated memory is still 167.8MB. Free memory was 92.5MB in the beginning and 82.9MB in the end (delta: 9.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-02-17 22:48:39,773 INFO L158 Benchmark]: BuchiAutomizer took 4999.58ms. Allocated memory was 167.8MB in the beginning and 142.6MB in the end (delta: -25.2MB). Free memory was 82.7MB in the beginning and 101.8MB in the end (delta: -19.2MB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:48:39,774 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20ms. Allocated memory is still 167.8MB. Free memory is still 96.1MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 17.69ms. Allocated memory is still 167.8MB. Free memory was 94.6MB in the beginning and 93.4MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 14.08ms. Allocated memory is still 167.8MB. Free memory was 93.4MB in the beginning and 92.5MB in the end (delta: 892.3kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 195.21ms. Allocated memory is still 167.8MB. Free memory was 92.5MB in the beginning and 82.9MB in the end (delta: 9.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 4999.58ms. Allocated memory was 167.8MB in the beginning and 142.6MB in the end (delta: -25.2MB). Free memory was 82.7MB in the beginning and 101.8MB in the end (delta: -19.2MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 10 terminating modules (2 trivial, 8 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 2 * n + -2 * x1 + 1 and consists of 4 locations. One deterministic module has affine ranking function 2 * n + -2 * x1 + 1 and consists of 4 locations. One deterministic module has affine ranking function 2 * n + t1 + -2 * x3 and consists of 6 locations. One deterministic module has affine ranking function 2 * n + -2 * x2 + t and consists of 5 locations. One deterministic module has affine ranking function 2 * n + -2 * x3 + 1 and consists of 6 locations. One deterministic module has affine ranking function 2 * n + -2 * x2 + 1 and consists of 4 locations. One deterministic module has affine ranking function -1 * z1 and consists of 4 locations. One deterministic module has affine ranking function -1 * z2 and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.9s and 11 iterations. TraceHistogramMax:1. Analysis of lassos took 3.0s. Construction of modules took 0.2s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 8. Automata minimization 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 938 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [8, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 666 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 664 mSDsluCounter, 915 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 378 mSDsCounter, 46 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 338 IncrementalHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 46 mSolverCounterUnsat, 537 mSDtfsCounter, 338 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc1 concLT0 SILN1 SILU0 SILI0 SILT0 lasso6 LassoPreprocessingBenchmarks: Lassos: inital24 mio100 ax100 hnf100 lsp65 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq169 hnf94 smp100 dnf100 smp100 tf102 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 57ms VariablesStem: 1 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 2 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 8 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.1s InitialAbstractionConstructionTime: 0.4s InitialAbstraction: Time to compute Ample Reduction [ms]: 465, Trivial Ample Sets caused by loops: 170, Number of non-trivial ample sets: 138, Number of pruned transitions: 73, Number of transitions in reduction automaton: 374, Number of states in reduction automaton: 180, Underlying: - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-02-17 22:48:39,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...