/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/Termination.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i /storage/cav23-termute-examples/3_thr/adfg_3_x_n_b_t_indep.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:42:22,997 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:42:23,038 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:42:23,042 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:42:23,042 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:42:23,042 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:42:23,042 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:42:23,065 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:42:23,065 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:42:23,065 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:42:23,066 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:42:23,066 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:42:23,066 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:42:23,066 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:42:23,066 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:42:23,066 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:42:23,066 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:42:23,066 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:42:23,066 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:42:23,066 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:42:23,066 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:42:23,066 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:42:23,066 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:42:23,066 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:42:23,067 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:42:23,067 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:42:23,067 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:42:23,067 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:42:23,067 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:42:23,067 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:42:23,067 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:42:23,067 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:42:23,067 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:42:23,067 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:42:23,067 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:42:23,067 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:42:23,067 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:42:23,067 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:42:23,067 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:42:23,067 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:42:23,067 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:42:23,068 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:42:23,068 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:42:23,272 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:42:23,278 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:42:23,279 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:42:23,280 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:42:23,280 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:42:23,283 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/3_thr/adfg_3_x_n_b_t_indep.c.bpl [2025-04-26 18:42:23,284 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/3_thr/adfg_3_x_n_b_t_indep.c.bpl' [2025-04-26 18:42:23,295 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:42:23,296 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:42:23,296 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:42:23,296 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:42:23,296 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:42:23,303 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "adfg_3_x_n_b_t_indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:23" (1/1) ... [2025-04-26 18:42:23,319 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "adfg_3_x_n_b_t_indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:23" (1/1) ... [2025-04-26 18:42:23,323 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:42:23,323 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:42:23,324 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:42:23,324 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:42:23,324 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:42:23,328 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "adfg_3_x_n_b_t_indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:23" (1/1) ... [2025-04-26 18:42:23,328 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "adfg_3_x_n_b_t_indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:23" (1/1) ... [2025-04-26 18:42:23,329 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "adfg_3_x_n_b_t_indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:23" (1/1) ... [2025-04-26 18:42:23,329 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "adfg_3_x_n_b_t_indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:23" (1/1) ... [2025-04-26 18:42:23,331 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "adfg_3_x_n_b_t_indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:23" (1/1) ... [2025-04-26 18:42:23,331 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "adfg_3_x_n_b_t_indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:23" (1/1) ... [2025-04-26 18:42:23,333 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "adfg_3_x_n_b_t_indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:23" (1/1) ... [2025-04-26 18:42:23,337 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "adfg_3_x_n_b_t_indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:23" (1/1) ... [2025-04-26 18:42:23,338 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "adfg_3_x_n_b_t_indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:23" (1/1) ... [2025-04-26 18:42:23,347 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:42:23,349 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:42:23,349 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:42:23,349 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:42:23,350 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "adfg_3_x_n_b_t_indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:23" (1/1) ... [2025-04-26 18:42:23,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:42:23,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:23,369 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:23,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 18:42:23,387 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:42:23,387 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:42:23,387 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:42:23,387 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:42:23,387 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:42:23,387 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:42:23,387 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 18:42:23,387 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 18:42:23,388 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 18:42:23,388 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:42:23,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:42:23,388 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:42:23,388 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 18:42:23,429 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:42:23,431 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:42:23,506 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:42:23,506 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:42:23,515 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:42:23,516 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:42:23,518 INFO L201 PluginConnector]: Adding new model adfg_3_x_n_b_t_indep.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:42:23 BoogieIcfgContainer [2025-04-26 18:42:23,518 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:42:23,518 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:42:23,518 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:42:23,523 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:42:23,523 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:42:23,523 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "adfg_3_x_n_b_t_indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:23" (1/2) ... [2025-04-26 18:42:23,524 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1b6b9267 and model type adfg_3_x_n_b_t_indep.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:42:23, skipping insertion in model container [2025-04-26 18:42:23,524 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:42:23,524 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "adfg_3_x_n_b_t_indep.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:42:23" (2/2) ... [2025-04-26 18:42:23,525 INFO L376 chiAutomizerObserver]: Analyzing ICFG adfg_3_x_n_b_t_indep.c.bpl [2025-04-26 18:42:23,573 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 18:42:23,618 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:42:23,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:42:23,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:23,622 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:23,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 18:42:23,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 46 transitions, 113 flow [2025-04-26 18:42:23,700 INFO L116 PetriNetUnfolderBase]: 9/40 cut-off events. [2025-04-26 18:42:23,704 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 18:42:23,708 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 18:42:23,709 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 46 transitions, 113 flow [2025-04-26 18:42:23,714 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 40 transitions, 98 flow [2025-04-26 18:42:23,715 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 41 places, 40 transitions, 98 flow [2025-04-26 18:42:23,715 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 41 places, 40 transitions, 98 flow [2025-04-26 18:42:23,787 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 912 states, 911 states have (on average 3.593852908891328) internal successors, (in total 3274), 911 states have internal predecessors, (3274), 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 18:42:23,789 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 912 states, 911 states have (on average 3.593852908891328) internal successors, (in total 3274), 911 states have internal predecessors, (3274), 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 18:42:23,790 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:42:23,896 WARN L140 AmpleReduction]: Number of pruned transitions: 696 [2025-04-26 18:42:23,896 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:42:23,896 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 130 [2025-04-26 18:42:23,896 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:22 [2025-04-26 18:42:23,896 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:345 [2025-04-26 18:42:23,896 WARN L145 AmpleReduction]: Times succ was already a loop node:84 [2025-04-26 18:42:23,896 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:295 [2025-04-26 18:42:23,896 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:42:23,899 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 498 states, 497 states have (on average 2.0321931589537225) internal successors, (in total 1010), 497 states have internal predecessors, (1010), 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 18:42:23,927 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:42:23,927 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:42:23,927 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:42:23,927 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:42:23,927 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:42:23,927 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:42:23,927 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:42:23,928 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:42:23,931 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 498 states, 497 states have (on average 2.0321931589537225) internal successors, (in total 1010), 497 states have internal predecessors, (1010), 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 18:42:23,959 INFO L131 ngComponentsAnalysis]: Automaton has 55 accepting balls. 424 [2025-04-26 18:42:23,959 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:23,959 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:23,964 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 18:42:23,964 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:42:23,964 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:42:23,965 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 498 states, 497 states have (on average 2.0321931589537225) internal successors, (in total 1010), 497 states have internal predecessors, (1010), 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 18:42:23,976 INFO L131 ngComponentsAnalysis]: Automaton has 55 accepting balls. 424 [2025-04-26 18:42:23,976 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:23,976 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:23,976 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 18:42:23,977 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:42:23,983 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-->L32: Formula: (<= 1 v_b1_2) InVars {b1=v_b1_2} OutVars{b1=v_b1_2} AuxVars[] AssignedVars[]" "[115] L32-->L40-2: Formula: (= v_t1_2 1) InVars {} OutVars{t1=v_t1_2} AuxVars[] AssignedVars[t1]" [2025-04-26 18:42:23,983 INFO L754 eck$LassoCheckResult]: Loop: "[118] L40-2-->L40: Formula: (<= v_x1_4 v_n1_2) InVars {x1=v_x1_4, n1=v_n1_2} OutVars{x1=v_x1_4, n1=v_n1_2} AuxVars[] AssignedVars[]" "[120] L40-->L42: Formula: (<= 1 v_b1_4) InVars {b1=v_b1_4} OutVars{b1=v_b1_4} AuxVars[] AssignedVars[]" "[122] L42-->L40-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 18:42:23,987 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:23,987 INFO L85 PathProgramCache]: Analyzing trace with hash 175637, now seen corresponding path program 1 times [2025-04-26 18:42:23,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:23,993 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691308764] [2025-04-26 18:42:23,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:23,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:24,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:24,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:24,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:24,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:24,041 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:24,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:24,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:24,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:24,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:24,058 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:24,063 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:24,064 INFO L85 PathProgramCache]: Analyzing trace with hash 147031, now seen corresponding path program 1 times [2025-04-26 18:42:24,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:24,064 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854059685] [2025-04-26 18:42:24,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:24,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:24,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:24,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:24,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:24,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:24,071 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:24,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:24,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:24,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:24,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:24,075 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:24,076 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:24,076 INFO L85 PathProgramCache]: Analyzing trace with hash 937551811, now seen corresponding path program 1 times [2025-04-26 18:42:24,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:24,076 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270970800] [2025-04-26 18:42:24,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:24,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:24,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:42:24,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:42:24,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:24,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:24,083 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:24,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:42:24,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:42:24,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:24,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:24,088 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:24,170 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:24,170 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:24,170 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:24,170 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:24,171 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:24,171 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:24,171 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:24,171 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:24,171 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_3_x_n_b_t_indep.c.bpl_petrified1_Iteration1_Lasso [2025-04-26 18:42:24,171 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:24,171 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:24,201 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:24,214 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:24,219 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:24,270 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:24,270 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:24,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:24,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:24,293 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 18:42:24,299 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 18:42:24,300 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:24,300 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:24,345 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 18:42:24,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:24,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:24,349 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 18:42:24,350 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 18:42:24,355 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:24,355 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:24,494 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:24,500 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 18:42:24,500 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:24,500 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:24,500 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:24,500 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:24,500 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:24,500 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:24,500 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:24,500 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:24,500 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_3_x_n_b_t_indep.c.bpl_petrified1_Iteration1_Lasso [2025-04-26 18:42:24,500 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:24,500 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:24,502 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:24,506 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:24,511 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:24,555 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:24,558 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:24,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:24,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:24,561 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 18:42:24,562 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 18:42:24,563 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 18:42:24,573 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:24,574 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:24,574 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:24,574 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:24,581 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:42:24,581 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:42:24,591 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:42:24,597 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 18:42:24,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:24,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:24,599 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 18:42:24,601 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 18:42:24,602 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 18:42:24,613 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:24,613 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:24,613 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:24,613 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:24,615 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:42:24,615 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:42:24,618 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:42:24,624 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:24,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:24,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:24,627 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 18:42:24,627 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 18:42:24,630 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:42:24,640 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:24,641 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:24,641 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:24,641 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:24,648 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:42:24,648 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:42:24,657 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:24,667 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:42:24,667 INFO L437 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:42:24,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:24,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:24,670 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 18:42:24,672 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 18:42:24,673 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:24,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:24,692 INFO L439 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-04-26 18:42:24,692 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:24,693 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(n1, x1, t1) = 2*n1 - 2*x1 + 1*t1 Supporting invariants [1*t1 - 1 >= 0] [2025-04-26 18:42:24,699 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 18:42:24,705 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 18:42:24,744 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:24,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:24,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:24,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:24,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:24,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-26 18:42:24,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:24,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:24,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:24,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:24,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:24,773 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 18:42:24,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:24,804 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 18:42:24,821 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 18:42:24,823 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 498 states, 497 states have (on average 2.0321931589537225) internal successors, (in total 1010), 497 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:24,963 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 498 states, 497 states have (on average 2.0321931589537225) internal successors, (in total 1010), 497 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 2040 states and 4148 transitions. Complement of second has 7 states. [2025-04-26 18:42:24,963 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 18:42:24,967 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 18:42:24,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2025-04-26 18:42:24,972 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 119 transitions. Stem has 3 letters. Loop has 3 letters. [2025-04-26 18:42:24,974 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:24,974 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 119 transitions. Stem has 6 letters. Loop has 3 letters. [2025-04-26 18:42:24,974 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:24,974 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 119 transitions. Stem has 3 letters. Loop has 6 letters. [2025-04-26 18:42:24,974 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:24,975 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2040 states and 4148 transitions. [2025-04-26 18:42:24,994 INFO L131 ngComponentsAnalysis]: Automaton has 134 accepting balls. 980 [2025-04-26 18:42:25,015 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2040 states to 1647 states and 3323 transitions. [2025-04-26 18:42:25,016 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1244 [2025-04-26 18:42:25,020 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1403 [2025-04-26 18:42:25,021 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1647 states and 3323 transitions. [2025-04-26 18:42:25,021 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:25,021 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1647 states and 3323 transitions. [2025-04-26 18:42:25,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1647 states and 3323 transitions. [2025-04-26 18:42:25,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1647 to 822. [2025-04-26 18:42:25,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 822 states, 822 states have (on average 2.153284671532847) internal successors, (in total 1770), 821 states have internal predecessors, (1770), 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 18:42:25,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1770 transitions. [2025-04-26 18:42:25,091 INFO L240 hiAutomatonCegarLoop]: Abstraction has 822 states and 1770 transitions. [2025-04-26 18:42:25,091 INFO L438 stractBuchiCegarLoop]: Abstraction has 822 states and 1770 transitions. [2025-04-26 18:42:25,091 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:42:25,091 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 822 states and 1770 transitions. [2025-04-26 18:42:25,095 INFO L131 ngComponentsAnalysis]: Automaton has 55 accepting balls. 424 [2025-04-26 18:42:25,095 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:25,095 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:25,096 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 18:42:25,096 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:42:25,096 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-->L36: Formula: (< v_b1_3 1) InVars {b1=v_b1_3} OutVars{b1=v_b1_3} AuxVars[] AssignedVars[]" "[116] L36-->L40-2: Formula: (= (+ v_t1_3 1) 0) InVars {} OutVars{t1=v_t1_3} AuxVars[] AssignedVars[t1]" [2025-04-26 18:42:25,096 INFO L754 eck$LassoCheckResult]: Loop: "[118] L40-2-->L40: Formula: (<= v_x1_4 v_n1_2) InVars {x1=v_x1_4, n1=v_n1_2} OutVars{x1=v_x1_4, n1=v_n1_2} AuxVars[] AssignedVars[]" "[121] L40-->L46: Formula: (< v_b1_1 1) InVars {b1=v_b1_1} OutVars{b1=v_b1_1} AuxVars[] AssignedVars[]" "[123] L46-->L40-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 18:42:25,096 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:25,097 INFO L85 PathProgramCache]: Analyzing trace with hash 175669, now seen corresponding path program 1 times [2025-04-26 18:42:25,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:25,097 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652350425] [2025-04-26 18:42:25,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:25,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:25,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:25,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:25,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:25,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:25,100 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:25,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:25,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:25,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:25,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:25,104 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:25,104 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:25,104 INFO L85 PathProgramCache]: Analyzing trace with hash 147063, now seen corresponding path program 1 times [2025-04-26 18:42:25,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:25,104 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334089538] [2025-04-26 18:42:25,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:25,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:25,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:25,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:25,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:25,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:25,107 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:25,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:25,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:25,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:25,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:25,115 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:25,115 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:25,115 INFO L85 PathProgramCache]: Analyzing trace with hash 938505155, now seen corresponding path program 1 times [2025-04-26 18:42:25,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:25,117 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667268063] [2025-04-26 18:42:25,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:25,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:25,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:42:25,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:42:25,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:25,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:25,120 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:25,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:42:25,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:42:25,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:25,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:25,127 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:25,166 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:25,166 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:25,166 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:25,166 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:25,166 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:25,166 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:25,166 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:25,166 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:25,166 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_3_x_n_b_t_indep.c.bpl_petrified1_Iteration2_Lasso [2025-04-26 18:42:25,166 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:25,166 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:25,167 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:25,170 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:25,175 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:25,204 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:25,205 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:25,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:25,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:25,206 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 18:42:25,208 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 18:42:25,209 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:25,209 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:25,221 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:42:25,222 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 18:42:25,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:25,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:25,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:25,229 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 18:42:25,230 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 18:42:25,232 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:25,233 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:25,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 18:42:25,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:25,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:25,253 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 18:42:25,254 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 18:42:25,255 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:25,255 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:25,361 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:25,366 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 18:42:25,366 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:25,366 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:25,366 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:25,366 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:25,366 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:25,366 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:25,367 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:25,367 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:25,367 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_3_x_n_b_t_indep.c.bpl_petrified1_Iteration2_Lasso [2025-04-26 18:42:25,367 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:25,367 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:25,367 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:25,372 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:25,378 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:25,412 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:25,412 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:25,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:25,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:25,414 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 18:42:25,415 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 18:42:25,417 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 18:42:25,426 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:25,427 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:25,427 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:25,427 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:25,430 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:42:25,430 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:42:25,433 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:42:25,439 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 18:42:25,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:25,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:25,441 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 18:42:25,442 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 18:42:25,444 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 18:42:25,454 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:25,454 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:25,455 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:25,455 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:25,457 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:42:25,457 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:42:25,462 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:25,467 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 18:42:25,468 INFO L437 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:42:25,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:25,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:25,469 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 18:42:25,471 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 18:42:25,472 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:25,490 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:25,490 INFO L439 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-04-26 18:42:25,490 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:25,490 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(n1, x1) = 2*n1 - 2*x1 + 1 Supporting invariants [-1*t1 - 1 >= 0] [2025-04-26 18:42:25,496 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 18:42:25,499 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 18:42:25,523 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:25,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:25,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:25,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:25,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:25,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-26 18:42:25,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:25,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:25,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:25,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:25,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:25,537 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 18:42:25,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:25,581 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 18:42:25,582 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 18:42:25,582 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 822 states and 1770 transitions. cyclomatic complexity: 1034 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 18:42:25,669 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 822 states and 1770 transitions. cyclomatic complexity: 1034. 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 2313 states and 4803 transitions. Complement of second has 7 states. [2025-04-26 18:42:25,672 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 18:42:25,672 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 18:42:25,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2025-04-26 18:42:25,673 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 115 transitions. Stem has 3 letters. Loop has 3 letters. [2025-04-26 18:42:25,673 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:25,673 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 115 transitions. Stem has 6 letters. Loop has 3 letters. [2025-04-26 18:42:25,673 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:25,673 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 115 transitions. Stem has 3 letters. Loop has 6 letters. [2025-04-26 18:42:25,673 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:25,673 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2313 states and 4803 transitions. [2025-04-26 18:42:25,688 INFO L131 ngComponentsAnalysis]: Automaton has 134 accepting balls. 980 [2025-04-26 18:42:25,701 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2313 states to 1987 states and 4115 transitions. [2025-04-26 18:42:25,701 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1340 [2025-04-26 18:42:25,703 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1499 [2025-04-26 18:42:25,703 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1987 states and 4115 transitions. [2025-04-26 18:42:25,703 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:25,703 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1987 states and 4115 transitions. [2025-04-26 18:42:25,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1987 states and 4115 transitions. [2025-04-26 18:42:25,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1987 to 1162. [2025-04-26 18:42:25,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1162 states, 1162 states have (on average 2.2048192771084336) internal successors, (in total 2562), 1161 states have internal predecessors, (2562), 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 18:42:25,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1162 states to 1162 states and 2562 transitions. [2025-04-26 18:42:25,736 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1162 states and 2562 transitions. [2025-04-26 18:42:25,736 INFO L438 stractBuchiCegarLoop]: Abstraction has 1162 states and 2562 transitions. [2025-04-26 18:42:25,736 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:42:25,736 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1162 states and 2562 transitions. [2025-04-26 18:42:25,741 INFO L131 ngComponentsAnalysis]: Automaton has 55 accepting balls. 424 [2025-04-26 18:42:25,741 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:25,741 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:25,741 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 18:42:25,741 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:42:25,742 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-->L32: Formula: (<= 1 v_b1_2) InVars {b1=v_b1_2} OutVars{b1=v_b1_2} AuxVars[] AssignedVars[]" "[115] L32-->L40-2: Formula: (= v_t1_2 1) InVars {} OutVars{t1=v_t1_2} AuxVars[] AssignedVars[t1]" "[118] L40-2-->L40: Formula: (<= v_x1_4 v_n1_2) InVars {x1=v_x1_4, n1=v_n1_2} OutVars{x1=v_x1_4, n1=v_n1_2} AuxVars[] AssignedVars[]" "[121] L40-->L46: Formula: (< v_b1_1 1) InVars {b1=v_b1_1} OutVars{b1=v_b1_1} AuxVars[] AssignedVars[]" [2025-04-26 18:42:25,742 INFO L754 eck$LassoCheckResult]: Loop: "[123] L46-->L40-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]" "[118] L40-2-->L40: Formula: (<= v_x1_4 v_n1_2) InVars {x1=v_x1_4, n1=v_n1_2} OutVars{x1=v_x1_4, n1=v_n1_2} AuxVars[] AssignedVars[]" "[121] L40-->L46: Formula: (< v_b1_1 1) InVars {b1=v_b1_1} OutVars{b1=v_b1_1} AuxVars[] AssignedVars[]" [2025-04-26 18:42:25,742 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:25,742 INFO L85 PathProgramCache]: Analyzing trace with hash 168790936, now seen corresponding path program 1 times [2025-04-26 18:42:25,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:25,742 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167130580] [2025-04-26 18:42:25,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:25,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:25,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:42:25,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:25,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:25,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:25,777 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 18:42:25,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:42:25,777 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167130580] [2025-04-26 18:42:25,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167130580] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:42:25,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:42:25,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 18:42:25,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238746676] [2025-04-26 18:42:25,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:42:25,781 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:42:25,781 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:25,782 INFO L85 PathProgramCache]: Analyzing trace with hash 151773, now seen corresponding path program 2 times [2025-04-26 18:42:25,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:25,782 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378735406] [2025-04-26 18:42:25,782 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:42:25,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:25,785 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:25,787 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:25,787 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:42:25,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:25,787 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:25,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:25,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:25,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:25,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:25,789 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:25,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:42:25,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 18:42:25,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 18:42:25,808 INFO L87 Difference]: Start difference. First operand 1162 states and 2562 transitions. cyclomatic complexity: 1517 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 18:42:25,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:42:25,829 INFO L93 Difference]: Finished difference Result 1260 states and 2598 transitions. [2025-04-26 18:42:25,829 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1260 states and 2598 transitions. [2025-04-26 18:42:25,836 INFO L131 ngComponentsAnalysis]: Automaton has 79 accepting balls. 483 [2025-04-26 18:42:25,842 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1260 states to 1168 states and 2416 transitions. [2025-04-26 18:42:25,842 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 693 [2025-04-26 18:42:25,843 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 693 [2025-04-26 18:42:25,843 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1168 states and 2416 transitions. [2025-04-26 18:42:25,844 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:25,844 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1168 states and 2416 transitions. [2025-04-26 18:42:25,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states and 2416 transitions. [2025-04-26 18:42:25,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 899. [2025-04-26 18:42:25,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 899 states, 899 states have (on average 2.1512791991101223) internal successors, (in total 1934), 898 states have internal predecessors, (1934), 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 18:42:25,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1934 transitions. [2025-04-26 18:42:25,866 INFO L240 hiAutomatonCegarLoop]: Abstraction has 899 states and 1934 transitions. [2025-04-26 18:42:25,866 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 18:42:25,868 INFO L438 stractBuchiCegarLoop]: Abstraction has 899 states and 1934 transitions. [2025-04-26 18:42:25,868 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:42:25,868 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 899 states and 1934 transitions. [2025-04-26 18:42:25,870 INFO L131 ngComponentsAnalysis]: Automaton has 55 accepting balls. 351 [2025-04-26 18:42:25,870 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:25,870 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:25,871 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 18:42:25,871 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:42:25,871 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-->L36: Formula: (< v_b1_3 1) InVars {b1=v_b1_3} OutVars{b1=v_b1_3} AuxVars[] AssignedVars[]" "[116] L36-->L40-2: Formula: (= (+ v_t1_3 1) 0) InVars {} OutVars{t1=v_t1_3} AuxVars[] AssignedVars[t1]" "[118] L40-2-->L40: Formula: (<= v_x1_4 v_n1_2) InVars {x1=v_x1_4, n1=v_n1_2} OutVars{x1=v_x1_4, n1=v_n1_2} AuxVars[] AssignedVars[]" [2025-04-26 18:42:25,871 INFO L754 eck$LassoCheckResult]: Loop: "[120] L40-->L42: Formula: (<= 1 v_b1_4) InVars {b1=v_b1_4} OutVars{b1=v_b1_4} AuxVars[] AssignedVars[]" "[122] L42-->L40-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] L40-2-->L40: Formula: (<= v_x1_4 v_n1_2) InVars {x1=v_x1_4, n1=v_n1_2} OutVars{x1=v_x1_4, n1=v_n1_2} AuxVars[] AssignedVars[]" [2025-04-26 18:42:25,871 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:25,871 INFO L85 PathProgramCache]: Analyzing trace with hash 5445857, now seen corresponding path program 1 times [2025-04-26 18:42:25,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:25,871 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629973761] [2025-04-26 18:42:25,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:25,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:25,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:42:25,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:42:25,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:25,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:25,876 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:25,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:42:25,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:42:25,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:25,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:25,882 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:25,882 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:25,882 INFO L85 PathProgramCache]: Analyzing trace with hash 149011, now seen corresponding path program 2 times [2025-04-26 18:42:25,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:25,882 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002288718] [2025-04-26 18:42:25,882 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:42:25,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:25,884 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:25,884 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:25,884 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:42:25,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:25,885 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:25,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:25,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:25,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:25,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:25,886 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:25,887 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:25,887 INFO L85 PathProgramCache]: Analyzing trace with hash -971112141, now seen corresponding path program 1 times [2025-04-26 18:42:25,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:25,887 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293079253] [2025-04-26 18:42:25,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:25,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:25,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:42:25,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:42:25,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:25,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:25,898 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:42:25,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:42:25,898 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293079253] [2025-04-26 18:42:25,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293079253] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:42:25,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:42:25,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 18:42:25,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409259508] [2025-04-26 18:42:25,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:42:25,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:42:25,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 18:42:25,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 18:42:25,916 INFO L87 Difference]: Start difference. First operand 899 states and 1934 transitions. cyclomatic complexity: 1148 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 18:42:25,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:42:25,942 INFO L93 Difference]: Finished difference Result 940 states and 1875 transitions. [2025-04-26 18:42:25,944 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 940 states and 1875 transitions. [2025-04-26 18:42:25,948 INFO L131 ngComponentsAnalysis]: Automaton has 48 accepting balls. 264 [2025-04-26 18:42:25,952 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 940 states to 848 states and 1693 transitions. [2025-04-26 18:42:25,952 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 386 [2025-04-26 18:42:25,952 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 386 [2025-04-26 18:42:25,953 INFO L74 IsDeterministic]: Start isDeterministic. Operand 848 states and 1693 transitions. [2025-04-26 18:42:25,953 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:25,953 INFO L218 hiAutomatonCegarLoop]: Abstraction has 848 states and 1693 transitions. [2025-04-26 18:42:25,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states and 1693 transitions. [2025-04-26 18:42:25,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 658. [2025-04-26 18:42:25,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 658 states have (on average 2.080547112462006) internal successors, (in total 1369), 657 states have internal predecessors, (1369), 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 18:42:25,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 1369 transitions. [2025-04-26 18:42:25,967 INFO L240 hiAutomatonCegarLoop]: Abstraction has 658 states and 1369 transitions. [2025-04-26 18:42:25,967 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 18:42:25,968 INFO L438 stractBuchiCegarLoop]: Abstraction has 658 states and 1369 transitions. [2025-04-26 18:42:25,968 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 18:42:25,968 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 658 states and 1369 transitions. [2025-04-26 18:42:25,970 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 132 [2025-04-26 18:42:25,970 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:25,970 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:25,970 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:42:25,970 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:42:25,971 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-->L32: Formula: (<= 1 v_b1_2) InVars {b1=v_b1_2} OutVars{b1=v_b1_2} AuxVars[] AssignedVars[]" "[115] L32-->L40-2: Formula: (= v_t1_2 1) InVars {} OutVars{t1=v_t1_2} AuxVars[] AssignedVars[t1]" "[117] L40-2-->thread1FINAL: Formula: (< v_n1_1 v_x1_3) InVars {x1=v_x1_3, n1=v_n1_1} OutVars{x1=v_x1_3, n1=v_n1_1} AuxVars[] AssignedVars[]" "[119] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[151] L19-->$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-->L56: Formula: (<= 1 v_b2_3) InVars {b2=v_b2_3} OutVars{b2=v_b2_3} AuxVars[] AssignedVars[]" "[126] L56-->L64-2: Formula: (= v_t2_3 1) InVars {} OutVars{t2=v_t2_3} AuxVars[] AssignedVars[t2]" [2025-04-26 18:42:25,971 INFO L754 eck$LassoCheckResult]: Loop: "[129] L64-2-->L64: Formula: (<= v_x2_1 v_n2_1) InVars {n2=v_n2_1, x2=v_x2_1} OutVars{n2=v_n2_1, x2=v_x2_1} AuxVars[] AssignedVars[]" "[131] L64-->L66: Formula: (<= 1 v_b2_1) InVars {b2=v_b2_1} OutVars{b2=v_b2_1} AuxVars[] AssignedVars[]" "[133] L66-->L64-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 18:42:25,971 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:25,971 INFO L85 PathProgramCache]: Analyzing trace with hash -956763262, now seen corresponding path program 1 times [2025-04-26 18:42:25,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:25,971 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019968793] [2025-04-26 18:42:25,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:25,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:25,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:42:25,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:42:25,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:25,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:25,978 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:25,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:42:25,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:42:25,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:25,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:25,984 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:25,985 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:25,985 INFO L85 PathProgramCache]: Analyzing trace with hash 157954, now seen corresponding path program 1 times [2025-04-26 18:42:25,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:25,985 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712605165] [2025-04-26 18:42:25,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:25,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:25,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:25,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:25,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:25,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:25,987 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:25,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:25,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:25,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:25,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:26,000 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:26,001 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:26,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1531233823, now seen corresponding path program 1 times [2025-04-26 18:42:26,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:26,001 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325588053] [2025-04-26 18:42:26,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:26,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:26,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:42:26,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:42:26,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:26,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:26,004 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:26,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:42:26,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:42:26,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:26,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:26,007 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:26,064 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:26,064 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:26,064 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:26,065 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:26,065 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:26,065 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:26,065 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:26,065 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:26,065 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_3_x_n_b_t_indep.c.bpl_petrified1_Iteration5_Lasso [2025-04-26 18:42:26,065 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:26,065 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:26,065 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:26,068 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:26,070 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:26,073 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:26,077 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:26,080 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:26,082 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:26,085 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:26,138 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:26,138 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:26,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:26,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:26,143 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 18:42:26,144 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 18:42:26,145 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:26,145 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:26,163 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:42:26,163 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {n1=0, x1=1} Honda state: {n1=0, x1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:42:26,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-04-26 18:42:26,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:26,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:26,173 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 18:42:26,175 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 18:42:26,176 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:26,176 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:26,190 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:42:26,191 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 18:42:26,196 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 18:42:26,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:26,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:26,199 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 18:42:26,199 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 18:42:26,201 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:26,202 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:26,213 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:42:26,213 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 18:42:26,219 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 18:42:26,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:26,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:26,221 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 18:42:26,221 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 18:42:26,223 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:26,223 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:26,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:26,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:26,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:26,243 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 18:42:26,244 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 18:42:26,246 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:26,246 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:26,388 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:26,394 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-04-26 18:42:26,394 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:26,394 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:26,394 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:26,394 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:26,394 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:26,394 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:26,394 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:26,394 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:26,394 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_3_x_n_b_t_indep.c.bpl_petrified1_Iteration5_Lasso [2025-04-26 18:42:26,394 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:26,394 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:26,395 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:26,398 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:26,401 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:26,406 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:26,408 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:26,410 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:26,413 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:26,415 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:26,476 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:26,476 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:26,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:26,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:26,480 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 18:42:26,480 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 18:42:26,482 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 18:42:26,492 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:26,492 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:26,492 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:26,492 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:26,495 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:42:26,495 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:42:26,498 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:42:26,503 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-04-26 18:42:26,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:26,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:26,505 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 18:42:26,508 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 18:42:26,509 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 18:42:26,519 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:26,519 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:26,519 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:26,519 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:26,521 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:42:26,522 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:42:26,524 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:42:26,530 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 18:42:26,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:26,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:26,532 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 18:42:26,534 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 18:42:26,535 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:42:26,545 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:26,545 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:26,545 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:26,545 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:26,549 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:42:26,549 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:42:26,554 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:26,562 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 18:42:26,562 INFO L437 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:42:26,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:26,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:26,565 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 18:42:26,566 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 18:42:26,567 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:26,583 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 18:42:26,584 INFO L439 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-04-26 18:42:26,584 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:26,584 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(n2, x2) = 2*n2 - 2*x2 + 1 Supporting invariants [1*t2 - 1 >= 0] [2025-04-26 18:42:26,590 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:26,592 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 18:42:26,614 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:26,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:42:26,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:42:26,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:26,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:26,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-26 18:42:26,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:26,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:26,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:26,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:26,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:26,630 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 18:42:26,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:26,650 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 18:42:26,651 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 18:42:26,651 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 658 states and 1369 transitions. cyclomatic complexity: 789 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 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 18:42:26,701 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 658 states and 1369 transitions. cyclomatic complexity: 789. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 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 2295 states and 4757 transitions. Complement of second has 7 states. [2025-04-26 18:42:26,702 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 18:42:26,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 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 18:42:26,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 101 transitions. [2025-04-26 18:42:26,702 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 101 transitions. Stem has 8 letters. Loop has 3 letters. [2025-04-26 18:42:26,702 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:26,702 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 101 transitions. Stem has 11 letters. Loop has 3 letters. [2025-04-26 18:42:26,702 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:26,703 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 101 transitions. Stem has 8 letters. Loop has 6 letters. [2025-04-26 18:42:26,703 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:26,703 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2295 states and 4757 transitions. [2025-04-26 18:42:26,714 INFO L131 ngComponentsAnalysis]: Automaton has 55 accepting balls. 292 [2025-04-26 18:42:26,723 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2295 states to 1961 states and 4044 transitions. [2025-04-26 18:42:26,723 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 527 [2025-04-26 18:42:26,724 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 584 [2025-04-26 18:42:26,724 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1961 states and 4044 transitions. [2025-04-26 18:42:26,724 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:26,724 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1961 states and 4044 transitions. [2025-04-26 18:42:26,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1961 states and 4044 transitions. [2025-04-26 18:42:26,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1961 to 1181. [2025-04-26 18:42:26,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1181 states, 1181 states have (on average 2.0914479254868756) internal successors, (in total 2470), 1180 states have internal predecessors, (2470), 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 18:42:26,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1181 states to 1181 states and 2470 transitions. [2025-04-26 18:42:26,744 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1181 states and 2470 transitions. [2025-04-26 18:42:26,744 INFO L438 stractBuchiCegarLoop]: Abstraction has 1181 states and 2470 transitions. [2025-04-26 18:42:26,744 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 18:42:26,744 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1181 states and 2470 transitions. [2025-04-26 18:42:26,747 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 132 [2025-04-26 18:42:26,747 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:26,747 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:26,748 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:42:26,748 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:42:26,748 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-->L32: Formula: (<= 1 v_b1_2) InVars {b1=v_b1_2} OutVars{b1=v_b1_2} AuxVars[] AssignedVars[]" "[115] L32-->L40-2: Formula: (= v_t1_2 1) InVars {} OutVars{t1=v_t1_2} AuxVars[] AssignedVars[t1]" "[117] L40-2-->thread1FINAL: Formula: (< v_n1_1 v_x1_3) InVars {x1=v_x1_3, n1=v_n1_1} OutVars{x1=v_x1_3, n1=v_n1_1} AuxVars[] AssignedVars[]" "[119] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[151] L19-->$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-->L60: Formula: (< v_b2_4 1) InVars {b2=v_b2_4} OutVars{b2=v_b2_4} AuxVars[] AssignedVars[]" "[127] L60-->L64-2: Formula: (= (+ v_t2_4 1) 0) InVars {} OutVars{t2=v_t2_4} AuxVars[] AssignedVars[t2]" [2025-04-26 18:42:26,748 INFO L754 eck$LassoCheckResult]: Loop: "[129] L64-2-->L64: Formula: (<= v_x2_1 v_n2_1) InVars {n2=v_n2_1, x2=v_x2_1} OutVars{n2=v_n2_1, x2=v_x2_1} AuxVars[] AssignedVars[]" "[132] L64-->L70: Formula: (< v_b2_2 1) InVars {b2=v_b2_2} OutVars{b2=v_b2_2} AuxVars[] AssignedVars[]" "[134] L70-->L64-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 18:42:26,748 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:26,748 INFO L85 PathProgramCache]: Analyzing trace with hash -956763230, now seen corresponding path program 1 times [2025-04-26 18:42:26,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:26,749 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137303169] [2025-04-26 18:42:26,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:26,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:26,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:42:26,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:42:26,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:26,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:26,752 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:26,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:42:26,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:42:26,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:26,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:26,755 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:26,755 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:26,755 INFO L85 PathProgramCache]: Analyzing trace with hash 157986, now seen corresponding path program 1 times [2025-04-26 18:42:26,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:26,755 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354854449] [2025-04-26 18:42:26,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:26,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:26,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:26,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:26,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:26,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:26,757 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:26,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:26,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:26,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:26,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:26,759 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:26,759 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:26,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1530280479, now seen corresponding path program 1 times [2025-04-26 18:42:26,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:26,759 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865705013] [2025-04-26 18:42:26,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:26,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:26,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:42:26,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:42:26,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:26,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:26,762 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:26,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:42:26,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:42:26,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:26,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:26,769 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:26,826 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:26,826 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:26,826 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:26,826 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:26,826 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:26,826 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:26,826 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:26,826 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:26,826 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_3_x_n_b_t_indep.c.bpl_petrified1_Iteration6_Lasso [2025-04-26 18:42:26,826 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:26,826 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:26,827 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:26,830 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:26,834 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:26,838 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:26,840 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:26,841 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:26,843 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:26,845 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:26,894 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:26,894 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:26,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:26,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:26,897 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 18:42:26,899 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 18:42:26,900 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:26,900 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:26,931 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:42:26,931 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {n1=0, x1=1} Honda state: {n1=0, x1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:42:26,937 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-04-26 18:42:26,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:26,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:26,939 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 18:42:26,941 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 18:42:26,942 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:26,942 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:26,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:26,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:26,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:26,961 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 18:42:26,962 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 18:42:26,963 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:26,963 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:27,069 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:27,074 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 18:42:27,074 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:27,074 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:27,074 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:27,074 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:27,074 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:27,074 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:27,077 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:27,077 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:27,078 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_3_x_n_b_t_indep.c.bpl_petrified1_Iteration6_Lasso [2025-04-26 18:42:27,078 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:27,078 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:27,078 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:27,083 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:27,085 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:27,089 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:27,093 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:27,095 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:27,098 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:27,102 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:27,157 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:27,157 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:27,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:27,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:27,159 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 18:42:27,161 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 18:42:27,161 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 18:42:27,172 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:27,172 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:27,172 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:27,172 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:27,173 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:42:27,173 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:42:27,176 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:42:27,185 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-04-26 18:42:27,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:27,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:27,187 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 18:42:27,187 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 18:42:27,190 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 18:42:27,200 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:27,200 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:27,200 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:27,200 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:27,202 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:42:27,202 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:42:27,204 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:42:27,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:27,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:27,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:27,212 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 18:42:27,213 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 18:42:27,215 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 18:42:27,225 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:27,225 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:27,225 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:27,225 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:27,227 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:42:27,227 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:42:27,231 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:27,234 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:42:27,234 INFO L437 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:42:27,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:27,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:27,236 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 18:42:27,238 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 18:42:27,238 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:27,255 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 18:42:27,255 INFO L439 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-04-26 18:42:27,255 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:27,255 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(n2, x2) = 2*n2 - 2*x2 + 1 Supporting invariants [-1*t2 - 1 >= 0] [2025-04-26 18:42:27,261 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 18:42:27,264 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 18:42:27,286 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:27,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:42:27,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:42:27,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:27,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:27,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-26 18:42:27,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:27,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:27,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:27,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:27,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:27,303 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 18:42:27,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:27,324 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 18:42:27,324 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 18:42:27,324 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1181 states and 2470 transitions. cyclomatic complexity: 1420 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 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 18:42:27,382 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1181 states and 2470 transitions. cyclomatic complexity: 1420. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 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 2818 states and 5858 transitions. Complement of second has 7 states. [2025-04-26 18:42:27,382 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 18:42:27,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 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 18:42:27,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 101 transitions. [2025-04-26 18:42:27,383 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 101 transitions. Stem has 8 letters. Loop has 3 letters. [2025-04-26 18:42:27,383 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:27,383 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 101 transitions. Stem has 11 letters. Loop has 3 letters. [2025-04-26 18:42:27,383 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:27,383 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 101 transitions. Stem has 8 letters. Loop has 6 letters. [2025-04-26 18:42:27,383 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:27,383 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2818 states and 5858 transitions. [2025-04-26 18:42:27,397 INFO L131 ngComponentsAnalysis]: Automaton has 55 accepting balls. 292 [2025-04-26 18:42:27,409 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2818 states to 2484 states and 5145 transitions. [2025-04-26 18:42:27,409 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 625 [2025-04-26 18:42:27,411 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 682 [2025-04-26 18:42:27,411 INFO L74 IsDeterministic]: Start isDeterministic. Operand 2484 states and 5145 transitions. [2025-04-26 18:42:27,411 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:27,411 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2484 states and 5145 transitions. [2025-04-26 18:42:27,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2484 states and 5145 transitions. [2025-04-26 18:42:27,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2484 to 1704. [2025-04-26 18:42:27,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1704 states, 1704 states have (on average 2.095657276995305) internal successors, (in total 3571), 1703 states have internal predecessors, (3571), 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 18:42:27,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1704 states to 1704 states and 3571 transitions. [2025-04-26 18:42:27,442 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1704 states and 3571 transitions. [2025-04-26 18:42:27,442 INFO L438 stractBuchiCegarLoop]: Abstraction has 1704 states and 3571 transitions. [2025-04-26 18:42:27,442 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 18:42:27,442 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1704 states and 3571 transitions. [2025-04-26 18:42:27,447 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 132 [2025-04-26 18:42:27,447 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:27,447 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:27,447 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:42:27,447 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:42:27,448 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-->L32: Formula: (<= 1 v_b1_2) InVars {b1=v_b1_2} OutVars{b1=v_b1_2} AuxVars[] AssignedVars[]" "[115] L32-->L40-2: Formula: (= v_t1_2 1) InVars {} OutVars{t1=v_t1_2} AuxVars[] AssignedVars[t1]" "[117] L40-2-->thread1FINAL: Formula: (< v_n1_1 v_x1_3) InVars {x1=v_x1_3, n1=v_n1_1} OutVars{x1=v_x1_3, n1=v_n1_1} AuxVars[] AssignedVars[]" "[119] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[151] L19-->$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-->L56: Formula: (<= 1 v_b2_3) InVars {b2=v_b2_3} OutVars{b2=v_b2_3} AuxVars[] AssignedVars[]" "[126] L56-->L64-2: Formula: (= v_t2_3 1) InVars {} OutVars{t2=v_t2_3} AuxVars[] AssignedVars[t2]" "[129] L64-2-->L64: Formula: (<= v_x2_1 v_n2_1) InVars {n2=v_n2_1, x2=v_x2_1} OutVars{n2=v_n2_1, x2=v_x2_1} AuxVars[] AssignedVars[]" "[132] L64-->L70: Formula: (< v_b2_2 1) InVars {b2=v_b2_2} OutVars{b2=v_b2_2} AuxVars[] AssignedVars[]" [2025-04-26 18:42:27,448 INFO L754 eck$LassoCheckResult]: Loop: "[134] L70-->L64-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]" "[129] L64-2-->L64: Formula: (<= v_x2_1 v_n2_1) InVars {n2=v_n2_1, x2=v_x2_1} OutVars{n2=v_n2_1, x2=v_x2_1} AuxVars[] AssignedVars[]" "[132] L64-->L70: Formula: (< v_b2_2 1) InVars {b2=v_b2_2} OutVars{b2=v_b2_2} AuxVars[] AssignedVars[]" [2025-04-26 18:42:27,448 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:27,448 INFO L85 PathProgramCache]: Analyzing trace with hash -326489307, now seen corresponding path program 1 times [2025-04-26 18:42:27,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:27,448 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871721240] [2025-04-26 18:42:27,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:27,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:27,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:42:27,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:42:27,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:27,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:27,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:42:27,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:42:27,467 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871721240] [2025-04-26 18:42:27,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871721240] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:42:27,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:42:27,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 18:42:27,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569660952] [2025-04-26 18:42:27,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:42:27,467 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:42:27,468 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:27,468 INFO L85 PathProgramCache]: Analyzing trace with hash 162696, now seen corresponding path program 2 times [2025-04-26 18:42:27,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:27,468 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462293993] [2025-04-26 18:42:27,468 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:42:27,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:27,469 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:27,470 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:27,470 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:42:27,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:27,470 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:27,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:27,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:27,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:27,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:27,474 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:27,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:42:27,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 18:42:27,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 18:42:27,492 INFO L87 Difference]: Start difference. First operand 1704 states and 3571 transitions. cyclomatic complexity: 2051 Second operand has 3 states, 2 states have (on average 5.0) internal successors, (in total 10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:27,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:42:27,513 INFO L93 Difference]: Finished difference Result 1757 states and 3550 transitions. [2025-04-26 18:42:27,513 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1757 states and 3550 transitions. [2025-04-26 18:42:27,520 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 134 [2025-04-26 18:42:27,527 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1757 states to 1558 states and 3148 transitions. [2025-04-26 18:42:27,528 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 363 [2025-04-26 18:42:27,529 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 363 [2025-04-26 18:42:27,529 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1558 states and 3148 transitions. [2025-04-26 18:42:27,529 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:27,529 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1558 states and 3148 transitions. [2025-04-26 18:42:27,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1558 states and 3148 transitions. [2025-04-26 18:42:27,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1558 to 1242. [2025-04-26 18:42:27,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1242 states, 1242 states have (on average 2.036231884057971) internal successors, (in total 2529), 1241 states have internal predecessors, (2529), 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 18:42:27,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1242 states to 1242 states and 2529 transitions. [2025-04-26 18:42:27,558 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1242 states and 2529 transitions. [2025-04-26 18:42:27,559 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 18:42:27,560 INFO L438 stractBuchiCegarLoop]: Abstraction has 1242 states and 2529 transitions. [2025-04-26 18:42:27,560 INFO L340 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-04-26 18:42:27,560 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1242 states and 2529 transitions. [2025-04-26 18:42:27,564 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 106 [2025-04-26 18:42:27,564 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:27,564 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:27,564 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:42:27,564 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:42:27,565 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-->L32: Formula: (<= 1 v_b1_2) InVars {b1=v_b1_2} OutVars{b1=v_b1_2} AuxVars[] AssignedVars[]" "[115] L32-->L40-2: Formula: (= v_t1_2 1) InVars {} OutVars{t1=v_t1_2} AuxVars[] AssignedVars[t1]" "[117] L40-2-->thread1FINAL: Formula: (< v_n1_1 v_x1_3) InVars {x1=v_x1_3, n1=v_n1_1} OutVars{x1=v_x1_3, n1=v_n1_1} AuxVars[] AssignedVars[]" "[119] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[151] L19-->$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-->L60: Formula: (< v_b2_4 1) InVars {b2=v_b2_4} OutVars{b2=v_b2_4} AuxVars[] AssignedVars[]" "[127] L60-->L64-2: Formula: (= (+ v_t2_4 1) 0) InVars {} OutVars{t2=v_t2_4} AuxVars[] AssignedVars[t2]" "[129] L64-2-->L64: Formula: (<= v_x2_1 v_n2_1) InVars {n2=v_n2_1, x2=v_x2_1} OutVars{n2=v_n2_1, x2=v_x2_1} AuxVars[] AssignedVars[]" [2025-04-26 18:42:27,565 INFO L754 eck$LassoCheckResult]: Loop: "[131] L64-->L66: Formula: (<= 1 v_b2_1) InVars {b2=v_b2_1} OutVars{b2=v_b2_1} AuxVars[] AssignedVars[]" "[133] L66-->L64-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]" "[129] L64-2-->L64: Formula: (<= v_x2_1 v_n2_1) InVars {n2=v_n2_1, x2=v_x2_1} OutVars{n2=v_n2_1, x2=v_x2_1} AuxVars[] AssignedVars[]" [2025-04-26 18:42:27,565 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:27,565 INFO L85 PathProgramCache]: Analyzing trace with hash 405111071, now seen corresponding path program 1 times [2025-04-26 18:42:27,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:27,565 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275845229] [2025-04-26 18:42:27,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:27,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:27,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:42:27,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:42:27,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:27,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:27,570 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:27,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:42:27,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:42:27,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:27,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:27,572 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:27,574 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:27,574 INFO L85 PathProgramCache]: Analyzing trace with hash 159934, now seen corresponding path program 2 times [2025-04-26 18:42:27,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:27,574 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042076544] [2025-04-26 18:42:27,574 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:42:27,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:27,576 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:27,577 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:27,577 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:42:27,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:27,577 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:27,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:27,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:27,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:27,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:27,581 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:27,581 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:27,581 INFO L85 PathProgramCache]: Analyzing trace with hash -194055456, now seen corresponding path program 1 times [2025-04-26 18:42:27,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:27,581 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551388200] [2025-04-26 18:42:27,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:27,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:27,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:42:27,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:42:27,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:27,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:27,599 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:42:27,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:42:27,599 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551388200] [2025-04-26 18:42:27,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551388200] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:42:27,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:42:27,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 18:42:27,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228328303] [2025-04-26 18:42:27,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:42:27,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:42:27,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 18:42:27,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 18:42:27,613 INFO L87 Difference]: Start difference. First operand 1242 states and 2529 transitions. cyclomatic complexity: 1417 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:27,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:42:27,627 INFO L93 Difference]: Finished difference Result 1282 states and 2527 transitions. [2025-04-26 18:42:27,627 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1282 states and 2527 transitions. [2025-04-26 18:42:27,632 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 56 [2025-04-26 18:42:27,636 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1282 states to 1083 states and 2125 transitions. [2025-04-26 18:42:27,636 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 227 [2025-04-26 18:42:27,637 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 227 [2025-04-26 18:42:27,637 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1083 states and 2125 transitions. [2025-04-26 18:42:27,637 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:27,637 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1083 states and 2125 transitions. [2025-04-26 18:42:27,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states and 2125 transitions. [2025-04-26 18:42:27,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 876. [2025-04-26 18:42:27,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 876 states, 876 states have (on average 1.9931506849315068) internal successors, (in total 1746), 875 states have internal predecessors, (1746), 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 18:42:27,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1746 transitions. [2025-04-26 18:42:27,648 INFO L240 hiAutomatonCegarLoop]: Abstraction has 876 states and 1746 transitions. [2025-04-26 18:42:27,649 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 18:42:27,649 INFO L438 stractBuchiCegarLoop]: Abstraction has 876 states and 1746 transitions. [2025-04-26 18:42:27,649 INFO L340 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-04-26 18:42:27,649 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 876 states and 1746 transitions. [2025-04-26 18:42:27,651 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 28 [2025-04-26 18:42:27,651 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:27,651 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:27,651 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:42:27,651 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:42:27,652 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-->L32: Formula: (<= 1 v_b1_2) InVars {b1=v_b1_2} OutVars{b1=v_b1_2} AuxVars[] AssignedVars[]" "[115] L32-->L40-2: Formula: (= v_t1_2 1) InVars {} OutVars{t1=v_t1_2} AuxVars[] AssignedVars[t1]" "[117] L40-2-->thread1FINAL: Formula: (< v_n1_1 v_x1_3) InVars {x1=v_x1_3, n1=v_n1_1} OutVars{x1=v_x1_3, n1=v_n1_1} AuxVars[] AssignedVars[]" "[119] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[151] L19-->$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-->L56: Formula: (<= 1 v_b2_3) InVars {b2=v_b2_3} OutVars{b2=v_b2_3} AuxVars[] AssignedVars[]" "[126] L56-->L64-2: Formula: (= v_t2_3 1) InVars {} OutVars{t2=v_t2_3} AuxVars[] AssignedVars[t2]" "[128] L64-2-->thread2FINAL: Formula: (< v_n2_2 v_x2_6) InVars {n2=v_n2_2, x2=v_x2_6} OutVars{n2=v_n2_2, x2=v_x2_6} AuxVars[] AssignedVars[]" "[130] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[154] L20-->$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-->L80: Formula: (<= 1 v_b3_4) InVars {b3=v_b3_4} OutVars{b3=v_b3_4} AuxVars[] AssignedVars[]" "[137] L80-->L88-2: Formula: (= v_t3_4 1) InVars {} OutVars{t3=v_t3_4} AuxVars[] AssignedVars[t3]" [2025-04-26 18:42:27,652 INFO L754 eck$LassoCheckResult]: Loop: "[140] L88-2-->L88: Formula: (<= v_x3_2 v_n3_2) InVars {n3=v_n3_2, x3=v_x3_2} OutVars{n3=v_n3_2, x3=v_x3_2} AuxVars[] AssignedVars[]" "[142] L88-->L90: Formula: (<= 1 v_b3_2) InVars {b3=v_b3_2} OutVars{b3=v_b3_2} AuxVars[] AssignedVars[]" "[144] L90-->L88-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 18:42:27,652 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:27,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1657149816, now seen corresponding path program 1 times [2025-04-26 18:42:27,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:27,652 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182759144] [2025-04-26 18:42:27,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:27,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:27,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:42:27,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:42:27,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:27,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:27,656 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:27,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:42:27,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:42:27,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:27,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:27,663 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:27,663 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:27,663 INFO L85 PathProgramCache]: Analyzing trace with hash 168877, now seen corresponding path program 1 times [2025-04-26 18:42:27,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:27,664 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387722693] [2025-04-26 18:42:27,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:27,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:27,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:27,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:27,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:27,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:27,668 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:27,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:27,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:27,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:27,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:27,673 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:27,673 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:27,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1796207318, now seen corresponding path program 1 times [2025-04-26 18:42:27,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:27,673 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47814316] [2025-04-26 18:42:27,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:27,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:27,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 18:42:27,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 18:42:27,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:27,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:27,679 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:27,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 18:42:27,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 18:42:27,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:27,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:27,685 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:27,772 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:27,772 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:27,772 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:27,772 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:27,772 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:27,772 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:27,772 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:27,772 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:27,772 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_3_x_n_b_t_indep.c.bpl_petrified1_Iteration9_Lasso [2025-04-26 18:42:27,772 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:27,772 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:27,773 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:27,776 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:27,779 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:27,781 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:27,783 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:27,787 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:27,789 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:27,792 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:27,794 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:27,796 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:27,798 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:27,800 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:27,802 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:27,804 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:27,883 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:27,884 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:27,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:27,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:27,885 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 18:42:27,887 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 18:42:27,889 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:27,889 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:27,900 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:42:27,900 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {t1=0} Honda state: {t1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:42:27,906 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 18:42:27,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:27,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:27,909 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 18:42:27,911 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 18:42:27,912 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:27,912 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:27,923 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:42:27,923 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {t2=0} Honda state: {t2=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:42:27,929 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:27,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:27,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:27,931 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 18:42:27,932 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 18:42:27,934 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:27,934 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:27,951 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:42:27,951 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {n2=0, x2=1} Honda state: {n2=0, x2=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:42:27,957 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 18:42:27,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:27,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:27,959 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 18:42:27,960 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 18:42:27,963 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:27,963 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:27,974 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:42:27,974 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 18:42:27,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:27,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:27,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:27,983 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 18:42:27,984 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 18:42:27,985 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:27,985 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:28,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:28,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:28,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:28,006 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 18:42:28,008 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 18:42:28,009 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:28,009 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:28,147 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:28,153 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 18:42:28,153 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:28,153 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:28,153 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:28,153 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:28,154 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:28,154 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:28,154 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:28,154 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:28,154 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_3_x_n_b_t_indep.c.bpl_petrified1_Iteration9_Lasso [2025-04-26 18:42:28,154 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:28,154 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:28,155 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:28,158 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:28,160 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:28,162 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:28,166 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:28,169 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:28,172 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:28,173 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:28,175 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:28,176 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:28,178 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:28,182 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:28,185 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:28,186 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:28,264 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:28,264 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:28,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:28,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:28,269 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 18:42:28,270 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 18:42:28,270 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 18:42:28,280 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:28,281 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:28,281 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:28,281 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:28,282 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:42:28,282 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:42:28,284 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:42:28,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:28,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:28,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:28,292 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 18:42:28,293 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 18:42:28,296 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 18:42:28,306 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:28,306 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:28,306 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:28,306 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:28,309 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:42:28,309 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:42:28,311 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:42:28,317 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 18:42:28,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:28,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:28,320 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 18:42:28,321 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 18:42:28,322 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 18:42:28,332 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:28,333 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:28,333 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:28,333 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:28,334 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:42:28,334 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:42:28,343 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:42:28,349 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:28,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:28,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:28,351 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 18:42:28,353 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 18:42:28,354 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 18:42:28,364 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:28,364 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:28,364 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:28,365 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:28,366 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:42:28,366 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:42:28,370 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:28,374 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:42:28,374 INFO L437 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:42:28,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:28,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:28,376 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 18:42:28,378 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 18:42:28,379 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:28,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:28,399 INFO L439 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-04-26 18:42:28,399 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:28,399 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(n3, x3) = 2*n3 - 2*x3 + 1 Supporting invariants [1*t3 - 1 >= 0] [2025-04-26 18:42:28,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:28,408 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 18:42:28,423 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:28,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:42:28,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:42:28,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:28,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:28,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-26 18:42:28,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:28,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:28,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:28,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:28,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:28,448 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 18:42:28,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:28,471 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 18:42:28,471 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 18:42:28,471 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 876 states and 1746 transitions. cyclomatic complexity: 957 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (in total 16), 3 states have internal predecessors, (16), 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 18:42:28,520 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 876 states and 1746 transitions. cyclomatic complexity: 957. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (in total 16), 3 states have internal predecessors, (16), 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 2487 states and 4936 transitions. Complement of second has 7 states. [2025-04-26 18:42:28,520 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 18:42:28,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (in total 16), 3 states have internal predecessors, (16), 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 18:42:28,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2025-04-26 18:42:28,521 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 86 transitions. Stem has 13 letters. Loop has 3 letters. [2025-04-26 18:42:28,521 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:28,521 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 86 transitions. Stem has 16 letters. Loop has 3 letters. [2025-04-26 18:42:28,522 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:28,522 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 86 transitions. Stem has 13 letters. Loop has 6 letters. [2025-04-26 18:42:28,522 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:28,522 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2487 states and 4936 transitions. [2025-04-26 18:42:28,532 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 56 [2025-04-26 18:42:28,543 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2487 states to 2226 states and 4426 transitions. [2025-04-26 18:42:28,543 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 388 [2025-04-26 18:42:28,544 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 399 [2025-04-26 18:42:28,544 INFO L74 IsDeterministic]: Start isDeterministic. Operand 2226 states and 4426 transitions. [2025-04-26 18:42:28,544 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:28,544 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2226 states and 4426 transitions. [2025-04-26 18:42:28,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2226 states and 4426 transitions. [2025-04-26 18:42:28,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2226 to 1599. [2025-04-26 18:42:28,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1599 states, 1599 states have (on average 1.9743589743589745) internal successors, (in total 3157), 1598 states have internal predecessors, (3157), 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 18:42:28,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1599 states to 1599 states and 3157 transitions. [2025-04-26 18:42:28,573 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1599 states and 3157 transitions. [2025-04-26 18:42:28,573 INFO L438 stractBuchiCegarLoop]: Abstraction has 1599 states and 3157 transitions. [2025-04-26 18:42:28,573 INFO L340 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-04-26 18:42:28,573 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1599 states and 3157 transitions. [2025-04-26 18:42:28,576 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 28 [2025-04-26 18:42:28,576 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:28,576 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:28,577 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:42:28,577 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:42:28,577 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-->L32: Formula: (<= 1 v_b1_2) InVars {b1=v_b1_2} OutVars{b1=v_b1_2} AuxVars[] AssignedVars[]" "[115] L32-->L40-2: Formula: (= v_t1_2 1) InVars {} OutVars{t1=v_t1_2} AuxVars[] AssignedVars[t1]" "[117] L40-2-->thread1FINAL: Formula: (< v_n1_1 v_x1_3) InVars {x1=v_x1_3, n1=v_n1_1} OutVars{x1=v_x1_3, n1=v_n1_1} AuxVars[] AssignedVars[]" "[119] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[151] L19-->$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-->L56: Formula: (<= 1 v_b2_3) InVars {b2=v_b2_3} OutVars{b2=v_b2_3} AuxVars[] AssignedVars[]" "[126] L56-->L64-2: Formula: (= v_t2_3 1) InVars {} OutVars{t2=v_t2_3} AuxVars[] AssignedVars[t2]" "[128] L64-2-->thread2FINAL: Formula: (< v_n2_2 v_x2_6) InVars {n2=v_n2_2, x2=v_x2_6} OutVars{n2=v_n2_2, x2=v_x2_6} AuxVars[] AssignedVars[]" "[130] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[154] L20-->$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-->L84: Formula: (< v_b3_1 1) InVars {b3=v_b3_1} OutVars{b3=v_b3_1} AuxVars[] AssignedVars[]" "[138] L84-->L88-2: Formula: (= (+ v_t3_1 1) 0) InVars {} OutVars{t3=v_t3_1} AuxVars[] AssignedVars[t3]" [2025-04-26 18:42:28,577 INFO L754 eck$LassoCheckResult]: Loop: "[140] L88-2-->L88: Formula: (<= v_x3_2 v_n3_2) InVars {n3=v_n3_2, x3=v_x3_2} OutVars{n3=v_n3_2, x3=v_x3_2} AuxVars[] AssignedVars[]" "[143] L88-->L94: Formula: (< v_b3_3 1) InVars {b3=v_b3_3} OutVars{b3=v_b3_3} AuxVars[] AssignedVars[]" "[145] L94-->L88-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 18:42:28,577 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:28,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1657149848, now seen corresponding path program 1 times [2025-04-26 18:42:28,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:28,577 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725040411] [2025-04-26 18:42:28,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:28,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:28,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:42:28,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:42:28,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:28,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:28,581 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:28,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:42:28,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:42:28,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:28,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:28,584 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:28,584 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:28,584 INFO L85 PathProgramCache]: Analyzing trace with hash 168909, now seen corresponding path program 1 times [2025-04-26 18:42:28,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:28,584 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338092036] [2025-04-26 18:42:28,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:28,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:28,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:28,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:28,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:28,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:28,587 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:28,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:28,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:28,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:28,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:28,588 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:28,588 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:28,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1797160662, now seen corresponding path program 1 times [2025-04-26 18:42:28,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:28,589 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181741337] [2025-04-26 18:42:28,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:28,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:28,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 18:42:28,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 18:42:28,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:28,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:28,592 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:28,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 18:42:28,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 18:42:28,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:28,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:28,597 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:28,686 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:28,687 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:28,687 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:28,687 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:28,687 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:28,687 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:28,687 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:28,687 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:28,687 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_3_x_n_b_t_indep.c.bpl_petrified1_Iteration10_Lasso [2025-04-26 18:42:28,687 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:28,687 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:28,688 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:28,689 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:28,691 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:28,693 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:28,695 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:28,697 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:28,699 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:28,701 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:28,703 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:28,704 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:28,706 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:28,709 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:28,713 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:28,715 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:28,782 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:28,782 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:28,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:28,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:28,784 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 18:42:28,786 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 18:42:28,787 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:28,787 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:28,798 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:42:28,798 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 18:42:28,804 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2025-04-26 18:42:28,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:28,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:28,807 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 18:42:28,808 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 18:42:28,810 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:28,810 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:28,820 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:42:28,821 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 18:42:28,826 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 18:42:28,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:28,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:28,828 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 18:42:28,828 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 18:42:28,830 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:28,830 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:28,840 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:42:28,840 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 18:42:28,845 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 18:42:28,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:28,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:28,847 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:28,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2025-04-26 18:42:28,849 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:28,849 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:28,870 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:42:28,870 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {x1=1, n1=0} Honda state: {x1=1, n1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:42:28,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2025-04-26 18:42:28,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:28,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:28,878 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:28,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2025-04-26 18:42:28,881 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:28,881 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:28,891 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:42:28,892 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {t1=0} Honda state: {t1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:42:28,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:28,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:28,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:28,899 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:28,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2025-04-26 18:42:28,901 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:28,901 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:28,919 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:42:28,919 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {n2=0, x2=1} Honda state: {n2=0, x2=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:42:28,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:28,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:28,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:28,927 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:28,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2025-04-26 18:42:28,929 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:28,929 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:28,939 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:42:28,940 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {t2=0} Honda state: {t2=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:42:28,945 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2025-04-26 18:42:28,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:28,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:28,948 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:28,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2025-04-26 18:42:28,950 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:28,950 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:28,960 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:42:28,960 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 18:42:28,966 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2025-04-26 18:42:28,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:28,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:28,968 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:28,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2025-04-26 18:42:28,971 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:28,971 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:28,982 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:42:28,982 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 18:42:28,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:28,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:28,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:28,991 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:28,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2025-04-26 18:42:28,993 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:28,993 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:29,003 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:42:29,004 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread2Thread1of1ForFork1_thidvar1=0} Honda state: {thread2Thread1of1ForFork1_thidvar1=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:42:29,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:29,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:29,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:29,011 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:29,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2025-04-26 18:42:29,013 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:29,013 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:29,031 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:42:29,031 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {b1=1} Honda state: {b1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:42:29,036 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2025-04-26 18:42:29,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:29,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:29,038 INFO L229 MonitoredProcess]: Starting monitored process 53 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 18:42:29,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2025-04-26 18:42:29,040 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:29,040 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:29,057 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2025-04-26 18:42:29,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:29,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:29,058 INFO L229 MonitoredProcess]: Starting monitored process 54 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 18:42:29,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2025-04-26 18:42:29,060 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:29,060 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:29,157 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:29,162 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2025-04-26 18:42:29,162 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:29,162 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:29,162 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:29,162 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:29,163 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:29,163 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:29,163 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:29,163 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:29,163 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_3_x_n_b_t_indep.c.bpl_petrified1_Iteration10_Lasso [2025-04-26 18:42:29,163 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:29,163 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:29,164 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:29,173 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:29,175 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:29,177 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:29,179 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:29,180 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:29,182 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:29,183 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:29,190 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:29,192 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:29,198 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:29,200 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:29,201 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:29,204 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:29,282 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:29,282 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:29,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:29,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:29,284 INFO L229 MonitoredProcess]: Starting monitored process 55 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 18:42:29,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2025-04-26 18:42:29,287 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 18:42:29,297 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:29,297 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:29,297 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:29,297 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:29,298 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:42:29,298 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:42:29,301 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:42:29,306 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2025-04-26 18:42:29,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:29,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:29,308 INFO L229 MonitoredProcess]: Starting monitored process 56 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 18:42:29,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2025-04-26 18:42:29,311 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 18:42:29,320 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:29,321 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:29,321 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:29,321 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:29,322 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:42:29,322 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:42:29,324 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:42:29,330 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2025-04-26 18:42:29,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:29,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:29,332 INFO L229 MonitoredProcess]: Starting monitored process 57 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 18:42:29,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2025-04-26 18:42:29,334 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 18:42:29,344 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:29,344 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:29,344 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:29,344 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:29,345 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:42:29,345 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:42:29,347 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:42:29,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:29,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:29,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:29,354 INFO L229 MonitoredProcess]: Starting monitored process 58 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 18:42:29,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2025-04-26 18:42:29,356 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 18:42:29,365 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:29,365 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:29,365 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:29,365 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:29,366 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:42:29,366 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:42:29,371 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:42:29,378 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2025-04-26 18:42:29,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:29,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:29,379 INFO L229 MonitoredProcess]: Starting monitored process 59 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 18:42:29,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2025-04-26 18:42:29,382 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 18:42:29,391 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:29,391 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:29,391 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:29,391 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:29,392 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:42:29,392 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:42:29,395 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:42:29,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:29,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:29,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:29,402 INFO L229 MonitoredProcess]: Starting monitored process 60 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 18:42:29,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2025-04-26 18:42:29,403 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 18:42:29,413 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:29,413 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:29,413 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:29,413 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:29,414 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:42:29,414 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:42:29,416 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:42:29,422 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:29,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:29,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:29,423 INFO L229 MonitoredProcess]: Starting monitored process 61 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 18:42:29,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2025-04-26 18:42:29,425 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 18:42:29,434 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:29,434 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:29,434 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:29,434 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:29,435 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:42:29,435 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:42:29,437 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:42:29,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2025-04-26 18:42:29,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:29,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:29,444 INFO L229 MonitoredProcess]: Starting monitored process 62 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 18:42:29,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2025-04-26 18:42:29,446 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 18:42:29,456 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:29,456 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:29,456 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:29,456 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:29,457 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:42:29,457 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:42:29,459 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:42:29,464 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:29,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:29,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:29,466 INFO L229 MonitoredProcess]: Starting monitored process 63 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 18:42:29,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2025-04-26 18:42:29,469 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 18:42:29,479 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:29,479 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:29,479 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:29,479 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:29,480 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:42:29,480 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:42:29,482 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:42:29,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:29,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:29,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:29,490 INFO L229 MonitoredProcess]: Starting monitored process 64 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 18:42:29,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2025-04-26 18:42:29,503 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 18:42:29,513 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:29,514 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:29,514 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:29,514 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:29,516 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:42:29,516 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:42:29,520 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:29,524 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 18:42:29,524 INFO L437 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:42:29,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:29,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:29,525 INFO L229 MonitoredProcess]: Starting monitored process 65 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 18:42:29,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2025-04-26 18:42:29,527 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:29,543 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2025-04-26 18:42:29,543 INFO L439 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-04-26 18:42:29,543 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:29,543 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(n3, x3) = 2*n3 - 2*x3 + 1 Supporting invariants [-1*t3 - 1 >= 0] [2025-04-26 18:42:29,548 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2025-04-26 18:42:29,554 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 18:42:29,573 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:29,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:42:29,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:42:29,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:29,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:29,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-26 18:42:29,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:29,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:29,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:29,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:29,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:29,594 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 18:42:29,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:29,615 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 18:42:29,615 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 18:42:29,616 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1599 states and 3157 transitions. cyclomatic complexity: 1718 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (in total 16), 3 states have internal predecessors, (16), 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 18:42:29,656 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1599 states and 3157 transitions. cyclomatic complexity: 1718. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (in total 16), 3 states have internal predecessors, (16), 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 3210 states and 6347 transitions. Complement of second has 7 states. [2025-04-26 18:42:29,656 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 18:42:29,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (in total 16), 3 states have internal predecessors, (16), 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 18:42:29,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2025-04-26 18:42:29,657 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 86 transitions. Stem has 13 letters. Loop has 3 letters. [2025-04-26 18:42:29,658 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:29,658 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 86 transitions. Stem has 16 letters. Loop has 3 letters. [2025-04-26 18:42:29,658 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:29,658 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 86 transitions. Stem has 13 letters. Loop has 6 letters. [2025-04-26 18:42:29,659 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:29,659 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3210 states and 6347 transitions. [2025-04-26 18:42:29,667 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 56 [2025-04-26 18:42:29,678 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3210 states to 2949 states and 5837 transitions. [2025-04-26 18:42:29,678 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 494 [2025-04-26 18:42:29,679 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 505 [2025-04-26 18:42:29,679 INFO L74 IsDeterministic]: Start isDeterministic. Operand 2949 states and 5837 transitions. [2025-04-26 18:42:29,679 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:29,679 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2949 states and 5837 transitions. [2025-04-26 18:42:29,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2949 states and 5837 transitions. [2025-04-26 18:42:29,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2949 to 2322. [2025-04-26 18:42:29,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2322 states, 2322 states have (on average 1.967269595176572) internal successors, (in total 4568), 2321 states have internal predecessors, (4568), 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 18:42:29,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2322 states to 2322 states and 4568 transitions. [2025-04-26 18:42:29,708 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2322 states and 4568 transitions. [2025-04-26 18:42:29,708 INFO L438 stractBuchiCegarLoop]: Abstraction has 2322 states and 4568 transitions. [2025-04-26 18:42:29,708 INFO L340 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-04-26 18:42:29,708 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2322 states and 4568 transitions. [2025-04-26 18:42:29,712 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 28 [2025-04-26 18:42:29,712 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:29,712 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:29,713 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:42:29,713 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:42:29,714 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-->L32: Formula: (<= 1 v_b1_2) InVars {b1=v_b1_2} OutVars{b1=v_b1_2} AuxVars[] AssignedVars[]" "[115] L32-->L40-2: Formula: (= v_t1_2 1) InVars {} OutVars{t1=v_t1_2} AuxVars[] AssignedVars[t1]" "[117] L40-2-->thread1FINAL: Formula: (< v_n1_1 v_x1_3) InVars {x1=v_x1_3, n1=v_n1_1} OutVars{x1=v_x1_3, n1=v_n1_1} AuxVars[] AssignedVars[]" "[119] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[151] L19-->$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-->L56: Formula: (<= 1 v_b2_3) InVars {b2=v_b2_3} OutVars{b2=v_b2_3} AuxVars[] AssignedVars[]" "[126] L56-->L64-2: Formula: (= v_t2_3 1) InVars {} OutVars{t2=v_t2_3} AuxVars[] AssignedVars[t2]" "[128] L64-2-->thread2FINAL: Formula: (< v_n2_2 v_x2_6) InVars {n2=v_n2_2, x2=v_x2_6} OutVars{n2=v_n2_2, x2=v_x2_6} AuxVars[] AssignedVars[]" "[130] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[154] L20-->$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-->L80: Formula: (<= 1 v_b3_4) InVars {b3=v_b3_4} OutVars{b3=v_b3_4} AuxVars[] AssignedVars[]" "[137] L80-->L88-2: Formula: (= v_t3_4 1) InVars {} OutVars{t3=v_t3_4} AuxVars[] AssignedVars[t3]" "[140] L88-2-->L88: Formula: (<= v_x3_2 v_n3_2) InVars {n3=v_n3_2, x3=v_x3_2} OutVars{n3=v_n3_2, x3=v_x3_2} AuxVars[] AssignedVars[]" "[143] L88-->L94: Formula: (< v_b3_3 1) InVars {b3=v_b3_3} OutVars{b3=v_b3_3} AuxVars[] AssignedVars[]" [2025-04-26 18:42:29,714 INFO L754 eck$LassoCheckResult]: Loop: "[145] L94-->L88-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]" "[140] L88-2-->L88: Formula: (<= v_x3_2 v_n3_2) InVars {n3=v_n3_2, x3=v_x3_2} OutVars{n3=v_n3_2, x3=v_x3_2} AuxVars[] AssignedVars[]" "[143] L88-->L94: Formula: (< v_b3_3 1) InVars {b3=v_b3_3} OutVars{b3=v_b3_3} AuxVars[] AssignedVars[]" [2025-04-26 18:42:29,714 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:29,714 INFO L85 PathProgramCache]: Analyzing trace with hash -911889157, now seen corresponding path program 1 times [2025-04-26 18:42:29,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:29,714 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245390853] [2025-04-26 18:42:29,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:29,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:29,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 18:42:29,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 18:42:29,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:29,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:29,734 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 18:42:29,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:42:29,734 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245390853] [2025-04-26 18:42:29,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245390853] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:42:29,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:42:29,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 18:42:29,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777564640] [2025-04-26 18:42:29,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:42:29,735 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:42:29,735 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:29,735 INFO L85 PathProgramCache]: Analyzing trace with hash 173619, now seen corresponding path program 2 times [2025-04-26 18:42:29,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:29,735 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748630610] [2025-04-26 18:42:29,735 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:42:29,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:29,736 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:29,737 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:29,737 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:42:29,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:29,737 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:29,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:29,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:29,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:29,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:29,738 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:29,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:42:29,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 18:42:29,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 18:42:29,760 INFO L87 Difference]: Start difference. First operand 2322 states and 4568 transitions. cyclomatic complexity: 2479 Second operand has 3 states, 2 states have (on average 7.5) internal successors, (in total 15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:29,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:42:29,778 INFO L93 Difference]: Finished difference Result 2203 states and 4246 transitions. [2025-04-26 18:42:29,778 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2203 states and 4246 transitions. [2025-04-26 18:42:29,783 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 21 [2025-04-26 18:42:29,787 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2203 states to 1363 states and 2619 transitions. [2025-04-26 18:42:29,788 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 230 [2025-04-26 18:42:29,788 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 230 [2025-04-26 18:42:29,788 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1363 states and 2619 transitions. [2025-04-26 18:42:29,788 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:29,788 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1363 states and 2619 transitions. [2025-04-26 18:42:29,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states and 2619 transitions. [2025-04-26 18:42:29,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 1125. [2025-04-26 18:42:29,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1125 states, 1125 states have (on average 1.9111111111111112) internal successors, (in total 2150), 1124 states have internal predecessors, (2150), 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 18:42:29,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 2150 transitions. [2025-04-26 18:42:29,800 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1125 states and 2150 transitions. [2025-04-26 18:42:29,801 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 18:42:29,801 INFO L438 stractBuchiCegarLoop]: Abstraction has 1125 states and 2150 transitions. [2025-04-26 18:42:29,801 INFO L340 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-04-26 18:42:29,801 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1125 states and 2150 transitions. [2025-04-26 18:42:29,803 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 21 [2025-04-26 18:42:29,803 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:29,803 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:29,803 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:42:29,803 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:42:29,803 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-->L32: Formula: (<= 1 v_b1_2) InVars {b1=v_b1_2} OutVars{b1=v_b1_2} AuxVars[] AssignedVars[]" "[115] L32-->L40-2: Formula: (= v_t1_2 1) InVars {} OutVars{t1=v_t1_2} AuxVars[] AssignedVars[t1]" "[117] L40-2-->thread1FINAL: Formula: (< v_n1_1 v_x1_3) InVars {x1=v_x1_3, n1=v_n1_1} OutVars{x1=v_x1_3, n1=v_n1_1} AuxVars[] AssignedVars[]" "[119] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[151] L19-->$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-->L56: Formula: (<= 1 v_b2_3) InVars {b2=v_b2_3} OutVars{b2=v_b2_3} AuxVars[] AssignedVars[]" "[126] L56-->L64-2: Formula: (= v_t2_3 1) InVars {} OutVars{t2=v_t2_3} AuxVars[] AssignedVars[t2]" "[128] L64-2-->thread2FINAL: Formula: (< v_n2_2 v_x2_6) InVars {n2=v_n2_2, x2=v_x2_6} OutVars{n2=v_n2_2, x2=v_x2_6} AuxVars[] AssignedVars[]" "[130] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[154] L20-->$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-->L84: Formula: (< v_b3_1 1) InVars {b3=v_b3_1} OutVars{b3=v_b3_1} AuxVars[] AssignedVars[]" "[138] L84-->L88-2: Formula: (= (+ v_t3_1 1) 0) InVars {} OutVars{t3=v_t3_1} AuxVars[] AssignedVars[t3]" "[140] L88-2-->L88: Formula: (<= v_x3_2 v_n3_2) InVars {n3=v_n3_2, x3=v_x3_2} OutVars{n3=v_n3_2, x3=v_x3_2} AuxVars[] AssignedVars[]" [2025-04-26 18:42:29,803 INFO L754 eck$LassoCheckResult]: Loop: "[142] L88-->L90: Formula: (<= 1 v_b3_2) InVars {b3=v_b3_2} OutVars{b3=v_b3_2} AuxVars[] AssignedVars[]" "[144] L90-->L88-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]" "[140] L88-2-->L88: Formula: (<= v_x3_2 v_n3_2) InVars {n3=v_n3_2, x3=v_x3_2} OutVars{n3=v_n3_2, x3=v_x3_2} AuxVars[] AssignedVars[]" [2025-04-26 18:42:29,803 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:29,803 INFO L85 PathProgramCache]: Analyzing trace with hash -167962124, now seen corresponding path program 1 times [2025-04-26 18:42:29,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:29,804 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165975556] [2025-04-26 18:42:29,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:29,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:29,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:42:29,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:42:29,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:29,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:29,807 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:29,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:42:29,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:42:29,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:29,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:29,810 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:29,810 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:29,810 INFO L85 PathProgramCache]: Analyzing trace with hash 170857, now seen corresponding path program 2 times [2025-04-26 18:42:29,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:29,810 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809304933] [2025-04-26 18:42:29,811 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:42:29,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:29,811 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:29,812 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:29,812 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:42:29,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:29,812 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:29,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:29,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:29,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:29,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:29,817 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:29,817 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:29,817 INFO L85 PathProgramCache]: Analyzing trace with hash -122595178, now seen corresponding path program 1 times [2025-04-26 18:42:29,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:29,817 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517733544] [2025-04-26 18:42:29,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:29,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:29,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 18:42:29,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 18:42:29,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:29,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:29,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:42:29,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:42:29,827 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517733544] [2025-04-26 18:42:29,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517733544] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:42:29,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:42:29,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 18:42:29,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640930220] [2025-04-26 18:42:29,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:42:29,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:42:29,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 18:42:29,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 18:42:29,846 INFO L87 Difference]: Start difference. First operand 1125 states and 2150 transitions. cyclomatic complexity: 1125 Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (in total 17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:29,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:42:29,855 INFO L93 Difference]: Finished difference Result 997 states and 1862 transitions. [2025-04-26 18:42:29,855 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 997 states and 1862 transitions. [2025-04-26 18:42:29,857 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:42:29,857 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 997 states to 0 states and 0 transitions. [2025-04-26 18:42:29,857 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:42:29,857 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:42:29,857 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:42:29,858 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:42:29,858 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:42:29,858 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:42:29,858 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 18:42:29,858 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:42:29,858 INFO L340 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-04-26 18:42:29,858 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:42:29,858 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:42:29,859 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:42:29,870 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-26 18:42:29,871 INFO L201 PluginConnector]: Adding new model adfg_3_x_n_b_t_indep.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:42:29 BoogieIcfgContainer [2025-04-26 18:42:29,871 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:42:29,873 INFO L158 Benchmark]: Toolchain (without parser) took 6575.99ms. Allocated memory was 155.2MB in the beginning and 180.4MB in the end (delta: 25.2MB). Free memory was 87.5MB in the beginning and 50.5MB in the end (delta: 37.1MB). Peak memory consumption was 59.3MB. Max. memory is 8.0GB. [2025-04-26 18:42:29,873 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.72ms. Allocated memory is still 155.2MB. Free memory was 88.6MB in the beginning and 88.4MB in the end (delta: 199.4kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:42:29,873 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.30ms. Allocated memory is still 155.2MB. Free memory was 87.5MB in the beginning and 85.7MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:42:29,873 INFO L158 Benchmark]: Boogie Preprocessor took 23.26ms. Allocated memory is still 155.2MB. Free memory was 85.7MB in the beginning and 84.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:42:29,873 INFO L158 Benchmark]: RCFGBuilder took 168.69ms. Allocated memory is still 155.2MB. Free memory was 84.6MB in the beginning and 74.8MB in the end (delta: 9.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 18:42:29,873 INFO L158 Benchmark]: BuchiAutomizer took 6352.95ms. Allocated memory was 155.2MB in the beginning and 180.4MB in the end (delta: 25.2MB). Free memory was 74.8MB in the beginning and 50.5MB in the end (delta: 24.3MB). Peak memory consumption was 46.7MB. Max. memory is 8.0GB. [2025-04-26 18:42:29,874 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.72ms. Allocated memory is still 155.2MB. Free memory was 88.6MB in the beginning and 88.4MB in the end (delta: 199.4kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 27.30ms. Allocated memory is still 155.2MB. Free memory was 87.5MB in the beginning and 85.7MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 23.26ms. Allocated memory is still 155.2MB. Free memory was 85.7MB in the beginning and 84.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 168.69ms. Allocated memory is still 155.2MB. Free memory was 84.6MB in the beginning and 74.8MB in the end (delta: 9.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 6352.95ms. Allocated memory was 155.2MB in the beginning and 180.4MB in the end (delta: 25.2MB). Free memory was 74.8MB in the beginning and 50.5MB in the end (delta: 24.3MB). Peak memory consumption was 46.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.2s and 13 iterations. TraceHistogramMax:1. Analysis of lassos took 4.3s. Construction of modules took 0.1s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 11. Automata minimization 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 5684 StatesRemovedByMinimization, 11 NontrivialMinimizations. Non-live state removal took 0.2s 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, 668 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 668 mSDsluCounter, 1198 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 503 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 226 IncrementalHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 695 mSDtfsCounter, 226 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN3 SILU0 SILI0 SILT0 lasso6 LassoPreprocessingBenchmarks: Lassos: inital41 mio100 ax100 hnf100 lsp36 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq184 hnf95 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 32ms VariablesStem: 1 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 20 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.3s InitialAbstractionConstructionTime: 0.2s InitialAbstraction: Time to compute Ample Reduction [ms]: 283, Number of transitions in reduction automaton: 1010, Number of states in reduction automaton: 498, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 12 terminating modules (6 trivial, 6 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * x1 + 2 * n1 + t1 and consists of 4 locations. One deterministic module has affine ranking function -2 * x1 + 2 * n1 + 1 and consists of 4 locations. One deterministic module has affine ranking function 2 * n2 + -2 * x2 + 1 and consists of 4 locations. One deterministic module has affine ranking function 2 * n2 + -2 * x2 + 1 and consists of 4 locations. One deterministic module has affine ranking function -2 * x3 + 2 * n3 + 1 and consists of 4 locations. One deterministic module has affine ranking function -2 * x3 + 2 * n3 + 1 and consists of 4 locations. 6 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 18:42:29,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...