/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/Termination.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i /storage/cav23-termute-examples/2_thr/adfg_2_x_n_indep.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:41:58,647 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:41:58,696 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:41:58,699 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:41:58,699 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:41:58,699 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:41:58,700 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:41:58,722 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:41:58,723 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:41:58,723 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:41:58,724 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:41:58,724 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:41:58,724 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:41:58,724 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:41:58,724 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:41:58,724 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:41:58,724 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:41:58,724 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:41:58,724 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:41:58,725 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:41:58,725 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:41:58,725 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:41:58,725 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:41:58,725 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:41:58,725 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:41:58,725 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:41:58,725 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:41:58,725 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:41:58,725 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:41:58,725 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:41:58,725 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:41:58,725 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:41:58,725 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:41:58,725 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:41:58,725 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:41:58,725 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:41:58,726 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:41:58,726 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:41:58,726 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:41:58,726 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:41:58,726 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:41:58,726 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:41:58,726 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:41:58,945 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:41:58,952 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:41:58,953 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:41:58,954 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:41:58,955 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:41:58,956 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/2_thr/adfg_2_x_n_indep.c.bpl [2025-04-26 18:41:58,958 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/2_thr/adfg_2_x_n_indep.c.bpl' [2025-04-26 18:41:58,972 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:41:58,973 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:41:58,974 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:41:58,974 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:41:58,974 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:41:58,982 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "adfg_2_x_n_indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:58" (1/1) ... [2025-04-26 18:41:59,004 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "adfg_2_x_n_indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:58" (1/1) ... [2025-04-26 18:41:59,008 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:41:59,009 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:41:59,010 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:41:59,010 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:41:59,010 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:41:59,014 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "adfg_2_x_n_indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:58" (1/1) ... [2025-04-26 18:41:59,014 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "adfg_2_x_n_indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:58" (1/1) ... [2025-04-26 18:41:59,015 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "adfg_2_x_n_indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:58" (1/1) ... [2025-04-26 18:41:59,015 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "adfg_2_x_n_indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:58" (1/1) ... [2025-04-26 18:41:59,016 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "adfg_2_x_n_indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:58" (1/1) ... [2025-04-26 18:41:59,017 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "adfg_2_x_n_indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:58" (1/1) ... [2025-04-26 18:41:59,019 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "adfg_2_x_n_indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:58" (1/1) ... [2025-04-26 18:41:59,019 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "adfg_2_x_n_indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:58" (1/1) ... [2025-04-26 18:41:59,019 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "adfg_2_x_n_indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:58" (1/1) ... [2025-04-26 18:41:59,024 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:41:59,025 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:41:59,025 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:41:59,025 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:41:59,025 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "adfg_2_x_n_indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:58" (1/1) ... [2025-04-26 18:41:59,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:41:59,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:59,050 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:41:59,052 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:41:59,072 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:41:59,072 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:41:59,073 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:41:59,073 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:41:59,073 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:41:59,073 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:41:59,073 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:41:59,073 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:41:59,073 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:41:59,074 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:41:59,107 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:41:59,108 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:41:59,173 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:41:59,173 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:41:59,180 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:41:59,180 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:41:59,181 INFO L201 PluginConnector]: Adding new model adfg_2_x_n_indep.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:41:59 BoogieIcfgContainer [2025-04-26 18:41:59,181 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:41:59,181 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:41:59,181 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:41:59,186 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:41:59,186 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:41:59,186 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "adfg_2_x_n_indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:58" (1/2) ... [2025-04-26 18:41:59,188 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1a091dec and model type adfg_2_x_n_indep.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:41:59, skipping insertion in model container [2025-04-26 18:41:59,188 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:41:59,188 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "adfg_2_x_n_indep.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:41:59" (2/2) ... [2025-04-26 18:41:59,189 INFO L376 chiAutomizerObserver]: Analyzing ICFG adfg_2_x_n_indep.c.bpl [2025-04-26 18:41:59,237 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 18:41:59,279 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:41:59,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:41:59,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:59,284 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:41:59,287 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:41:59,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 31 transitions, 76 flow [2025-04-26 18:41:59,370 INFO L116 PetriNetUnfolderBase]: 6/27 cut-off events. [2025-04-26 18:41:59,374 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 18:41:59,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 27 events. 6/27 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 47 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 25. Up to 4 conditions per place. [2025-04-26 18:41:59,379 INFO L82 GeneralOperation]: Start removeDead. Operand has 30 places, 31 transitions, 76 flow [2025-04-26 18:41:59,384 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 28 places, 27 transitions, 66 flow [2025-04-26 18:41:59,384 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 28 places, 27 transitions, 66 flow [2025-04-26 18:41:59,385 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 28 places, 27 transitions, 66 flow [2025-04-26 18:41:59,404 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 102 states, 101 states have (on average 2.386138613861386) internal successors, (in total 241), 101 states have internal predecessors, (241), 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:41:59,405 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 102 states, 101 states have (on average 2.386138613861386) internal successors, (in total 241), 101 states have internal predecessors, (241), 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:41:59,408 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:41:59,496 WARN L140 AmpleReduction]: Number of pruned transitions: 48 [2025-04-26 18:41:59,497 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:41:59,497 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 19 [2025-04-26 18:41:59,497 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:23 [2025-04-26 18:41:59,497 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:42 [2025-04-26 18:41:59,497 WARN L145 AmpleReduction]: Times succ was already a loop node:9 [2025-04-26 18:41:59,497 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:28 [2025-04-26 18:41:59,497 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:41:59,498 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 85 states, 84 states have (on average 1.75) internal successors, (in total 147), 84 states have internal predecessors, (147), 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:41:59,504 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:41:59,505 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:41:59,505 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:41:59,505 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:41:59,505 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:41:59,505 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:41:59,505 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:41:59,505 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:41:59,506 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 85 states, 84 states have (on average 1.75) internal successors, (in total 147), 84 states have internal predecessors, (147), 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:41:59,517 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 56 [2025-04-26 18:41:59,518 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:59,518 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:59,521 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 18:41:59,521 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:41:59,521 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:41:59,521 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 85 states, 84 states have (on average 1.75) internal successors, (in total 147), 84 states have internal predecessors, (147), 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:41:59,524 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 56 [2025-04-26 18:41:59,524 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:59,524 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:59,524 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 18:41:59,524 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:41:59,527 INFO L752 eck$LassoCheckResult]: Stem: "[100] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[76] $Ultimate##0-->L25: Formula: (<= 1 v_b_2) InVars {b=v_b_2} OutVars{b=v_b_2} AuxVars[] AssignedVars[]" "[78] L25-->L33-2: Formula: (= v_t_2 1) InVars {} OutVars{t=v_t_2} AuxVars[] AssignedVars[t]" [2025-04-26 18:41:59,528 INFO L754 eck$LassoCheckResult]: Loop: "[81] L33-2-->L33: 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[]" "[84] L33-->L39: Formula: (< v_b_1 1) InVars {b=v_b_1} OutVars{b=v_b_1} AuxVars[] AssignedVars[]" "[86] L39-->L33-2: Formula: (= v_x1_2 (+ v_x1_1 v_t_1)) InVars {x1=v_x1_2, t=v_t_1} OutVars{x1=v_x1_1, t=v_t_1} AuxVars[] AssignedVars[x1]" [2025-04-26 18:41:59,531 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:59,531 INFO L85 PathProgramCache]: Analyzing trace with hash 128325, now seen corresponding path program 1 times [2025-04-26 18:41:59,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:59,538 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505189197] [2025-04-26 18:41:59,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:59,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:59,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:59,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:59,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:59,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:59,582 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:59,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:59,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:59,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:59,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:59,597 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:59,599 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:59,599 INFO L85 PathProgramCache]: Analyzing trace with hash 110322, now seen corresponding path program 1 times [2025-04-26 18:41:59,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:59,599 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857760820] [2025-04-26 18:41:59,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:59,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:59,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:59,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:59,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:59,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:59,609 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:59,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:59,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:59,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:59,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:59,616 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:59,616 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:59,617 INFO L85 PathProgramCache]: Analyzing trace with hash -471956690, now seen corresponding path program 1 times [2025-04-26 18:41:59,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:59,617 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875972769] [2025-04-26 18:41:59,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:59,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:59,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:41:59,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:41:59,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:59,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:59,681 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:41:59,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:41:59,682 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875972769] [2025-04-26 18:41:59,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875972769] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:41:59,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:41:59,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 18:41:59,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588330874] [2025-04-26 18:41:59,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:41:59,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:41:59,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 18:41:59,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 18:41:59,812 INFO L87 Difference]: Start difference. First operand has 85 states, 84 states have (on average 1.75) internal successors, (in total 147), 84 states have internal predecessors, (147), 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:41:59,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:41:59,893 INFO L93 Difference]: Finished difference Result 121 states and 191 transitions. [2025-04-26 18:41:59,894 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 121 states and 191 transitions. [2025-04-26 18:41:59,900 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 75 [2025-04-26 18:41:59,904 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 121 states to 105 states and 167 transitions. [2025-04-26 18:41:59,905 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 105 [2025-04-26 18:41:59,906 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 105 [2025-04-26 18:41:59,906 INFO L74 IsDeterministic]: Start isDeterministic. Operand 105 states and 167 transitions. [2025-04-26 18:41:59,907 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:41:59,907 INFO L218 hiAutomatonCegarLoop]: Abstraction has 105 states and 167 transitions. [2025-04-26 18:41:59,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states and 167 transitions. [2025-04-26 18:41:59,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2025-04-26 18:41:59,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 105 states have (on average 1.5904761904761904) internal successors, (in total 167), 104 states have internal predecessors, (167), 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:41:59,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 167 transitions. [2025-04-26 18:41:59,932 INFO L240 hiAutomatonCegarLoop]: Abstraction has 105 states and 167 transitions. [2025-04-26 18:41:59,934 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 18:41:59,937 INFO L438 stractBuchiCegarLoop]: Abstraction has 105 states and 167 transitions. [2025-04-26 18:41:59,937 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:41:59,937 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 105 states and 167 transitions. [2025-04-26 18:41:59,938 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 75 [2025-04-26 18:41:59,938 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:59,938 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:59,939 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 18:41:59,939 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:41:59,939 INFO L752 eck$LassoCheckResult]: Stem: "[100] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[76] $Ultimate##0-->L25: Formula: (<= 1 v_b_2) InVars {b=v_b_2} OutVars{b=v_b_2} AuxVars[] AssignedVars[]" "[78] L25-->L33-2: Formula: (= v_t_2 1) InVars {} OutVars{t=v_t_2} AuxVars[] AssignedVars[t]" [2025-04-26 18:41:59,939 INFO L754 eck$LassoCheckResult]: Loop: "[81] L33-2-->L33: 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[]" "[83] L33-->L35: Formula: (<= 1 v_b_4) InVars {b=v_b_4} OutVars{b=v_b_4} AuxVars[] AssignedVars[]" "[85] L35-->L33-2: Formula: (= v_x1_5 (+ v_x1_6 v_t_4)) InVars {x1=v_x1_6, t=v_t_4} OutVars{x1=v_x1_5, t=v_t_4} AuxVars[] AssignedVars[x1]" [2025-04-26 18:41:59,941 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:59,941 INFO L85 PathProgramCache]: Analyzing trace with hash 128325, now seen corresponding path program 2 times [2025-04-26 18:41:59,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:59,942 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213838014] [2025-04-26 18:41:59,942 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:41:59,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:59,946 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:59,947 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:59,947 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:41:59,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:59,947 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:59,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:59,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:59,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:59,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:59,953 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:59,953 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:59,953 INFO L85 PathProgramCache]: Analyzing trace with hash 110290, now seen corresponding path program 1 times [2025-04-26 18:41:59,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:59,954 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399140232] [2025-04-26 18:41:59,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:59,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:59,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:59,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:59,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:59,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:59,959 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:59,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:59,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:59,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:59,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:59,961 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:59,962 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:59,962 INFO L85 PathProgramCache]: Analyzing trace with hash -471956722, now seen corresponding path program 1 times [2025-04-26 18:41:59,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:59,962 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595031713] [2025-04-26 18:41:59,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:59,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:59,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:41:59,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:41:59,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:59,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:59,966 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:59,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:41:59,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:41:59,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:59,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:59,970 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:00,010 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:00,011 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:00,011 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:00,011 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:00,011 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:00,011 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:00,011 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:00,011 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:00,011 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_2_x_n_indep.c.bpl_petrified1_Iteration2_Lasso [2025-04-26 18:42:00,011 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:00,012 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:00,022 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:00,033 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:00,036 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:00,074 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:00,075 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:00,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:00,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:00,078 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:00,079 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:00,080 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:00,081 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:00,099 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:00,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:00,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:00,101 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:00,102 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:00,103 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:00,103 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:00,250 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:00,257 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:00,257 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:00,257 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:00,257 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:00,257 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:00,258 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:00,258 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:00,258 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:00,258 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:00,258 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_2_x_n_indep.c.bpl_petrified1_Iteration2_Lasso [2025-04-26 18:42:00,258 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:00,258 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:00,259 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:00,269 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:00,274 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:00,310 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:00,313 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:00,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:00,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:00,316 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:00,318 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:00,319 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:00,330 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:00,331 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:00,331 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:00,331 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:00,338 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:42:00,338 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:42:00,347 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:00,357 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:42:00,357 INFO L437 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:42:00,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:00,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:00,360 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:00,361 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:00,361 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:00,377 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 18:42:00,378 INFO L439 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-04-26 18:42:00,378 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:00,379 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(n1, x1) = 2*n1 - 2*x1 + 1 Supporting invariants [1*t - 1 >= 0] [2025-04-26 18:42:00,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:00,388 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 18:42:00,411 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:00,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:00,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:00,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:00,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:00,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-26 18:42:00,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:00,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:00,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:00,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:00,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:00,430 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 18:42:00,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:00,461 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:00,463 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:00,463 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 105 states and 167 transitions. cyclomatic complexity: 83 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:00,532 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 105 states and 167 transitions. cyclomatic complexity: 83. 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 185 states and 290 transitions. Complement of second has 6 states. [2025-04-26 18:42:00,534 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:00,535 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:00,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2025-04-26 18:42:00,537 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 3 letters. Loop has 3 letters. [2025-04-26 18:42:00,538 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:00,539 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 6 letters. Loop has 3 letters. [2025-04-26 18:42:00,539 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:00,539 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 3 letters. Loop has 6 letters. [2025-04-26 18:42:00,539 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:00,539 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 185 states and 290 transitions. [2025-04-26 18:42:00,544 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 84 [2025-04-26 18:42:00,545 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 185 states to 142 states and 220 transitions. [2025-04-26 18:42:00,545 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 119 [2025-04-26 18:42:00,545 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 125 [2025-04-26 18:42:00,545 INFO L74 IsDeterministic]: Start isDeterministic. Operand 142 states and 220 transitions. [2025-04-26 18:42:00,546 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:00,546 INFO L218 hiAutomatonCegarLoop]: Abstraction has 142 states and 220 transitions. [2025-04-26 18:42:00,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states and 220 transitions. [2025-04-26 18:42:00,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 125. [2025-04-26 18:42:00,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 125 states have (on average 1.6) internal successors, (in total 200), 124 states have internal predecessors, (200), 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:00,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 200 transitions. [2025-04-26 18:42:00,556 INFO L240 hiAutomatonCegarLoop]: Abstraction has 125 states and 200 transitions. [2025-04-26 18:42:00,556 INFO L438 stractBuchiCegarLoop]: Abstraction has 125 states and 200 transitions. [2025-04-26 18:42:00,556 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:42:00,556 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states and 200 transitions. [2025-04-26 18:42:00,557 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 75 [2025-04-26 18:42:00,557 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:00,557 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:00,557 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 18:42:00,557 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:42:00,558 INFO L752 eck$LassoCheckResult]: Stem: "[100] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[77] $Ultimate##0-->L29: Formula: (< v_b_3 1) InVars {b=v_b_3} OutVars{b=v_b_3} AuxVars[] AssignedVars[]" "[79] L29-->L33-2: Formula: (= (+ v_t_3 1) 0) InVars {} OutVars{t=v_t_3} AuxVars[] AssignedVars[t]" [2025-04-26 18:42:00,558 INFO L754 eck$LassoCheckResult]: Loop: "[81] L33-2-->L33: 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[]" "[84] L33-->L39: Formula: (< v_b_1 1) InVars {b=v_b_1} OutVars{b=v_b_1} AuxVars[] AssignedVars[]" "[86] L39-->L33-2: Formula: (= v_x1_2 (+ v_x1_1 v_t_1)) InVars {x1=v_x1_2, t=v_t_1} OutVars{x1=v_x1_1, t=v_t_1} AuxVars[] AssignedVars[x1]" [2025-04-26 18:42:00,558 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:00,558 INFO L85 PathProgramCache]: Analyzing trace with hash 128357, now seen corresponding path program 1 times [2025-04-26 18:42:00,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:00,558 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622925540] [2025-04-26 18:42:00,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:00,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:00,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:00,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:00,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:00,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:00,561 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:00,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:00,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:00,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:00,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:00,564 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:00,564 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:00,564 INFO L85 PathProgramCache]: Analyzing trace with hash 110322, now seen corresponding path program 2 times [2025-04-26 18:42:00,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:00,564 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526199633] [2025-04-26 18:42:00,564 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:42:00,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:00,566 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:00,567 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:00,567 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:42:00,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:00,567 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:00,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:00,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:00,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:00,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:00,570 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:00,570 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:00,570 INFO L85 PathProgramCache]: Analyzing trace with hash -471003378, now seen corresponding path program 1 times [2025-04-26 18:42:00,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:00,571 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096035860] [2025-04-26 18:42:00,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:00,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:00,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:42:00,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:42:00,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:00,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:00,580 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:00,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:42:00,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:42:00,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:00,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:00,583 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:00,621 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:00,621 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:00,621 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:00,621 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:00,621 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:00,621 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:00,621 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:00,621 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:00,622 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_2_x_n_indep.c.bpl_petrified1_Iteration3_Lasso [2025-04-26 18:42:00,622 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:00,622 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:00,622 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:00,625 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:00,628 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:00,658 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:00,658 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:00,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:00,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:00,660 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:00,662 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:00,663 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:00,663 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:00,674 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:42:00,674 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:00,680 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:00,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:00,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:00,682 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:00,683 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:00,685 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:00,685 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:00,702 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:42:00,702 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {b=0} Honda state: {b=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:42:00,708 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:00,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:00,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:00,710 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:00,711 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:00,713 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:00,713 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:00,730 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:00,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:00,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:00,732 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:00,733 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:00,735 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:00,735 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:00,857 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:00,862 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:00,863 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:00,863 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:00,863 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:00,863 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:00,863 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:00,863 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:00,863 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:00,863 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:00,863 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_2_x_n_indep.c.bpl_petrified1_Iteration3_Lasso [2025-04-26 18:42:00,863 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:00,863 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:00,864 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:00,869 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:00,872 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:00,902 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:00,902 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:00,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:00,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:00,904 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:00,906 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:00,907 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:00,917 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:00,918 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:00,918 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:00,918 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:00,919 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:42:00,920 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:42:00,922 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:42:00,928 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:00,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:00,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:00,930 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:00,931 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:00,932 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:00,942 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:00,942 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:00,942 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:00,942 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:00,943 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:42:00,944 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:42:00,946 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:42:00,952 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-04-26 18:42:00,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:00,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:00,954 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:00,955 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:00,956 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:00,966 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:00,966 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:00,966 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:00,967 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:00,969 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:42:00,969 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:42:00,973 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:00,978 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 18:42:00,978 INFO L437 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:42:00,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:00,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:00,980 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:00,981 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:00,982 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:00,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 18:42:00,998 INFO L439 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-04-26 18:42:00,998 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:00,998 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(n1, x1) = 2*n1 - 2*x1 + 1 Supporting invariants [-1*t - 1 >= 0] [2025-04-26 18:42:01,004 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:01,008 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 18:42:01,031 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:01,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:01,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:01,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:01,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:01,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-26 18:42:01,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:01,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:01,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:01,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:01,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:01,047 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 18:42:01,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:01,072 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:01,073 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:01,073 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 125 states and 200 transitions. cyclomatic complexity: 99 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:01,138 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 125 states and 200 transitions. cyclomatic complexity: 99. 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 244 states and 384 transitions. Complement of second has 7 states. [2025-04-26 18:42:01,141 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:01,142 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:01,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2025-04-26 18:42:01,142 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 51 transitions. Stem has 3 letters. Loop has 3 letters. [2025-04-26 18:42:01,142 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:01,142 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 51 transitions. Stem has 6 letters. Loop has 3 letters. [2025-04-26 18:42:01,142 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:01,142 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 51 transitions. Stem has 3 letters. Loop has 6 letters. [2025-04-26 18:42:01,142 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:01,142 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 244 states and 384 transitions. [2025-04-26 18:42:01,144 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 72 [2025-04-26 18:42:01,147 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 244 states to 197 states and 303 transitions. [2025-04-26 18:42:01,149 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 133 [2025-04-26 18:42:01,150 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 156 [2025-04-26 18:42:01,150 INFO L74 IsDeterministic]: Start isDeterministic. Operand 197 states and 303 transitions. [2025-04-26 18:42:01,150 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:01,150 INFO L218 hiAutomatonCegarLoop]: Abstraction has 197 states and 303 transitions. [2025-04-26 18:42:01,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states and 303 transitions. [2025-04-26 18:42:01,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 136. [2025-04-26 18:42:01,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 136 states have (on average 1.6397058823529411) internal successors, (in total 223), 135 states have internal predecessors, (223), 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:01,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 223 transitions. [2025-04-26 18:42:01,158 INFO L240 hiAutomatonCegarLoop]: Abstraction has 136 states and 223 transitions. [2025-04-26 18:42:01,158 INFO L438 stractBuchiCegarLoop]: Abstraction has 136 states and 223 transitions. [2025-04-26 18:42:01,159 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:42:01,159 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 136 states and 223 transitions. [2025-04-26 18:42:01,159 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 54 [2025-04-26 18:42:01,159 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:01,159 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:01,160 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 18:42:01,160 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:42:01,160 INFO L752 eck$LassoCheckResult]: Stem: "[100] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[76] $Ultimate##0-->L25: Formula: (<= 1 v_b_2) InVars {b=v_b_2} OutVars{b=v_b_2} AuxVars[] AssignedVars[]" "[103] L14-->$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]" "[87] $Ultimate##0-->L49: Formula: (<= 1 v_b_7) InVars {b=v_b_7} OutVars{b=v_b_7} AuxVars[] AssignedVars[]" "[89] L49-->L57-2: Formula: (= v_t_7 1) InVars {} OutVars{t=v_t_7} AuxVars[] AssignedVars[t]" [2025-04-26 18:42:01,160 INFO L754 eck$LassoCheckResult]: Loop: "[92] L57-2-->L57: 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[]" "[94] L57-->L59: Formula: (<= 1 v_b_5) InVars {b=v_b_5} OutVars{b=v_b_5} AuxVars[] AssignedVars[]" "[96] L59-->L57-2: Formula: (= v_x2_2 (+ v_x2_3 v_t_5)) InVars {t=v_t_5, x2=v_x2_3} OutVars{t=v_t_5, x2=v_x2_2} AuxVars[] AssignedVars[x2]" [2025-04-26 18:42:01,160 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:01,160 INFO L85 PathProgramCache]: Analyzing trace with hash 123347136, now seen corresponding path program 1 times [2025-04-26 18:42:01,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:01,161 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575636649] [2025-04-26 18:42:01,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:01,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:01,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:42:01,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:01,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:01,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:01,166 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:01,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:42:01,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:01,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:01,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:01,171 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:01,171 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:01,171 INFO L85 PathProgramCache]: Analyzing trace with hash 121213, now seen corresponding path program 1 times [2025-04-26 18:42:01,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:01,171 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100121311] [2025-04-26 18:42:01,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:01,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:01,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:01,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:01,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:01,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:01,177 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:01,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:01,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:01,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:01,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:01,182 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:01,183 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:01,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1857385378, now seen corresponding path program 1 times [2025-04-26 18:42:01,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:01,183 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676772506] [2025-04-26 18:42:01,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:01,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:01,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:42:01,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:42:01,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:01,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:01,189 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:01,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:42:01,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:42:01,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:01,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:01,195 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:01,233 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:01,233 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:01,233 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:01,233 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:01,233 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:01,233 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:01,233 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:01,233 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:01,233 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_2_x_n_indep.c.bpl_petrified1_Iteration4_Lasso [2025-04-26 18:42:01,233 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:01,233 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:01,234 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:01,236 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:01,239 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:01,240 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:01,248 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:01,285 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:01,286 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:01,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:01,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:01,289 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:01,290 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:01,291 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:01,291 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:01,303 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:42:01,304 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:01,313 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:01,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:01,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:01,315 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:01,317 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:01,318 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:01,318 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:01,335 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:42:01,335 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {b=1} Honda state: {b=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:42:01,341 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:01,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:01,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:01,343 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:01,344 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:01,344 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:01,344 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:01,355 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:42:01,355 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:01,360 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:01,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:01,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:01,362 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:01,368 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:01,368 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:01,368 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:01,385 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-04-26 18:42:01,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:01,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:01,387 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:01,388 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:01,390 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:01,390 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:01,541 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:01,547 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:01,548 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:01,548 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:01,548 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:01,548 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:01,548 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:01,548 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:01,548 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:01,548 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:01,548 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_2_x_n_indep.c.bpl_petrified1_Iteration4_Lasso [2025-04-26 18:42:01,548 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:01,548 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:01,549 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:01,552 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:01,554 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:01,556 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:01,560 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:01,603 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:01,603 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:01,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:01,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:01,605 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:01,606 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:01,608 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:01,617 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:01,617 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:01,617 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:01,617 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:01,619 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:42:01,619 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:42:01,622 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:42:01,628 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:01,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:01,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:01,631 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:01,632 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:01,633 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:01,643 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:01,643 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:01,643 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:01,643 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:01,644 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:42:01,644 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:42:01,647 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:42:01,653 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:01,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:01,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:01,655 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:01,657 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:01,659 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:01,668 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:01,669 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:01,669 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:01,669 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:01,670 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:42:01,670 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:42:01,672 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:42:01,678 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-04-26 18:42:01,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:01,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:01,680 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:01,681 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:01,682 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:01,691 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:01,692 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:01,692 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:01,692 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:01,693 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:42:01,694 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:42:01,698 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:01,703 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 18:42:01,703 INFO L437 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:42:01,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:01,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:01,705 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:01,707 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:01,708 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:01,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:01,724 INFO L439 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-04-26 18:42:01,724 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:01,724 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(n2, x2) = 2*n2 - 2*x2 + 1 Supporting invariants [1*t - 1 >= 0] [2025-04-26 18:42:01,730 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-04-26 18:42:01,738 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 18:42:01,754 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:01,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:42:01,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:01,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:01,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:01,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-26 18:42:01,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:01,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:01,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:01,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:01,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:01,775 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 18:42:01,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:01,795 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:01,795 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:01,796 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 136 states and 223 transitions. cyclomatic complexity: 111 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:01,846 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 136 states and 223 transitions. cyclomatic complexity: 111. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 253 states and 400 transitions. Complement of second has 7 states. [2025-04-26 18:42:01,847 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:01,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:01,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2025-04-26 18:42:01,848 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 45 transitions. Stem has 5 letters. Loop has 3 letters. [2025-04-26 18:42:01,848 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:01,848 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 45 transitions. Stem has 8 letters. Loop has 3 letters. [2025-04-26 18:42:01,848 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:01,848 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 45 transitions. Stem has 5 letters. Loop has 6 letters. [2025-04-26 18:42:01,848 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:01,848 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 253 states and 400 transitions. [2025-04-26 18:42:01,850 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 90 [2025-04-26 18:42:01,853 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 253 states to 162 states and 252 transitions. [2025-04-26 18:42:01,853 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 122 [2025-04-26 18:42:01,853 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 125 [2025-04-26 18:42:01,854 INFO L74 IsDeterministic]: Start isDeterministic. Operand 162 states and 252 transitions. [2025-04-26 18:42:01,854 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:01,854 INFO L218 hiAutomatonCegarLoop]: Abstraction has 162 states and 252 transitions. [2025-04-26 18:42:01,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states and 252 transitions. [2025-04-26 18:42:01,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 130. [2025-04-26 18:42:01,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 130 states have (on average 1.6076923076923078) internal successors, (in total 209), 129 states have internal predecessors, (209), 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:01,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 209 transitions. [2025-04-26 18:42:01,862 INFO L240 hiAutomatonCegarLoop]: Abstraction has 130 states and 209 transitions. [2025-04-26 18:42:01,862 INFO L438 stractBuchiCegarLoop]: Abstraction has 130 states and 209 transitions. [2025-04-26 18:42:01,862 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 18:42:01,863 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 130 states and 209 transitions. [2025-04-26 18:42:01,863 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 60 [2025-04-26 18:42:01,863 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:01,865 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:01,866 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 18:42:01,866 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:42:01,866 INFO L752 eck$LassoCheckResult]: Stem: "[100] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[77] $Ultimate##0-->L29: Formula: (< v_b_3 1) InVars {b=v_b_3} OutVars{b=v_b_3} AuxVars[] AssignedVars[]" "[103] L14-->$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]" "[87] $Ultimate##0-->L49: Formula: (<= 1 v_b_7) InVars {b=v_b_7} OutVars{b=v_b_7} AuxVars[] AssignedVars[]" "[79] L29-->L33-2: Formula: (= (+ v_t_3 1) 0) InVars {} OutVars{t=v_t_3} AuxVars[] AssignedVars[t]" [2025-04-26 18:42:01,866 INFO L754 eck$LassoCheckResult]: Loop: "[81] L33-2-->L33: 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[]" "[83] L33-->L35: Formula: (<= 1 v_b_4) InVars {b=v_b_4} OutVars{b=v_b_4} AuxVars[] AssignedVars[]" "[85] L35-->L33-2: Formula: (= v_x1_5 (+ v_x1_6 v_t_4)) InVars {x1=v_x1_6, t=v_t_4} OutVars{x1=v_x1_5, t=v_t_4} AuxVars[] AssignedVars[x1]" [2025-04-26 18:42:01,866 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:01,866 INFO L85 PathProgramCache]: Analyzing trace with hash 123376917, now seen corresponding path program 1 times [2025-04-26 18:42:01,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:01,866 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898733916] [2025-04-26 18:42:01,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:01,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:01,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:42:01,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:01,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:01,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:01,885 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:01,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:42:01,885 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898733916] [2025-04-26 18:42:01,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898733916] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:42:01,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:42:01,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 18:42:01,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777116997] [2025-04-26 18:42:01,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:42:01,886 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:42:01,886 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:01,886 INFO L85 PathProgramCache]: Analyzing trace with hash 110290, now seen corresponding path program 2 times [2025-04-26 18:42:01,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:01,886 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528614186] [2025-04-26 18:42:01,886 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:42:01,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:01,888 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:01,888 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:01,888 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:42:01,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:01,893 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:01,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:01,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:01,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:01,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:01,895 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:01,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:42:01,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 18:42:01,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 18:42:01,913 INFO L87 Difference]: Start difference. First operand 130 states and 209 transitions. cyclomatic complexity: 104 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:01,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:42:01,920 INFO L93 Difference]: Finished difference Result 62 states and 94 transitions. [2025-04-26 18:42:01,920 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 94 transitions. [2025-04-26 18:42:01,920 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2025-04-26 18:42:01,921 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 43 states and 62 transitions. [2025-04-26 18:42:01,921 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2025-04-26 18:42:01,921 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2025-04-26 18:42:01,921 INFO L74 IsDeterministic]: Start isDeterministic. Operand 43 states and 62 transitions. [2025-04-26 18:42:01,921 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:01,921 INFO L218 hiAutomatonCegarLoop]: Abstraction has 43 states and 62 transitions. [2025-04-26 18:42:01,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 62 transitions. [2025-04-26 18:42:01,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-04-26 18:42:01,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.441860465116279) internal successors, (in total 62), 42 states have internal predecessors, (62), 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:01,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 62 transitions. [2025-04-26 18:42:01,923 INFO L240 hiAutomatonCegarLoop]: Abstraction has 43 states and 62 transitions. [2025-04-26 18:42:01,923 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 18:42:01,923 INFO L438 stractBuchiCegarLoop]: Abstraction has 43 states and 62 transitions. [2025-04-26 18:42:01,923 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 18:42:01,923 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 62 transitions. [2025-04-26 18:42:01,924 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2025-04-26 18:42:01,924 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:01,924 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:01,925 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 18:42:01,925 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:42:01,925 INFO L752 eck$LassoCheckResult]: Stem: "[100] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[77] $Ultimate##0-->L29: Formula: (< v_b_3 1) InVars {b=v_b_3} OutVars{b=v_b_3} AuxVars[] AssignedVars[]" "[103] L14-->$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]" "[88] $Ultimate##0-->L53: Formula: (< v_b_8 1) InVars {b=v_b_8} OutVars{b=v_b_8} AuxVars[] AssignedVars[]" "[90] L53-->L57-2: Formula: (= (+ v_t_8 1) 0) InVars {} OutVars{t=v_t_8} AuxVars[] AssignedVars[t]" [2025-04-26 18:42:01,925 INFO L754 eck$LassoCheckResult]: Loop: "[92] L57-2-->L57: 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[]" "[95] L57-->L63: Formula: (< v_b_6 1) InVars {b=v_b_6} OutVars{b=v_b_6} AuxVars[] AssignedVars[]" "[97] L63-->L57-2: Formula: (= v_x2_5 (+ v_x2_4 v_t_6)) InVars {t=v_t_6, x2=v_x2_5} OutVars{t=v_t_6, x2=v_x2_4} AuxVars[] AssignedVars[x2]" [2025-04-26 18:42:01,925 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:01,925 INFO L85 PathProgramCache]: Analyzing trace with hash 123376959, now seen corresponding path program 1 times [2025-04-26 18:42:01,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:01,925 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288101350] [2025-04-26 18:42:01,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:01,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:01,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:42:01,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:01,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:01,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:01,928 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:01,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:42:01,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:01,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:01,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:01,931 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:01,931 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:01,931 INFO L85 PathProgramCache]: Analyzing trace with hash 121245, now seen corresponding path program 1 times [2025-04-26 18:42:01,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:01,931 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803114095] [2025-04-26 18:42:01,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:01,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:01,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:01,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:01,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:01,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:01,933 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:01,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:01,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:01,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:01,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:01,935 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:01,935 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:01,935 INFO L85 PathProgramCache]: Analyzing trace with hash -968928353, now seen corresponding path program 1 times [2025-04-26 18:42:01,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:01,935 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708393920] [2025-04-26 18:42:01,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:01,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:01,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:42:01,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:42:01,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:01,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:01,938 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:01,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:42:01,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:42:01,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:01,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:01,942 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:01,979 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:01,980 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:01,980 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:01,980 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:01,980 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:01,980 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:01,980 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:01,980 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:01,980 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_2_x_n_indep.c.bpl_petrified1_Iteration6_Lasso [2025-04-26 18:42:01,980 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:01,980 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:01,980 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:01,989 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:01,991 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:01,993 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:01,998 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:02,032 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:02,032 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:02,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:02,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:02,036 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:02,037 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:02,038 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:02,038 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:02,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-04-26 18:42:02,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:02,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:02,057 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:02,058 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:02,059 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:02,059 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:02,176 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:02,181 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:02,181 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:02,181 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:02,181 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:02,181 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:02,181 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:02,181 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:02,181 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:02,181 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:02,182 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_2_x_n_indep.c.bpl_petrified1_Iteration6_Lasso [2025-04-26 18:42:02,182 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:02,182 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:02,182 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:02,188 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:02,191 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:02,195 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:02,197 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:02,230 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:02,231 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:02,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:02,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:02,232 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:02,234 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:02,235 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:02,245 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:02,245 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:02,245 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:02,245 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:02,246 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:42:02,246 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:42:02,249 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:42:02,254 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:02,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:02,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:02,256 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:02,257 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:02,258 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:02,267 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:02,267 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:02,267 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:02,267 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:02,268 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:42:02,268 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:42:02,270 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:42:02,276 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-04-26 18:42:02,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:02,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:02,278 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:02,279 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:02,281 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:02,291 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:02,291 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:02,291 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:02,291 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:02,292 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:42:02,292 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:42:02,296 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:02,300 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:42:02,300 INFO L437 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:42:02,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:02,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:02,302 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:02,302 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:02,303 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:02,318 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:02,319 INFO L439 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-04-26 18:42:02,319 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:02,319 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(n2, x2) = 2*n2 - 2*x2 + 1 Supporting invariants [-1*t - 1 >= 0] [2025-04-26 18:42:02,324 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:02,326 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 18:42:02,348 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:02,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:42:02,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:02,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:02,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:02,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-26 18:42:02,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:02,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:02,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:02,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:02,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:02,361 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 18:42:02,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:02,381 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:02,381 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:02,381 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 62 transitions. cyclomatic complexity: 26 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:02,412 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 43 states and 62 transitions. cyclomatic complexity: 26. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 86 states and 129 transitions. Complement of second has 6 states. [2025-04-26 18:42:02,414 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:02,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:02,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2025-04-26 18:42:02,415 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 5 letters. Loop has 3 letters. [2025-04-26 18:42:02,415 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:02,415 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 8 letters. Loop has 3 letters. [2025-04-26 18:42:02,415 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:02,415 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 5 letters. Loop has 6 letters. [2025-04-26 18:42:02,415 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:02,415 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 129 transitions. [2025-04-26 18:42:02,416 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:42:02,416 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 0 states and 0 transitions. [2025-04-26 18:42:02,416 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:42:02,416 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:42:02,416 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:42:02,416 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:42:02,416 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:42:02,416 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:42:02,416 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:42:02,416 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 18:42:02,416 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:42:02,416 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:42:02,416 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:42:02,429 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:02,430 INFO L201 PluginConnector]: Adding new model adfg_2_x_n_indep.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:42:02 BoogieIcfgContainer [2025-04-26 18:42:02,430 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:42:02,431 INFO L158 Benchmark]: Toolchain (without parser) took 3457.37ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 86.5MB in the beginning and 50.1MB in the end (delta: 36.5MB). Peak memory consumption was 35.8MB. Max. memory is 8.0GB. [2025-04-26 18:42:02,432 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.78ms. Allocated memory is still 159.4MB. Free memory was 87.5MB in the beginning and 87.3MB in the end (delta: 199.4kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:42:02,432 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.64ms. Allocated memory is still 159.4MB. Free memory was 86.5MB in the beginning and 83.8MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:42:02,433 INFO L158 Benchmark]: Boogie Preprocessor took 14.29ms. Allocated memory is still 159.4MB. Free memory was 83.8MB in the beginning and 82.9MB in the end (delta: 912.2kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 18:42:02,433 INFO L158 Benchmark]: RCFGBuilder took 156.11ms. Allocated memory is still 159.4MB. Free memory was 82.7MB in the beginning and 73.7MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 18:42:02,434 INFO L158 Benchmark]: BuchiAutomizer took 3248.95ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 73.5MB in the beginning and 50.1MB in the end (delta: 23.5MB). Peak memory consumption was 23.2MB. Max. memory is 8.0GB. [2025-04-26 18:42:02,435 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.78ms. Allocated memory is still 159.4MB. Free memory was 87.5MB in the beginning and 87.3MB in the end (delta: 199.4kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.64ms. Allocated memory is still 159.4MB. Free memory was 86.5MB in the beginning and 83.8MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 14.29ms. Allocated memory is still 159.4MB. Free memory was 83.8MB in the beginning and 82.9MB in the end (delta: 912.2kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 156.11ms. Allocated memory is still 159.4MB. Free memory was 82.7MB in the beginning and 73.7MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 3248.95ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 73.5MB in the beginning and 50.1MB in the end (delta: 23.5MB). Peak memory consumption was 23.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.1s and 7 iterations. TraceHistogramMax:1. Analysis of lassos took 2.1s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 110 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 188 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 188 mSDsluCounter, 223 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 73 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 111 IncrementalHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 150 mSDtfsCounter, 111 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN1 SILU0 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital26 mio100 ax100 hnf100 lsp50 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq184 hnf95 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 64ms VariablesStem: 1 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 5 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.7s InitialAbstractionConstructionTime: 0.2s InitialAbstraction: Time to compute Ample Reduction [ms]: 225, Number of transitions in reduction automaton: 147, Number of states in reduction automaton: 85, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (2 trivial, 4 deterministic, 0 nondeterministic). 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 * 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. 2 modules have a trivial ranking function, the largest among these consists of 3 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 18:42:02,448 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...