/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i /storage/cav23-termute-examples/3_thr/adfg_3_x_t_indep.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:24:30,060 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:24:30,106 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf [2025-04-26 16:24:30,112 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:24:30,112 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:24:30,134 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:24:30,135 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:24:30,135 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:24:30,135 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:24:30,136 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:24:30,136 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:24:30,136 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:24:30,136 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:24:30,136 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:24:30,136 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:24:30,136 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:24:30,136 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:24:30,136 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:24:30,136 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:24:30,136 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:24:30,136 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:24:30,136 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:24:30,137 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:24:30,137 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:24:30,137 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:24:30,137 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:24:30,137 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:24:30,137 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:24:30,137 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:24:30,137 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:24:30,137 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:24:30,137 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:24:30,137 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:24:30,139 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:24:30,139 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:24:30,139 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:24:30,139 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:24:30,362 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:24:30,368 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:24:30,370 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:24:30,370 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:24:30,373 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:24:30,374 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/3_thr/adfg_3_x_t_indep.c.bpl [2025-04-26 16:24:30,374 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/3_thr/adfg_3_x_t_indep.c.bpl' [2025-04-26 16:24:30,392 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:24:30,394 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:24:30,395 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:24:30,395 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:24:30,395 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:24:30,403 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "adfg_3_x_t_indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:30" (1/1) ... [2025-04-26 16:24:30,424 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "adfg_3_x_t_indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:30" (1/1) ... [2025-04-26 16:24:30,430 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:24:30,431 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:24:30,432 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:24:30,432 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:24:30,432 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:24:30,436 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "adfg_3_x_t_indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:30" (1/1) ... [2025-04-26 16:24:30,437 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "adfg_3_x_t_indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:30" (1/1) ... [2025-04-26 16:24:30,438 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "adfg_3_x_t_indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:30" (1/1) ... [2025-04-26 16:24:30,438 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "adfg_3_x_t_indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:30" (1/1) ... [2025-04-26 16:24:30,439 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "adfg_3_x_t_indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:30" (1/1) ... [2025-04-26 16:24:30,440 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "adfg_3_x_t_indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:30" (1/1) ... [2025-04-26 16:24:30,442 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "adfg_3_x_t_indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:30" (1/1) ... [2025-04-26 16:24:30,443 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "adfg_3_x_t_indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:30" (1/1) ... [2025-04-26 16:24:30,443 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "adfg_3_x_t_indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:30" (1/1) ... [2025-04-26 16:24:30,449 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:24:30,449 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:24:30,449 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:24:30,449 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:24:30,450 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "adfg_3_x_t_indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:30" (1/1) ... [2025-04-26 16:24:30,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:30,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:30,476 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:30,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-04-26 16:24:30,497 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:24:30,498 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:24:30,498 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:24:30,498 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:24:30,498 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:24:30,498 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:24:30,498 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:24:30,498 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:24:30,498 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:24:30,498 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:24:30,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:24:30,498 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:24:30,499 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 16:24:30,539 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:24:30,541 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:24:30,646 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:24:30,646 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:24:30,660 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:24:30,660 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:24:30,663 INFO L201 PluginConnector]: Adding new model adfg_3_x_t_indep.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:24:30 BoogieIcfgContainer [2025-04-26 16:24:30,663 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:24:30,665 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:24:30,665 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:24:30,670 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:24:30,670 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:24:30,670 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "adfg_3_x_t_indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:30" (1/2) ... [2025-04-26 16:24:30,672 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7b0dd75c and model type adfg_3_x_t_indep.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:24:30, skipping insertion in model container [2025-04-26 16:24:30,672 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:24:30,672 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "adfg_3_x_t_indep.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:24:30" (2/2) ... [2025-04-26 16:24:30,673 INFO L376 chiAutomizerObserver]: Analyzing ICFG adfg_3_x_t_indep.c.bpl [2025-04-26 16:24:30,730 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 16:24:30,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 46 transitions, 113 flow [2025-04-26 16:24:30,789 INFO L116 PetriNetUnfolderBase]: 9/40 cut-off events. [2025-04-26 16:24:30,790 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 16:24:30,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 40 events. 9/40 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 102 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 39. Up to 4 conditions per place. [2025-04-26 16:24:30,801 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 46 transitions, 113 flow [2025-04-26 16:24:30,805 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 40 transitions, 98 flow [2025-04-26 16:24:30,806 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 41 places, 40 transitions, 98 flow [2025-04-26 16:24:30,814 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:24:30,814 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:24:30,814 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:24:30,814 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:24:30,814 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:24:30,814 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:24:30,814 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:24:30,815 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:24:30,816 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:24:31,026 INFO L131 ngComponentsAnalysis]: Automaton has 115 accepting balls. 724 [2025-04-26 16:24:31,026 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:31,026 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:31,034 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:24:31,034 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:24:31,034 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:24:31,034 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 911 states, but on-demand construction may add more states [2025-04-26 16:24:31,048 INFO L131 ngComponentsAnalysis]: Automaton has 115 accepting balls. 724 [2025-04-26 16:24:31,048 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:31,049 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:31,049 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:24:31,049 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:24:31,053 INFO L752 eck$LassoCheckResult]: Stem: "[148] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[113] $Ultimate##0-->L28: Formula: (<= 1 v_b_2) InVars {b=v_b_2} OutVars{b=v_b_2} AuxVars[] AssignedVars[]" "[115] L28-->L36-2: Formula: (= v_t1_2 1) InVars {} OutVars{t1=v_t1_2} AuxVars[] AssignedVars[t1]" [2025-04-26 16:24:31,053 INFO L754 eck$LassoCheckResult]: Loop: "[118] L36-2-->L36: Formula: (<= v_x1_4 v_n_2) InVars {x1=v_x1_4, n=v_n_2} OutVars{x1=v_x1_4, n=v_n_2} AuxVars[] AssignedVars[]" "[121] L36-->L42: Formula: (< v_b_1 1) InVars {b=v_b_1} OutVars{b=v_b_1} AuxVars[] AssignedVars[]" "[123] L42-->L36-2: Formula: (= (+ v_x1_1 v_t1_1) v_x1_2) InVars {t1=v_t1_1, x1=v_x1_2} OutVars{t1=v_t1_1, x1=v_x1_1} AuxVars[] AssignedVars[x1]" [2025-04-26 16:24:31,056 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:31,056 INFO L85 PathProgramCache]: Analyzing trace with hash 175637, now seen corresponding path program 1 times [2025-04-26 16:24:31,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:31,062 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782868180] [2025-04-26 16:24:31,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:31,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:31,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:31,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:31,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:31,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:31,119 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:31,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:31,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:31,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:31,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:31,139 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:31,143 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:31,143 INFO L85 PathProgramCache]: Analyzing trace with hash 147063, now seen corresponding path program 1 times [2025-04-26 16:24:31,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:31,144 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442275760] [2025-04-26 16:24:31,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:31,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:31,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:31,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:31,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:31,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:31,154 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:31,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:31,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:31,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:31,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:31,162 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:31,163 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:31,163 INFO L85 PathProgramCache]: Analyzing trace with hash 937551843, now seen corresponding path program 1 times [2025-04-26 16:24:31,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:31,163 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439684293] [2025-04-26 16:24:31,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:31,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:31,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:24:31,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:24:31,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:31,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:31,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:24:31,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:24:31,224 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439684293] [2025-04-26 16:24:31,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439684293] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:24:31,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:24:31,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 16:24:31,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223474334] [2025-04-26 16:24:31,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:24:31,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:24:31,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:24:31,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:24:31,305 INFO L87 Difference]: Start difference. First operand currently 911 states, but on-demand construction may add more states Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:31,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:24:31,439 INFO L93 Difference]: Finished difference Result 1330 states and 4305 transitions. [2025-04-26 16:24:31,440 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1330 states and 4305 transitions. [2025-04-26 16:24:31,464 INFO L131 ngComponentsAnalysis]: Automaton has 236 accepting balls. 960 [2025-04-26 16:24:31,491 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1330 states to 1298 states and 4221 transitions. [2025-04-26 16:24:31,493 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1298 [2025-04-26 16:24:31,496 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1298 [2025-04-26 16:24:31,497 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1298 states and 4221 transitions. [2025-04-26 16:24:31,518 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:24:31,524 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1298 states and 4221 transitions. [2025-04-26 16:24:31,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1298 states and 4221 transitions. [2025-04-26 16:24:31,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1298 to 1298. [2025-04-26 16:24:31,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1298 states, 1298 states have (on average 3.251926040061633) internal successors, (in total 4221), 1297 states have internal predecessors, (4221), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:31,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1298 states to 1298 states and 4221 transitions. [2025-04-26 16:24:31,631 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1298 states and 4221 transitions. [2025-04-26 16:24:31,632 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:24:31,634 INFO L438 stractBuchiCegarLoop]: Abstraction has 1298 states and 4221 transitions. [2025-04-26 16:24:31,635 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:24:31,635 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1298 states and 4221 transitions. [2025-04-26 16:24:31,644 INFO L131 ngComponentsAnalysis]: Automaton has 236 accepting balls. 960 [2025-04-26 16:24:31,644 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:31,644 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:31,644 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:24:31,644 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:24:31,645 INFO L752 eck$LassoCheckResult]: Stem: "[148] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[113] $Ultimate##0-->L28: Formula: (<= 1 v_b_2) InVars {b=v_b_2} OutVars{b=v_b_2} AuxVars[] AssignedVars[]" "[115] L28-->L36-2: Formula: (= v_t1_2 1) InVars {} OutVars{t1=v_t1_2} AuxVars[] AssignedVars[t1]" [2025-04-26 16:24:31,645 INFO L754 eck$LassoCheckResult]: Loop: "[118] L36-2-->L36: Formula: (<= v_x1_4 v_n_2) InVars {x1=v_x1_4, n=v_n_2} OutVars{x1=v_x1_4, n=v_n_2} AuxVars[] AssignedVars[]" "[120] L36-->L38: Formula: (<= 1 v_b_4) InVars {b=v_b_4} OutVars{b=v_b_4} AuxVars[] AssignedVars[]" "[122] L38-->L36-2: Formula: (= v_x1_5 (+ v_x1_6 v_t1_4)) InVars {t1=v_t1_4, x1=v_x1_6} OutVars{t1=v_t1_4, x1=v_x1_5} AuxVars[] AssignedVars[x1]" [2025-04-26 16:24:31,646 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:31,646 INFO L85 PathProgramCache]: Analyzing trace with hash 175637, now seen corresponding path program 2 times [2025-04-26 16:24:31,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:31,646 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578337494] [2025-04-26 16:24:31,646 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:24:31,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:31,649 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:31,650 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:31,650 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:24:31,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:31,650 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:31,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:31,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:31,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:31,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:31,657 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:31,658 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:31,658 INFO L85 PathProgramCache]: Analyzing trace with hash 147031, now seen corresponding path program 1 times [2025-04-26 16:24:31,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:31,658 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662298269] [2025-04-26 16:24:31,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:31,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:31,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:31,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:31,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:31,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:31,663 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:31,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:31,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:31,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:31,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:31,668 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:31,668 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:31,668 INFO L85 PathProgramCache]: Analyzing trace with hash 937551811, now seen corresponding path program 1 times [2025-04-26 16:24:31,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:31,670 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107838925] [2025-04-26 16:24:31,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:31,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:31,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:24:31,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:24:31,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:31,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:31,677 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:31,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:24:31,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:24:31,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:31,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:31,685 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:31,744 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:31,744 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:31,745 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:31,745 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:31,745 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:24:31,745 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:31,745 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:31,745 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:31,745 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_3_x_t_indep.c.bpl_petrified1_Iteration2_Lasso [2025-04-26 16:24:31,745 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:31,745 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:31,757 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:31,765 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:31,777 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:31,819 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:31,820 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:24:31,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:31,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:31,824 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:31,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-04-26 16:24:31,825 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:31,826 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:31,847 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:24:31,847 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {b=1} Honda state: {b=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:24:31,853 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-04-26 16:24:31,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:31,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:31,856 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:31,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 16:24:31,858 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:31,858 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:31,875 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 16:24:31,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:31,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:31,877 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:31,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 16:24:31,880 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:24:31,880 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:32,022 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:24:32,028 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 16:24:32,028 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:32,029 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:32,029 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:32,029 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:32,029 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:24:32,029 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:32,029 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:32,029 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:32,029 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_3_x_t_indep.c.bpl_petrified1_Iteration2_Lasso [2025-04-26 16:24:32,029 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:32,029 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:32,030 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:32,035 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:32,038 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:32,084 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:32,088 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:24:32,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:32,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:32,092 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:32,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 16:24:32,095 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:24:32,106 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:32,106 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:32,106 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:32,106 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:32,111 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:24:32,111 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:24:32,115 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:24:32,120 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 16:24:32,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:32,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:32,122 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:32,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 16:24:32,124 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:24:32,133 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:32,134 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:32,134 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:32,134 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:32,139 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:24:32,139 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:24:32,145 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:24:32,150 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 16:24:32,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:32,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:32,153 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:32,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 16:24:32,155 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:24:32,165 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:32,165 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:32,165 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:32,165 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:32,168 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:24:32,169 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:24:32,175 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:24:32,183 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:24:32,184 INFO L437 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:24:32,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:32,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:32,188 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:32,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 16:24:32,189 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:24:32,205 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 16:24:32,205 INFO L439 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-04-26 16:24:32,206 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:24:32,206 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(n, x1) = 2*n - 2*x1 + 1 Supporting invariants [1*t1 - 1 >= 0] [2025-04-26 16:24:32,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:32,217 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:24:32,241 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:32,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:32,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:32,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:32,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:32,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-26 16:24:32,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:32,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:32,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:32,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:32,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:32,263 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:24:32,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:32,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:24:32,296 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:24:32,297 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1298 states and 4221 transitions. cyclomatic complexity: 3159 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:32,422 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1298 states and 4221 transitions. cyclomatic complexity: 3159. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 2761 states and 9442 transitions. Complement of second has 6 states. [2025-04-26 16:24:32,423 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:24:32,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:32,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2025-04-26 16:24:32,426 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 107 transitions. Stem has 3 letters. Loop has 3 letters. [2025-04-26 16:24:32,426 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:32,426 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 107 transitions. Stem has 6 letters. Loop has 3 letters. [2025-04-26 16:24:32,426 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:32,426 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 107 transitions. Stem has 3 letters. Loop has 6 letters. [2025-04-26 16:24:32,426 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:32,426 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2761 states and 9442 transitions. [2025-04-26 16:24:32,452 INFO L131 ngComponentsAnalysis]: Automaton has 320 accepting balls. 1248 [2025-04-26 16:24:32,495 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2761 states to 2455 states and 8344 transitions. [2025-04-26 16:24:32,495 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1864 [2025-04-26 16:24:32,502 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2116 [2025-04-26 16:24:32,502 INFO L74 IsDeterministic]: Start isDeterministic. Operand 2455 states and 8344 transitions. [2025-04-26 16:24:32,502 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:24:32,502 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2455 states and 8344 transitions. [2025-04-26 16:24:32,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2455 states and 8344 transitions. [2025-04-26 16:24:32,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2455 to 1968. [2025-04-26 16:24:32,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1968 states, 1968 states have (on average 3.5091463414634148) internal successors, (in total 6906), 1967 states have internal predecessors, (6906), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:32,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1968 states to 1968 states and 6906 transitions. [2025-04-26 16:24:32,559 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1968 states and 6906 transitions. [2025-04-26 16:24:32,559 INFO L438 stractBuchiCegarLoop]: Abstraction has 1968 states and 6906 transitions. [2025-04-26 16:24:32,560 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:24:32,561 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1968 states and 6906 transitions. [2025-04-26 16:24:32,573 INFO L131 ngComponentsAnalysis]: Automaton has 278 accepting balls. 1104 [2025-04-26 16:24:32,573 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:32,573 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:32,573 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:24:32,573 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:24:32,574 INFO L752 eck$LassoCheckResult]: Stem: "[148] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[114] $Ultimate##0-->L32: Formula: (< v_b_3 1) InVars {b=v_b_3} OutVars{b=v_b_3} AuxVars[] AssignedVars[]" "[116] L32-->L36-2: Formula: (= (+ v_t1_3 1) 0) InVars {} OutVars{t1=v_t1_3} AuxVars[] AssignedVars[t1]" [2025-04-26 16:24:32,574 INFO L754 eck$LassoCheckResult]: Loop: "[118] L36-2-->L36: Formula: (<= v_x1_4 v_n_2) InVars {x1=v_x1_4, n=v_n_2} OutVars{x1=v_x1_4, n=v_n_2} AuxVars[] AssignedVars[]" "[121] L36-->L42: Formula: (< v_b_1 1) InVars {b=v_b_1} OutVars{b=v_b_1} AuxVars[] AssignedVars[]" "[123] L42-->L36-2: Formula: (= (+ v_x1_1 v_t1_1) v_x1_2) InVars {t1=v_t1_1, x1=v_x1_2} OutVars{t1=v_t1_1, x1=v_x1_1} AuxVars[] AssignedVars[x1]" [2025-04-26 16:24:32,574 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:32,574 INFO L85 PathProgramCache]: Analyzing trace with hash 175669, now seen corresponding path program 1 times [2025-04-26 16:24:32,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:32,574 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763768508] [2025-04-26 16:24:32,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:32,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:32,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:32,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:32,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:32,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:32,579 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:32,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:32,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:32,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:32,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:32,583 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:32,583 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:32,583 INFO L85 PathProgramCache]: Analyzing trace with hash 147063, now seen corresponding path program 2 times [2025-04-26 16:24:32,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:32,584 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737650359] [2025-04-26 16:24:32,584 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:24:32,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:32,586 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:32,587 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:32,587 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:24:32,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:32,587 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:32,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:32,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:32,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:32,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:32,591 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:32,591 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:32,591 INFO L85 PathProgramCache]: Analyzing trace with hash 938505155, now seen corresponding path program 1 times [2025-04-26 16:24:32,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:32,592 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167403436] [2025-04-26 16:24:32,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:32,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:32,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:24:32,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:24:32,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:32,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:32,596 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:32,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:24:32,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:24:32,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:32,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:32,599 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:32,643 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:32,643 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:32,643 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:32,643 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:32,643 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:24:32,643 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:32,644 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:32,644 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:32,644 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_3_x_t_indep.c.bpl_petrified1_Iteration3_Lasso [2025-04-26 16:24:32,644 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:32,644 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:32,644 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:32,647 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:32,654 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:32,685 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:32,685 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:24:32,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:32,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:32,687 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:32,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 16:24:32,690 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:32,690 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:32,702 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:24:32,702 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork0_thidvar0=0} Honda state: {thread1Thread1of1ForFork0_thidvar0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:24:32,708 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 16:24:32,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:32,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:32,710 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:32,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 16:24:32,713 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:32,714 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:32,732 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-04-26 16:24:32,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:32,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:32,734 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:32,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 16:24:32,737 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:24:32,738 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:32,847 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:24:32,852 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 16:24:32,853 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:32,853 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:32,853 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:32,853 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:32,853 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:24:32,853 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:32,853 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:32,853 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:32,853 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_3_x_t_indep.c.bpl_petrified1_Iteration3_Lasso [2025-04-26 16:24:32,853 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:32,853 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:32,854 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:32,861 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:32,864 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:32,908 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:32,908 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:24:32,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:32,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:32,910 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:32,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 16:24:32,913 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:24:32,923 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:32,923 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:32,923 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:32,923 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:32,927 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:24:32,928 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:24:32,935 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:24:32,940 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:24:32,940 INFO L437 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:24:32,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:32,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:32,943 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:32,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 16:24:32,945 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:24:32,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:32,961 INFO L439 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-04-26 16:24:32,961 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:24:32,961 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(t1, n, x1) = -1*t1 + 2*n - 2*x1 Supporting invariants [-1*t1 - 1 >= 0] [2025-04-26 16:24:32,966 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:32,971 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:24:32,990 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:32,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:32,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:32,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:32,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:32,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-26 16:24:32,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:33,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:33,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:33,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:33,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:33,002 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:24:33,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:33,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:24:33,026 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:24:33,026 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1968 states and 6906 transitions. cyclomatic complexity: 5269 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:33,179 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1968 states and 6906 transitions. cyclomatic complexity: 5269. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 4232 states and 15291 transitions. Complement of second has 7 states. [2025-04-26 16:24:33,179 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:24:33,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:33,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 118 transitions. [2025-04-26 16:24:33,180 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 118 transitions. Stem has 3 letters. Loop has 3 letters. [2025-04-26 16:24:33,180 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:33,180 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 118 transitions. Stem has 6 letters. Loop has 3 letters. [2025-04-26 16:24:33,180 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:33,180 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 118 transitions. Stem has 3 letters. Loop has 6 letters. [2025-04-26 16:24:33,180 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:33,181 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4232 states and 15291 transitions. [2025-04-26 16:24:33,224 INFO L131 ngComponentsAnalysis]: Automaton has 403 accepting balls. 1473 [2025-04-26 16:24:33,259 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4232 states to 3598 states and 12507 transitions. [2025-04-26 16:24:33,259 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2480 [2025-04-26 16:24:33,265 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2958 [2025-04-26 16:24:33,265 INFO L74 IsDeterministic]: Start isDeterministic. Operand 3598 states and 12507 transitions. [2025-04-26 16:24:33,265 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:24:33,265 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3598 states and 12507 transitions. [2025-04-26 16:24:33,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3598 states and 12507 transitions. [2025-04-26 16:24:33,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3598 to 2313. [2025-04-26 16:24:33,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2313 states, 2313 states have (on average 3.610030263726762) internal successors, (in total 8350), 2312 states have internal predecessors, (8350), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:33,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2313 states to 2313 states and 8350 transitions. [2025-04-26 16:24:33,345 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2313 states and 8350 transitions. [2025-04-26 16:24:33,345 INFO L438 stractBuchiCegarLoop]: Abstraction has 2313 states and 8350 transitions. [2025-04-26 16:24:33,345 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:24:33,345 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2313 states and 8350 transitions. [2025-04-26 16:24:33,358 INFO L131 ngComponentsAnalysis]: Automaton has 277 accepting balls. 1041 [2025-04-26 16:24:33,358 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:33,358 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:33,358 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:24:33,358 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:24:33,358 INFO L752 eck$LassoCheckResult]: Stem: "[148] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[151] L15-->$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]" "[124] $Ultimate##0-->L52: Formula: (<= 1 v_b_7) InVars {b=v_b_7} OutVars{b=v_b_7} AuxVars[] AssignedVars[]" "[126] L52-->L60-2: Formula: (= v_t2_3 1) InVars {} OutVars{t2=v_t2_3} AuxVars[] AssignedVars[t2]" [2025-04-26 16:24:33,359 INFO L754 eck$LassoCheckResult]: Loop: "[129] L60-2-->L60: Formula: (<= v_x2_1 v_n_3) InVars {x2=v_x2_1, n=v_n_3} OutVars{x2=v_x2_1, n=v_n_3} AuxVars[] AssignedVars[]" "[131] L60-->L62: Formula: (<= 1 v_b_5) InVars {b=v_b_5} OutVars{b=v_b_5} AuxVars[] AssignedVars[]" "[133] L62-->L60-2: Formula: (= (+ v_x2_3 v_t2_1) v_x2_2) InVars {t2=v_t2_1, x2=v_x2_3} OutVars{t2=v_t2_1, x2=v_x2_2} AuxVars[] AssignedVars[x2]" [2025-04-26 16:24:33,359 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:33,359 INFO L85 PathProgramCache]: Analyzing trace with hash 5481670, now seen corresponding path program 1 times [2025-04-26 16:24:33,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:33,359 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370504822] [2025-04-26 16:24:33,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:33,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:33,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:24:33,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:24:33,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:33,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:33,362 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:33,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:24:33,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:24:33,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:33,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:33,364 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:33,364 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:33,364 INFO L85 PathProgramCache]: Analyzing trace with hash 157954, now seen corresponding path program 1 times [2025-04-26 16:24:33,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:33,364 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453876270] [2025-04-26 16:24:33,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:33,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:33,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:33,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:33,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:33,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:33,366 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:33,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:33,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:33,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:33,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:33,368 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:33,368 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:33,368 INFO L85 PathProgramCache]: Analyzing trace with hash 95801885, now seen corresponding path program 1 times [2025-04-26 16:24:33,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:33,368 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361626819] [2025-04-26 16:24:33,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:33,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:33,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:24:33,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:24:33,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:33,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:33,374 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:33,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:24:33,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:24:33,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:33,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:33,381 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:33,414 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:33,414 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:33,414 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:33,414 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:33,414 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:24:33,414 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:33,414 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:33,414 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:33,414 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_3_x_t_indep.c.bpl_petrified1_Iteration4_Lasso [2025-04-26 16:24:33,414 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:33,414 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:33,415 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:33,423 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:33,427 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:33,429 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:33,432 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:33,468 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:33,468 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:24:33,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:33,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:33,470 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:33,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 16:24:33,474 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:33,474 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:33,485 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:24:33,486 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread2Thread1of1ForFork1_thidvar0=0} Honda state: {thread2Thread1of1ForFork1_thidvar0=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:24:33,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 16:24:33,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:33,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:33,494 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:33,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 16:24:33,496 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:33,496 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:33,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:33,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:33,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:33,515 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:33,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 16:24:33,518 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:24:33,518 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:33,644 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:24:33,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:33,650 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:33,650 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:33,650 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:33,650 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:33,650 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:24:33,650 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:33,650 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:33,650 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:33,650 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_3_x_t_indep.c.bpl_petrified1_Iteration4_Lasso [2025-04-26 16:24:33,650 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:33,650 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:33,651 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:33,656 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:33,660 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:33,662 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:33,666 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:33,708 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:33,708 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:24:33,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:33,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:33,711 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:33,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 16:24:33,712 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:24:33,723 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:33,724 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:33,724 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:33,724 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:33,726 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:24:33,726 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:24:33,730 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:24:33,735 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:24:33,735 INFO L437 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:24:33,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:33,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:33,738 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:33,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 16:24:33,739 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:24:33,756 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-04-26 16:24:33,756 INFO L439 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-04-26 16:24:33,756 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:24:33,756 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(n, x2) = 2*n - 2*x2 + 1 Supporting invariants [1*t2 - 1 >= 0] [2025-04-26 16:24:33,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-04-26 16:24:33,765 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:24:33,792 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:33,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:24:33,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:24:33,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:33,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:33,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-26 16:24:33,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:33,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:33,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:33,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:33,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:33,807 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:24:33,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:33,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:24:33,834 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:24:33,834 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2313 states and 8350 transitions. cyclomatic complexity: 6412 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:33,959 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2313 states and 8350 transitions. cyclomatic complexity: 6412. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 5195 states and 19359 transitions. Complement of second has 6 states. [2025-04-26 16:24:33,959 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:24:33,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:33,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2025-04-26 16:24:33,960 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 106 transitions. Stem has 4 letters. Loop has 3 letters. [2025-04-26 16:24:33,960 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:33,960 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 106 transitions. Stem has 7 letters. Loop has 3 letters. [2025-04-26 16:24:33,960 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:33,960 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 106 transitions. Stem has 4 letters. Loop has 6 letters. [2025-04-26 16:24:33,960 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:33,960 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5195 states and 19359 transitions. [2025-04-26 16:24:34,022 INFO L131 ngComponentsAnalysis]: Automaton has 368 accepting balls. 1344 [2025-04-26 16:24:34,072 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5195 states to 4370 states and 16149 transitions. [2025-04-26 16:24:34,072 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2413 [2025-04-26 16:24:34,079 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2740 [2025-04-26 16:24:34,079 INFO L74 IsDeterministic]: Start isDeterministic. Operand 4370 states and 16149 transitions. [2025-04-26 16:24:34,079 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:24:34,079 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4370 states and 16149 transitions. [2025-04-26 16:24:34,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4370 states and 16149 transitions. [2025-04-26 16:24:34,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4370 to 3635. [2025-04-26 16:24:34,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3635 states, 3635 states have (on average 3.7763411279229713) internal successors, (in total 13727), 3634 states have internal predecessors, (13727), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:34,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3635 states to 3635 states and 13727 transitions. [2025-04-26 16:24:34,239 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3635 states and 13727 transitions. [2025-04-26 16:24:34,239 INFO L438 stractBuchiCegarLoop]: Abstraction has 3635 states and 13727 transitions. [2025-04-26 16:24:34,239 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:24:34,239 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3635 states and 13727 transitions. [2025-04-26 16:24:34,258 INFO L131 ngComponentsAnalysis]: Automaton has 331 accepting balls. 1221 [2025-04-26 16:24:34,258 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:34,258 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:34,259 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:24:34,259 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:24:34,259 INFO L752 eck$LassoCheckResult]: Stem: "[148] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[151] L15-->$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]" "[125] $Ultimate##0-->L56: Formula: (< v_b_8 1) InVars {b=v_b_8} OutVars{b=v_b_8} AuxVars[] AssignedVars[]" "[127] L56-->L60-2: Formula: (= (+ v_t2_4 1) 0) InVars {} OutVars{t2=v_t2_4} AuxVars[] AssignedVars[t2]" [2025-04-26 16:24:34,259 INFO L754 eck$LassoCheckResult]: Loop: "[129] L60-2-->L60: Formula: (<= v_x2_1 v_n_3) InVars {x2=v_x2_1, n=v_n_3} OutVars{x2=v_x2_1, n=v_n_3} AuxVars[] AssignedVars[]" "[132] L60-->L66: Formula: (< v_b_6 1) InVars {b=v_b_6} OutVars{b=v_b_6} AuxVars[] AssignedVars[]" "[134] L66-->L60-2: Formula: (= v_x2_5 (+ v_x2_4 v_t2_2)) InVars {t2=v_t2_2, x2=v_x2_5} OutVars{t2=v_t2_2, x2=v_x2_4} AuxVars[] AssignedVars[x2]" [2025-04-26 16:24:34,259 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:34,259 INFO L85 PathProgramCache]: Analyzing trace with hash 5481702, now seen corresponding path program 1 times [2025-04-26 16:24:34,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:34,259 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361935516] [2025-04-26 16:24:34,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:34,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:34,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:24:34,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:24:34,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:34,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:34,267 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:34,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:24:34,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:24:34,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:34,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:34,269 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:34,269 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:34,270 INFO L85 PathProgramCache]: Analyzing trace with hash 157986, now seen corresponding path program 1 times [2025-04-26 16:24:34,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:34,270 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296238081] [2025-04-26 16:24:34,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:34,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:34,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:34,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:34,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:34,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:34,272 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:34,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:34,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:34,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:34,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:34,274 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:34,275 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:34,275 INFO L85 PathProgramCache]: Analyzing trace with hash 96755229, now seen corresponding path program 1 times [2025-04-26 16:24:34,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:34,275 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250824002] [2025-04-26 16:24:34,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:34,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:34,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:24:34,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:24:34,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:34,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:34,281 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:34,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:24:34,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:24:34,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:34,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:34,284 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:34,319 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:34,319 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:34,319 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:34,319 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:34,319 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:24:34,319 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:34,319 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:34,320 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:34,320 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_3_x_t_indep.c.bpl_petrified1_Iteration5_Lasso [2025-04-26 16:24:34,320 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:34,320 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:34,320 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:34,323 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:34,327 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:34,330 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:34,332 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:34,370 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:34,370 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:24:34,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:34,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:34,372 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:34,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-04-26 16:24:34,375 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:34,375 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:34,386 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:24:34,387 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork0_thidvar0=0} Honda state: {thread1Thread1of1ForFork0_thidvar0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:24:34,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:34,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:34,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:34,397 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:34,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-04-26 16:24:34,400 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:34,400 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:34,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:34,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:34,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:34,421 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:34,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-04-26 16:24:34,424 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:24:34,424 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:34,533 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:24:34,538 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:34,539 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:34,539 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:34,539 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:34,539 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:34,539 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:24:34,539 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:34,539 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:34,539 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:34,539 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_3_x_t_indep.c.bpl_petrified1_Iteration5_Lasso [2025-04-26 16:24:34,539 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:34,539 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:34,540 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:34,543 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:34,545 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:34,550 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:34,552 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:34,590 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:34,590 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:24:34,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:34,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:34,593 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:34,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-04-26 16:24:34,595 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:24:34,605 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:34,605 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:34,605 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:34,605 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:34,607 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:24:34,607 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:24:34,609 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:24:34,615 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-04-26 16:24:34,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:34,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:34,617 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:34,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-04-26 16:24:34,620 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:24:34,631 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:34,632 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:34,632 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:34,632 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:34,633 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:24:34,633 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:24:34,636 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:24:34,642 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:34,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:34,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:34,644 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:34,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-04-26 16:24:34,647 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:24:34,657 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:34,657 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:34,657 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:34,657 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:34,659 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:24:34,659 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:24:34,665 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:24:34,672 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:24:34,672 INFO L437 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:24:34,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:34,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:34,675 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:34,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-04-26 16:24:34,678 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:24:34,695 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-04-26 16:24:34,695 INFO L439 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-04-26 16:24:34,695 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:24:34,695 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(n, x2) = 2*n - 2*x2 + 1 Supporting invariants [-1*t2 - 1 >= 0] [2025-04-26 16:24:34,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:34,704 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:24:34,724 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:34,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:24:34,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:24:34,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:34,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:34,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-26 16:24:34,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:34,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:34,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:34,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:34,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:34,738 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:24:34,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:34,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:24:34,762 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:24:34,763 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3635 states and 13727 transitions. cyclomatic complexity: 10627 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:34,926 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3635 states and 13727 transitions. cyclomatic complexity: 10627. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 8124 states and 31223 transitions. Complement of second has 7 states. [2025-04-26 16:24:34,927 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:24:34,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:34,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 117 transitions. [2025-04-26 16:24:34,928 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 117 transitions. Stem has 4 letters. Loop has 3 letters. [2025-04-26 16:24:34,929 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:34,929 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 117 transitions. Stem has 7 letters. Loop has 3 letters. [2025-04-26 16:24:34,929 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:34,929 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 117 transitions. Stem has 4 letters. Loop has 6 letters. [2025-04-26 16:24:34,929 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:34,929 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8124 states and 31223 transitions. [2025-04-26 16:24:34,999 INFO L131 ngComponentsAnalysis]: Automaton has 436 accepting balls. 1530 [2025-04-26 16:24:35,107 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8124 states to 6588 states and 24441 transitions. [2025-04-26 16:24:35,107 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3280 [2025-04-26 16:24:35,117 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3910 [2025-04-26 16:24:35,117 INFO L74 IsDeterministic]: Start isDeterministic. Operand 6588 states and 24441 transitions. [2025-04-26 16:24:35,117 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:24:35,117 INFO L218 hiAutomatonCegarLoop]: Abstraction has 6588 states and 24441 transitions. [2025-04-26 16:24:35,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6588 states and 24441 transitions. [2025-04-26 16:24:35,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6588 to 4387. [2025-04-26 16:24:35,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4387 states, 4387 states have (on average 3.8110325963072715) internal successors, (in total 16719), 4386 states have internal predecessors, (16719), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:35,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4387 states to 4387 states and 16719 transitions. [2025-04-26 16:24:35,287 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4387 states and 16719 transitions. [2025-04-26 16:24:35,287 INFO L438 stractBuchiCegarLoop]: Abstraction has 4387 states and 16719 transitions. [2025-04-26 16:24:35,287 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 16:24:35,287 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4387 states and 16719 transitions. [2025-04-26 16:24:35,344 INFO L131 ngComponentsAnalysis]: Automaton has 308 accepting balls. 1104 [2025-04-26 16:24:35,345 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:35,345 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:35,345 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:24:35,345 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:24:35,346 INFO L752 eck$LassoCheckResult]: Stem: "[148] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[114] $Ultimate##0-->L32: Formula: (< v_b_3 1) InVars {b=v_b_3} OutVars{b=v_b_3} AuxVars[] AssignedVars[]" "[116] L32-->L36-2: Formula: (= (+ v_t1_3 1) 0) InVars {} OutVars{t1=v_t1_3} AuxVars[] AssignedVars[t1]" "[118] L36-2-->L36: Formula: (<= v_x1_4 v_n_2) InVars {x1=v_x1_4, n=v_n_2} OutVars{x1=v_x1_4, n=v_n_2} AuxVars[] AssignedVars[]" "[120] L36-->L38: Formula: (<= 1 v_b_4) InVars {b=v_b_4} OutVars{b=v_b_4} AuxVars[] AssignedVars[]" [2025-04-26 16:24:35,346 INFO L754 eck$LassoCheckResult]: Loop: "[122] L38-->L36-2: Formula: (= v_x1_5 (+ v_x1_6 v_t1_4)) InVars {t1=v_t1_4, x1=v_x1_6} OutVars{t1=v_t1_4, x1=v_x1_5} AuxVars[] AssignedVars[x1]" "[118] L36-2-->L36: Formula: (<= v_x1_4 v_n_2) InVars {x1=v_x1_4, n=v_n_2} OutVars{x1=v_x1_4, n=v_n_2} AuxVars[] AssignedVars[]" "[120] L36-->L38: Formula: (<= 1 v_b_4) InVars {b=v_b_4} OutVars{b=v_b_4} AuxVars[] AssignedVars[]" [2025-04-26 16:24:35,347 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:35,347 INFO L85 PathProgramCache]: Analyzing trace with hash 168821687, now seen corresponding path program 1 times [2025-04-26 16:24:35,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:35,347 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848481601] [2025-04-26 16:24:35,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:35,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:35,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:24:35,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:24:35,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:35,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:35,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:24:35,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:24:35,366 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848481601] [2025-04-26 16:24:35,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848481601] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:24:35,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:24:35,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:24:35,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339885708] [2025-04-26 16:24:35,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:24:35,366 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:24:35,366 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:35,366 INFO L85 PathProgramCache]: Analyzing trace with hash 150811, now seen corresponding path program 2 times [2025-04-26 16:24:35,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:35,366 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486715564] [2025-04-26 16:24:35,366 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:24:35,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:35,368 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:35,370 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:35,370 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:24:35,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:35,370 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:35,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:35,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:35,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:35,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:35,373 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:35,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:24:35,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:24:35,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:24:35,391 INFO L87 Difference]: Start difference. First operand 4387 states and 16719 transitions. cyclomatic complexity: 12941 Second operand has 3 states, 2 states have (on average 2.5) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:35,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:24:35,441 INFO L93 Difference]: Finished difference Result 2344 states and 8949 transitions. [2025-04-26 16:24:35,441 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2344 states and 8949 transitions. [2025-04-26 16:24:35,454 INFO L131 ngComponentsAnalysis]: Automaton has 114 accepting balls. 342 [2025-04-26 16:24:35,466 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2344 states to 2028 states and 7745 transitions. [2025-04-26 16:24:35,466 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 960 [2025-04-26 16:24:35,468 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 960 [2025-04-26 16:24:35,468 INFO L74 IsDeterministic]: Start isDeterministic. Operand 2028 states and 7745 transitions. [2025-04-26 16:24:35,468 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:24:35,468 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2028 states and 7745 transitions. [2025-04-26 16:24:35,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2028 states and 7745 transitions. [2025-04-26 16:24:35,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2028 to 2028. [2025-04-26 16:24:35,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2028 states, 2028 states have (on average 3.8190335305719922) internal successors, (in total 7745), 2027 states have internal predecessors, (7745), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:35,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2028 states to 2028 states and 7745 transitions. [2025-04-26 16:24:35,548 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2028 states and 7745 transitions. [2025-04-26 16:24:35,548 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:24:35,549 INFO L438 stractBuchiCegarLoop]: Abstraction has 2028 states and 7745 transitions. [2025-04-26 16:24:35,549 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 16:24:35,549 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2028 states and 7745 transitions. [2025-04-26 16:24:35,557 INFO L131 ngComponentsAnalysis]: Automaton has 114 accepting balls. 342 [2025-04-26 16:24:35,557 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:35,557 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:35,558 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:24:35,558 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:24:35,558 INFO L752 eck$LassoCheckResult]: Stem: "[148] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[151] L15-->$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]" "[154] L16-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[135] $Ultimate##0-->L76: Formula: (<= 1 v_b_12) InVars {b=v_b_12} OutVars{b=v_b_12} AuxVars[] AssignedVars[]" "[137] L76-->L84-2: Formula: (= v_t3_4 1) InVars {} OutVars{t3=v_t3_4} AuxVars[] AssignedVars[t3]" [2025-04-26 16:24:35,558 INFO L754 eck$LassoCheckResult]: Loop: "[140] L84-2-->L84: Formula: (<= v_x3_2 v_n_6) InVars {n=v_n_6, x3=v_x3_2} OutVars{n=v_n_6, x3=v_x3_2} AuxVars[] AssignedVars[]" "[142] L84-->L86: Formula: (<= 1 v_b_10) InVars {b=v_b_10} OutVars{b=v_b_10} AuxVars[] AssignedVars[]" "[144] L86-->L84-2: Formula: (= v_x3_3 (+ v_x3_4 v_t3_2)) InVars {t3=v_t3_2, x3=v_x3_4} OutVars{t3=v_t3_2, x3=v_x3_3} AuxVars[] AssignedVars[x3]" [2025-04-26 16:24:35,559 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:35,559 INFO L85 PathProgramCache]: Analyzing trace with hash 169961016, now seen corresponding path program 1 times [2025-04-26 16:24:35,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:35,559 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434996245] [2025-04-26 16:24:35,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:35,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:35,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:24:35,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:24:35,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:35,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:35,565 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:35,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:24:35,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:24:35,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:35,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:35,569 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:35,570 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:35,570 INFO L85 PathProgramCache]: Analyzing trace with hash 168877, now seen corresponding path program 1 times [2025-04-26 16:24:35,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:35,570 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863007083] [2025-04-26 16:24:35,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:35,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:35,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:35,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:35,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:35,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:35,574 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:35,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:35,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:35,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:35,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:35,576 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:35,576 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:35,576 INFO L85 PathProgramCache]: Analyzing trace with hash -457675242, now seen corresponding path program 1 times [2025-04-26 16:24:35,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:35,576 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974748510] [2025-04-26 16:24:35,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:35,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:35,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:24:35,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:24:35,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:35,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:35,581 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:35,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:24:35,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:24:35,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:35,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:35,590 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:35,644 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:35,645 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:35,645 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:35,645 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:35,645 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:24:35,645 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:35,645 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:35,645 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:35,645 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_3_x_t_indep.c.bpl_petrified1_Iteration7_Lasso [2025-04-26 16:24:35,645 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:35,645 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:35,646 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:35,650 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:35,653 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:35,659 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:35,661 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:35,663 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:35,665 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:35,667 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:35,723 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:35,724 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:24:35,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:35,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:35,726 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:35,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-04-26 16:24:35,729 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:35,730 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:35,740 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:24:35,740 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork0_thidvar0=0} Honda state: {thread1Thread1of1ForFork0_thidvar0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:24:35,745 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-04-26 16:24:35,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:35,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:35,748 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:35,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-04-26 16:24:35,751 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:35,751 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:35,767 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:24:35,767 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {b=1} Honda state: {b=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:24:35,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:35,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:35,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:35,778 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:35,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-04-26 16:24:35,782 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:35,782 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:35,799 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-04-26 16:24:35,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:35,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:35,800 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:35,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-04-26 16:24:35,802 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:24:35,802 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:35,951 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:24:35,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-04-26 16:24:35,957 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:35,957 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:35,957 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:35,957 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:35,957 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:24:35,957 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:35,957 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:35,958 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:35,958 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_3_x_t_indep.c.bpl_petrified1_Iteration7_Lasso [2025-04-26 16:24:35,958 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:35,958 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:35,958 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:35,961 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:35,963 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:35,968 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:35,971 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:35,973 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:35,975 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:35,977 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:36,036 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:36,037 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:24:36,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:36,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:36,040 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:36,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-04-26 16:24:36,043 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:24:36,052 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:36,053 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:36,053 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:36,053 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:36,054 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:24:36,054 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:24:36,057 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:24:36,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:36,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:36,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:36,068 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:36,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-04-26 16:24:36,069 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:24:36,079 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:36,079 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:36,079 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:36,079 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:36,080 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:24:36,080 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:24:36,083 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:24:36,089 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-04-26 16:24:36,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:36,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:36,091 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:36,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-04-26 16:24:36,093 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:24:36,103 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:36,103 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:36,103 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:36,103 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:36,105 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:24:36,105 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:24:36,109 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:24:36,115 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:24:36,116 INFO L437 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:24:36,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:36,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:36,118 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:36,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-04-26 16:24:36,120 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:24:36,136 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:36,136 INFO L439 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-04-26 16:24:36,137 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:24:36,137 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(n, t3, x3) = 2*n + 1*t3 - 2*x3 Supporting invariants [1*t3 - 1 >= 0] [2025-04-26 16:24:36,142 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2025-04-26 16:24:36,144 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:24:36,166 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:36,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:24:36,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:24:36,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:36,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:36,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-26 16:24:36,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:36,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:36,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:36,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:36,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:36,181 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:24:36,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:36,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:24:36,203 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:24:36,204 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2028 states and 7745 transitions. cyclomatic complexity: 5967 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:36,285 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2028 states and 7745 transitions. cyclomatic complexity: 5967. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 3432 states and 13248 transitions. Complement of second has 6 states. [2025-04-26 16:24:36,285 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:24:36,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:36,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2025-04-26 16:24:36,286 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 86 transitions. Stem has 5 letters. Loop has 3 letters. [2025-04-26 16:24:36,286 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:36,286 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 86 transitions. Stem has 8 letters. Loop has 3 letters. [2025-04-26 16:24:36,286 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:36,286 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 86 transitions. Stem has 5 letters. Loop has 6 letters. [2025-04-26 16:24:36,286 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:36,286 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3432 states and 13248 transitions. [2025-04-26 16:24:36,313 INFO L131 ngComponentsAnalysis]: Automaton has 57 accepting balls. 171 [2025-04-26 16:24:36,319 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3432 states to 1016 states and 3874 transitions. [2025-04-26 16:24:36,319 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 482 [2025-04-26 16:24:36,320 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 482 [2025-04-26 16:24:36,320 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1016 states and 3874 transitions. [2025-04-26 16:24:36,320 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:24:36,320 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1016 states and 3874 transitions. [2025-04-26 16:24:36,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states and 3874 transitions. [2025-04-26 16:24:36,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 1016. [2025-04-26 16:24:36,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1016 states, 1016 states have (on average 3.812992125984252) internal successors, (in total 3874), 1015 states have internal predecessors, (3874), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:36,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 3874 transitions. [2025-04-26 16:24:36,339 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1016 states and 3874 transitions. [2025-04-26 16:24:36,339 INFO L438 stractBuchiCegarLoop]: Abstraction has 1016 states and 3874 transitions. [2025-04-26 16:24:36,339 INFO L340 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-04-26 16:24:36,339 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1016 states and 3874 transitions. [2025-04-26 16:24:36,343 INFO L131 ngComponentsAnalysis]: Automaton has 57 accepting balls. 171 [2025-04-26 16:24:36,343 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:36,343 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:36,343 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:24:36,343 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:24:36,344 INFO L752 eck$LassoCheckResult]: Stem: "[148] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[151] L15-->$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]" "[154] L16-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[136] $Ultimate##0-->L80: Formula: (< v_b_9 1) InVars {b=v_b_9} OutVars{b=v_b_9} AuxVars[] AssignedVars[]" "[138] L80-->L84-2: Formula: (= (+ v_t3_1 1) 0) InVars {} OutVars{t3=v_t3_1} AuxVars[] AssignedVars[t3]" [2025-04-26 16:24:36,344 INFO L754 eck$LassoCheckResult]: Loop: "[140] L84-2-->L84: Formula: (<= v_x3_2 v_n_6) InVars {n=v_n_6, x3=v_x3_2} OutVars{n=v_n_6, x3=v_x3_2} AuxVars[] AssignedVars[]" "[143] L84-->L90: Formula: (< v_b_11 1) InVars {b=v_b_11} OutVars{b=v_b_11} AuxVars[] AssignedVars[]" "[145] L90-->L84-2: Formula: (= v_x3_6 (+ v_x3_5 v_t3_3)) InVars {t3=v_t3_3, x3=v_x3_6} OutVars{t3=v_t3_3, x3=v_x3_5} AuxVars[] AssignedVars[x3]" [2025-04-26 16:24:36,344 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:36,344 INFO L85 PathProgramCache]: Analyzing trace with hash 169961048, now seen corresponding path program 1 times [2025-04-26 16:24:36,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:36,344 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852200481] [2025-04-26 16:24:36,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:36,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:36,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:24:36,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:24:36,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:36,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:36,347 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:36,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:24:36,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:24:36,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:36,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:36,349 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:36,349 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:36,349 INFO L85 PathProgramCache]: Analyzing trace with hash 168909, now seen corresponding path program 1 times [2025-04-26 16:24:36,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:36,349 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207076885] [2025-04-26 16:24:36,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:36,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:36,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:36,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:36,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:36,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:36,352 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:36,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:36,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:36,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:36,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:36,353 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:36,354 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:36,354 INFO L85 PathProgramCache]: Analyzing trace with hash -456721898, now seen corresponding path program 1 times [2025-04-26 16:24:36,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:36,354 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14626852] [2025-04-26 16:24:36,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:36,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:36,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:24:36,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:24:36,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:36,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:36,361 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:36,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:24:36,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:24:36,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:36,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:36,368 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:36,422 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:36,422 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:36,422 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:36,422 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:36,422 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:24:36,422 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:36,423 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:36,423 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:36,423 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_3_x_t_indep.c.bpl_petrified1_Iteration8_Lasso [2025-04-26 16:24:36,423 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:36,423 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:36,424 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:36,427 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:36,430 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:36,432 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:36,435 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:36,440 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:36,442 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:36,444 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:36,494 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:36,494 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:24:36,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:36,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:36,497 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:36,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-04-26 16:24:36,498 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:36,498 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:36,509 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:24:36,510 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread3Thread1of1ForFork2_thidvar1=0} Honda state: {thread3Thread1of1ForFork2_thidvar1=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:24:36,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2025-04-26 16:24:36,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:36,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:36,517 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:36,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-04-26 16:24:36,519 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:36,519 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:36,535 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:24:36,535 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {b=0} Honda state: {b=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:24:36,540 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2025-04-26 16:24:36,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:36,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:36,543 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:36,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-04-26 16:24:36,544 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:36,545 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:36,555 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:24:36,555 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread3Thread1of1ForFork2_thidvar0=0} Honda state: {thread3Thread1of1ForFork2_thidvar0=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:24:36,560 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2025-04-26 16:24:36,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:36,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:36,562 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:36,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-04-26 16:24:36,566 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:36,566 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:36,577 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:24:36,577 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread3Thread1of1ForFork2_thidvar2=0} Honda state: {thread3Thread1of1ForFork2_thidvar2=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:24:36,582 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2025-04-26 16:24:36,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:36,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:36,598 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:36,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2025-04-26 16:24:36,600 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:36,600 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:36,615 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2025-04-26 16:24:36,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:36,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:36,617 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:36,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2025-04-26 16:24:36,619 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:24:36,619 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:36,719 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:24:36,724 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2025-04-26 16:24:36,724 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:36,724 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:36,724 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:36,725 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:36,725 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:24:36,725 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:36,725 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:36,725 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:36,725 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_3_x_t_indep.c.bpl_petrified1_Iteration8_Lasso [2025-04-26 16:24:36,725 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:36,725 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:36,726 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:36,729 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:36,731 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:36,737 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:36,742 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:36,753 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:36,755 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:36,756 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:36,810 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:36,810 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:24:36,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:36,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:36,812 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:36,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2025-04-26 16:24:36,814 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:24:36,823 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:36,824 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:36,824 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:36,824 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:36,825 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:24:36,825 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:24:36,828 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:24:36,833 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2025-04-26 16:24:36,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:36,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:36,835 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:36,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2025-04-26 16:24:36,838 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:24:36,848 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:36,848 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:36,848 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:36,848 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:36,849 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:24:36,849 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:24:36,852 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:24:36,858 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2025-04-26 16:24:36,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:36,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:36,860 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:36,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2025-04-26 16:24:36,863 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:24:36,872 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:36,873 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:36,873 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:36,873 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:36,874 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:24:36,874 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:24:36,879 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:24:36,886 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:36,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:36,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:36,888 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:36,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2025-04-26 16:24:36,891 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:24:36,901 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:36,901 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:36,901 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:36,901 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:36,903 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:24:36,903 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:24:36,907 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:24:36,912 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:24:36,912 INFO L437 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:24:36,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:36,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:36,915 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:36,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2025-04-26 16:24:36,917 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:24:36,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:36,934 INFO L439 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-04-26 16:24:36,934 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:24:36,934 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(t3, n, x3) = -1*t3 + 2*n - 2*x3 Supporting invariants [-1*t3 - 1 >= 0] [2025-04-26 16:24:36,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:36,943 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:24:36,971 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:36,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:24:36,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:24:36,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:36,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:36,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-26 16:24:36,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:36,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:36,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:36,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:36,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:36,987 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:24:36,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:37,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:24:37,009 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:24:37,009 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1016 states and 3874 transitions. cyclomatic complexity: 2983 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:37,080 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1016 states and 3874 transitions. cyclomatic complexity: 2983. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 2420 states and 9377 transitions. Complement of second has 6 states. [2025-04-26 16:24:37,080 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:24:37,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:37,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2025-04-26 16:24:37,081 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 73 transitions. Stem has 5 letters. Loop has 3 letters. [2025-04-26 16:24:37,081 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:37,081 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 73 transitions. Stem has 8 letters. Loop has 3 letters. [2025-04-26 16:24:37,081 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:37,081 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 73 transitions. Stem has 5 letters. Loop has 6 letters. [2025-04-26 16:24:37,081 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:37,081 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2420 states and 9377 transitions. [2025-04-26 16:24:37,136 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:24:37,136 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2420 states to 0 states and 0 transitions. [2025-04-26 16:24:37,136 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:24:37,136 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:24:37,136 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:24:37,136 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:24:37,136 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:24:37,136 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:24:37,137 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:24:37,137 INFO L340 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-04-26 16:24:37,137 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:24:37,137 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:24:37,137 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:24:37,142 INFO L201 PluginConnector]: Adding new model adfg_3_x_t_indep.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:24:37 BoogieIcfgContainer [2025-04-26 16:24:37,142 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:24:37,142 INFO L158 Benchmark]: Toolchain (without parser) took 6749.30ms. Allocated memory was 159.4MB in the beginning and 570.4MB in the end (delta: 411.0MB). Free memory was 87.3MB in the beginning and 434.8MB in the end (delta: -347.4MB). Peak memory consumption was 59.5MB. Max. memory is 8.0GB. [2025-04-26 16:24:37,142 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.20ms. Allocated memory is still 159.4MB. Free memory is still 88.2MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:24:37,143 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.45ms. Allocated memory is still 159.4MB. Free memory was 87.2MB in the beginning and 85.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:24:37,143 INFO L158 Benchmark]: Boogie Preprocessor took 16.80ms. Allocated memory is still 159.4MB. Free memory was 85.3MB in the beginning and 84.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:24:37,143 INFO L158 Benchmark]: RCFGBuilder took 213.45ms. Allocated memory is still 159.4MB. Free memory was 84.3MB in the beginning and 74.7MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:24:37,143 INFO L158 Benchmark]: BuchiAutomizer took 6477.10ms. Allocated memory was 159.4MB in the beginning and 570.4MB in the end (delta: 411.0MB). Free memory was 74.6MB in the beginning and 434.8MB in the end (delta: -360.2MB). Peak memory consumption was 51.1MB. Max. memory is 8.0GB. [2025-04-26 16:24:37,144 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 159.4MB. Free memory is still 88.2MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.45ms. Allocated memory is still 159.4MB. Free memory was 87.2MB in the beginning and 85.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 16.80ms. Allocated memory is still 159.4MB. Free memory was 85.3MB in the beginning and 84.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 213.45ms. Allocated memory is still 159.4MB. Free memory was 84.3MB in the beginning and 74.7MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 6477.10ms. Allocated memory was 159.4MB in the beginning and 570.4MB in the end (delta: 411.0MB). Free memory was 74.6MB in the beginning and 434.8MB in the end (delta: -360.2MB). Peak memory consumption was 51.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.3s and 9 iterations. TraceHistogramMax:1. Analysis of lassos took 3.2s. Construction of modules took 0.2s. Büchi inclusion checks took 1.3s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 6. Automata minimization 0.7s AutomataMinimizationTime, 7 MinimizatonAttempts, 4708 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.6s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [6, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 517 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 517 mSDsluCounter, 724 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 297 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 318 IncrementalHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 427 mSDtfsCounter, 318 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN1 SILU0 SILI0 SILT0 lasso6 LassoPreprocessingBenchmarks: Lassos: inital30 mio100 ax100 hnf100 lsp45 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq184 hnf95 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 26ms VariablesStem: 1 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 10 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.0s InitialAbstractionConstructionTime: 0.0s InitialAbstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (2 trivial, 6 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 -1 * t1 + 2 * n + -2 * x1 and consists of 4 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 2 * n + -2 * x2 + 1 and consists of 4 locations. One deterministic module has affine ranking function 2 * n + t3 + -2 * x3 and consists of 4 locations. One deterministic module has affine ranking function 2 * n + -1 * t3 + -2 * x3 and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 3 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:24:37,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...